/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:24:57,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:24:57,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:24:57,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:24:57,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:24:57,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:24:57,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:24:57,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:24:57,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:24:57,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:24:57,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:24:57,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:24:57,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:24:57,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:24:57,972 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:24:57,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:24:57,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:24:57,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:24:57,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:24:57,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:24:57,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:24:57,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:24:57,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:24:57,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:24:58,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:24:58,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:24:58,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:24:58,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:24:58,230 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:24:58,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 17:24:59,556 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30858a38/f2d656884e774b02a28c1a0a4b65690f/FLAG51a93172f [2025-04-13 17:24:59,950 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:24:59,950 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 17:24:59,989 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30858a38/f2d656884e774b02a28c1a0a4b65690f/FLAG51a93172f [2025-04-13 17:25:00,697 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30858a38/f2d656884e774b02a28c1a0a4b65690f [2025-04-13 17:25:00,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:25:00,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:25:00,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:25:00,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:25:00,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:25:00,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:25:00" (1/1) ... [2025-04-13 17:25:00,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6976bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:00, skipping insertion in model container [2025-04-13 17:25:00,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:25:00" (1/1) ... [2025-04-13 17:25:00,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:25:01,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-13 17:25:05,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:25:05,269 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:25:05,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-04-13 17:25:05,392 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-04-13 17:25:05,393 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-04-13 17:25:05,393 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-04-13 17:25:05,394 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-04-13 17:25:05,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-04-13 17:25:05,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:25:05,771 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:25:05,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05 WrapperNode [2025-04-13 17:25:05,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:25:05,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:25:05,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:25:05,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:25:05,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,896 INFO L138 Inliner]: procedures = 1352, calls = 1469, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-04-13 17:25:05,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:25:05,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:25:05,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:25:05,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:25:05,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,938 INFO L175 MemorySlicer]: Split 52 memory accesses to 7 slices as follows [2, 9, 1, 4, 2, 3, 31]. 60 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 1, 4, 2, 3, 31]. The 3 writes are split as follows [0, 3, 0, 0, 0, 0, 0]. [2025-04-13 17:25:05,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:05,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:25:05,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:25:05,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:25:05,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:25:05,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (1/1) ... [2025-04-13 17:25:06,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:25:06,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:25:06,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:25:06,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:25:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:25:06,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-04-13 17:25:06,045 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 17:25:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-04-13 17:25:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 17:25:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 17:25:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-13 17:25:06,048 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:25:06,400 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:25:06,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:25:06,788 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:25:06,789 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:25:06,789 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:25:07,847 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:25:07,858 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:25:07,874 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:25:07,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:25:07 BoogieIcfgContainer [2025-04-13 17:25:07,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:25:07,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:25:07,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:25:07,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:25:07,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:25:00" (1/3) ... [2025-04-13 17:25:07,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e41d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:25:07, skipping insertion in model container [2025-04-13 17:25:07,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:25:05" (2/3) ... [2025-04-13 17:25:07,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e41d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:25:07, skipping insertion in model container [2025-04-13 17:25:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:25:07" (3/3) ... [2025-04-13 17:25:07,882 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-04-13 17:25:07,897 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:25:07,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 29 locations, 34 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 17:25:07,900 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:25:07,978 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:25:08,000 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 42 transitions, 98 flow [2025-04-13 17:25:08,038 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:08,057 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:25:08,064 INFO L340 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=FINITE_AUTOMATA, 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;@2422101a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:25:08,064 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:25:08,068 INFO L278 IsEmpty]: Start isEmpty. Operand has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:08,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:25:08,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:08,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:08,073 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:08,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1971389777, now seen corresponding path program 1 times [2025-04-13 17:25:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:08,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491433168] [2025-04-13 17:25:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:25:08,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:25:08,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:08,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:09,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491433168] [2025-04-13 17:25:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491433168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:25:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563361799] [2025-04-13 17:25:09,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:09,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:25:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:25:09,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:09,672 INFO L87 Difference]: Start difference. First operand has 274 states, 271 states have (on average 3.2509225092250924) internal successors, (881), 273 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:10,277 INFO L93 Difference]: Finished difference Result 474 states and 1425 transitions. [2025-04-13 17:25:10,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:25:10,278 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 17:25:10,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:10,290 INFO L225 Difference]: With dead ends: 474 [2025-04-13 17:25:10,290 INFO L226 Difference]: Without dead ends: 438 [2025-04-13 17:25:10,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:10,296 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 122 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:10,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 14 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:25:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-04-13 17:25:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 340. [2025-04-13 17:25:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 337 states have (on average 3.106824925816024) internal successors, (1047), 339 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1047 transitions. [2025-04-13 17:25:10,366 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 1047 transitions. Word has length 10 [2025-04-13 17:25:10,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:10,366 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 1047 transitions. [2025-04-13 17:25:10,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:10,367 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 1047 transitions. [2025-04-13 17:25:10,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:25:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:10,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:10,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:25:10,368 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:10,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -982590499, now seen corresponding path program 1 times [2025-04-13 17:25:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:10,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547610637] [2025-04-13 17:25:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:25:10,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:25:10,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:10,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:11,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547610637] [2025-04-13 17:25:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547610637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:11,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:25:11,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151034808] [2025-04-13 17:25:11,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:11,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:25:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:11,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:25:11,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:25:11,156 INFO L87 Difference]: Start difference. First operand 340 states and 1047 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:11,404 INFO L93 Difference]: Finished difference Result 378 states and 1136 transitions. [2025-04-13 17:25:11,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:25:11,405 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 17:25:11,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:11,408 INFO L225 Difference]: With dead ends: 378 [2025-04-13 17:25:11,408 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 17:25:11,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:25:11,411 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:11,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 8 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:25:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 17:25:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 256. [2025-04-13 17:25:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 253 states have (on average 2.9446640316205532) internal successors, (745), 255 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 745 transitions. [2025-04-13 17:25:11,432 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 745 transitions. Word has length 11 [2025-04-13 17:25:11,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:11,432 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 745 transitions. [2025-04-13 17:25:11,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:11,432 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 745 transitions. [2025-04-13 17:25:11,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:25:11,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:11,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:11,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:25:11,435 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:11,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 469272594, now seen corresponding path program 1 times [2025-04-13 17:25:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:11,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317830495] [2025-04-13 17:25:11,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:11,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:25:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:25:11,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:12,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317830495] [2025-04-13 17:25:12,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317830495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:12,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:25:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399828809] [2025-04-13 17:25:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:12,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:25:12,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:12,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:25:12,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:12,384 INFO L87 Difference]: Start difference. First operand 256 states and 745 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:13,054 INFO L93 Difference]: Finished difference Result 438 states and 1187 transitions. [2025-04-13 17:25:13,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:25:13,054 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 17:25:13,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:13,056 INFO L225 Difference]: With dead ends: 438 [2025-04-13 17:25:13,057 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 17:25:13,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:13,058 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 120 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:13,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 14 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:25:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 17:25:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 298. [2025-04-13 17:25:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 295 states have (on average 2.823728813559322) internal successors, (833), 297 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 833 transitions. [2025-04-13 17:25:13,088 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 833 transitions. Word has length 12 [2025-04-13 17:25:13,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:13,088 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 833 transitions. [2025-04-13 17:25:13,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:13,088 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 833 transitions. [2025-04-13 17:25:13,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:25:13,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:13,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:13,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:25:13,091 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:13,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1663498954, now seen corresponding path program 1 times [2025-04-13 17:25:13,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:13,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132706872] [2025-04-13 17:25:13,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:25:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:25:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:14,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:14,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132706872] [2025-04-13 17:25:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132706872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:14,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:25:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992665350] [2025-04-13 17:25:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:14,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:25:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:14,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:25:14,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:25:14,229 INFO L87 Difference]: Start difference. First operand 298 states and 833 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:15,317 INFO L93 Difference]: Finished difference Result 380 states and 1001 transitions. [2025-04-13 17:25:15,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:25:15,322 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 17:25:15,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:15,323 INFO L225 Difference]: With dead ends: 380 [2025-04-13 17:25:15,323 INFO L226 Difference]: Without dead ends: 258 [2025-04-13 17:25:15,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:25:15,325 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:15,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:25:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-13 17:25:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 183. [2025-04-13 17:25:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.5303867403314917) internal successors, (458), 182 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 458 transitions. [2025-04-13 17:25:15,342 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 458 transitions. Word has length 13 [2025-04-13 17:25:15,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:15,342 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 458 transitions. [2025-04-13 17:25:15,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:15,342 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 458 transitions. [2025-04-13 17:25:15,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:15,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:15,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:15,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:25:15,344 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:15,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2036424729, now seen corresponding path program 1 times [2025-04-13 17:25:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:15,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560456826] [2025-04-13 17:25:15,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:15,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:15,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:15,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:17,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:17,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560456826] [2025-04-13 17:25:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560456826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:25:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096533508] [2025-04-13 17:25:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:17,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:25:17,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:17,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:25:17,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:25:17,176 INFO L87 Difference]: Start difference. First operand 183 states and 458 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:18,823 INFO L93 Difference]: Finished difference Result 325 states and 741 transitions. [2025-04-13 17:25:18,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:25:18,824 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:18,824 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:18,826 INFO L225 Difference]: With dead ends: 325 [2025-04-13 17:25:18,826 INFO L226 Difference]: Without dead ends: 305 [2025-04-13 17:25:18,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:25:18,827 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:18,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:25:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-04-13 17:25:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 199. [2025-04-13 17:25:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.4568527918781724) internal successors, (484), 198 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 484 transitions. [2025-04-13 17:25:18,847 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 484 transitions. Word has length 18 [2025-04-13 17:25:18,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:18,847 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 484 transitions. [2025-04-13 17:25:18,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:18,847 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 484 transitions. [2025-04-13 17:25:18,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:18,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:18,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:18,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:25:18,848 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:18,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 54229605, now seen corresponding path program 2 times [2025-04-13 17:25:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:18,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385609272] [2025-04-13 17:25:18,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:18,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:18,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:18,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:20,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385609272] [2025-04-13 17:25:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385609272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:25:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264753801] [2025-04-13 17:25:20,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:20,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:25:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:20,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:25:20,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:20,326 INFO L87 Difference]: Start difference. First operand 199 states and 484 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:21,735 INFO L93 Difference]: Finished difference Result 344 states and 787 transitions. [2025-04-13 17:25:21,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:25:21,736 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:21,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:21,738 INFO L225 Difference]: With dead ends: 344 [2025-04-13 17:25:21,738 INFO L226 Difference]: Without dead ends: 317 [2025-04-13 17:25:21,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:25:21,739 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 156 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:21,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 22 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:25:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-13 17:25:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 219. [2025-04-13 17:25:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 2.4331797235023043) internal successors, (528), 218 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 528 transitions. [2025-04-13 17:25:21,790 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 528 transitions. Word has length 18 [2025-04-13 17:25:21,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:21,791 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 528 transitions. [2025-04-13 17:25:21,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:21,791 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 528 transitions. [2025-04-13 17:25:21,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:21,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:21,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:21,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:25:21,792 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:21,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -436971213, now seen corresponding path program 1 times [2025-04-13 17:25:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:21,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076271395] [2025-04-13 17:25:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:21,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:23,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076271395] [2025-04-13 17:25:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076271395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:23,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337895050] [2025-04-13 17:25:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:23,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:23,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:23,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:23,361 INFO L87 Difference]: Start difference. First operand 219 states and 528 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:24,557 INFO L93 Difference]: Finished difference Result 387 states and 947 transitions. [2025-04-13 17:25:24,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:25:24,557 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:24,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:24,559 INFO L225 Difference]: With dead ends: 387 [2025-04-13 17:25:24,559 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 17:25:24,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:25:24,560 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 133 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:24,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 11 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:25:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 17:25:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 279. [2025-04-13 17:25:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 277 states have (on average 2.4476534296028882) internal successors, (678), 278 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 678 transitions. [2025-04-13 17:25:24,577 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 678 transitions. Word has length 18 [2025-04-13 17:25:24,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:24,577 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 678 transitions. [2025-04-13 17:25:24,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:24,577 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 678 transitions. [2025-04-13 17:25:24,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:24,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:24,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:24,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:25:24,578 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:24,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1935406281, now seen corresponding path program 3 times [2025-04-13 17:25:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:24,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365287649] [2025-04-13 17:25:24,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:25:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:24,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:24,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:24,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:25:24,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:26,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365287649] [2025-04-13 17:25:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365287649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:25:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389592131] [2025-04-13 17:25:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:26,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:25:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:26,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:25:26,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:26,212 INFO L87 Difference]: Start difference. First operand 279 states and 678 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:27,177 INFO L93 Difference]: Finished difference Result 490 states and 1166 transitions. [2025-04-13 17:25:27,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:25:27,178 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:27,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:27,181 INFO L225 Difference]: With dead ends: 490 [2025-04-13 17:25:27,181 INFO L226 Difference]: Without dead ends: 451 [2025-04-13 17:25:27,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:25:27,182 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 191 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:27,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 19 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:25:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-04-13 17:25:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 277. [2025-04-13 17:25:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 275 states have (on average 2.461818181818182) internal successors, (677), 276 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 677 transitions. [2025-04-13 17:25:27,202 INFO L79 Accepts]: Start accepts. Automaton has 277 states and 677 transitions. Word has length 18 [2025-04-13 17:25:27,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:27,203 INFO L485 AbstractCegarLoop]: Abstraction has 277 states and 677 transitions. [2025-04-13 17:25:27,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:27,203 INFO L278 IsEmpty]: Start isEmpty. Operand 277 states and 677 transitions. [2025-04-13 17:25:27,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:27,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:27,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:27,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:25:27,204 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:27,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1640567739, now seen corresponding path program 2 times [2025-04-13 17:25:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:27,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727527976] [2025-04-13 17:25:27,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:27,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:27,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:27,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:27,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:28,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:28,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727527976] [2025-04-13 17:25:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727527976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542833642] [2025-04-13 17:25:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:28,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:28,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:28,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:28,671 INFO L87 Difference]: Start difference. First operand 277 states and 677 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:29,850 INFO L93 Difference]: Finished difference Result 728 states and 1769 transitions. [2025-04-13 17:25:29,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:25:29,850 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:29,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:29,853 INFO L225 Difference]: With dead ends: 728 [2025-04-13 17:25:29,853 INFO L226 Difference]: Without dead ends: 692 [2025-04-13 17:25:29,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:25:29,855 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 142 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:29,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 33 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:25:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-04-13 17:25:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 339. [2025-04-13 17:25:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 337 states have (on average 2.4688427299703264) internal successors, (832), 338 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 832 transitions. [2025-04-13 17:25:29,890 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 832 transitions. Word has length 18 [2025-04-13 17:25:29,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:29,890 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 832 transitions. [2025-04-13 17:25:29,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:29,890 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 832 transitions. [2025-04-13 17:25:29,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:29,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:29,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:29,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:25:29,891 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:29,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash -906406811, now seen corresponding path program 4 times [2025-04-13 17:25:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:29,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289417380] [2025-04-13 17:25:29,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:25:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:29,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 17:25:29,992 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:29,992 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:25:29,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:31,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:31,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289417380] [2025-04-13 17:25:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289417380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:25:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345900559] [2025-04-13 17:25:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:31,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:25:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:25:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:25:31,607 INFO L87 Difference]: Start difference. First operand 339 states and 832 transitions. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:34,051 INFO L93 Difference]: Finished difference Result 1074 states and 2648 transitions. [2025-04-13 17:25:34,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:25:34,051 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:34,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:34,056 INFO L225 Difference]: With dead ends: 1074 [2025-04-13 17:25:34,056 INFO L226 Difference]: Without dead ends: 1009 [2025-04-13 17:25:34,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:25:34,057 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:34,057 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:25:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-04-13 17:25:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 399. [2025-04-13 17:25:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 397 states have (on average 2.534005037783375) internal successors, (1006), 398 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1006 transitions. [2025-04-13 17:25:34,082 INFO L79 Accepts]: Start accepts. Automaton has 399 states and 1006 transitions. Word has length 18 [2025-04-13 17:25:34,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:34,082 INFO L485 AbstractCegarLoop]: Abstraction has 399 states and 1006 transitions. [2025-04-13 17:25:34,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:34,094 INFO L278 IsEmpty]: Start isEmpty. Operand 399 states and 1006 transitions. [2025-04-13 17:25:34,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:34,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:34,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:34,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:25:34,096 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:34,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash -557854645, now seen corresponding path program 3 times [2025-04-13 17:25:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:34,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424734100] [2025-04-13 17:25:34,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:25:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:34,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:34,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:34,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:25:34,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:35,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424734100] [2025-04-13 17:25:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424734100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574823039] [2025-04-13 17:25:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:35,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:35,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:35,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:35,155 INFO L87 Difference]: Start difference. First operand 399 states and 1006 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:36,426 INFO L93 Difference]: Finished difference Result 857 states and 2150 transitions. [2025-04-13 17:25:36,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:25:36,426 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:36,427 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:36,430 INFO L225 Difference]: With dead ends: 857 [2025-04-13 17:25:36,430 INFO L226 Difference]: Without dead ends: 828 [2025-04-13 17:25:36,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:25:36,431 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 189 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:36,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 26 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:25:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-04-13 17:25:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 429. [2025-04-13 17:25:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 2.531615925058548) internal successors, (1081), 428 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1081 transitions. [2025-04-13 17:25:36,457 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1081 transitions. Word has length 18 [2025-04-13 17:25:36,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:36,457 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1081 transitions. [2025-04-13 17:25:36,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:36,458 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1081 transitions. [2025-04-13 17:25:36,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:36,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:36,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:36,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:25:36,459 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:36,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 176306283, now seen corresponding path program 5 times [2025-04-13 17:25:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:36,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178397898] [2025-04-13 17:25:36,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:25:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:36,485 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:25:36,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:36,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:36,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:37,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:37,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178397898] [2025-04-13 17:25:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178397898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:25:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448681459] [2025-04-13 17:25:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:37,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:25:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:25:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:37,324 INFO L87 Difference]: Start difference. First operand 429 states and 1081 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:38,477 INFO L93 Difference]: Finished difference Result 906 states and 2212 transitions. [2025-04-13 17:25:38,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:25:38,478 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:38,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:38,481 INFO L225 Difference]: With dead ends: 906 [2025-04-13 17:25:38,481 INFO L226 Difference]: Without dead ends: 845 [2025-04-13 17:25:38,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:25:38,484 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 167 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:38,484 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 26 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:25:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-04-13 17:25:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 433. [2025-04-13 17:25:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.5684454756380513) internal successors, (1107), 432 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1107 transitions. [2025-04-13 17:25:38,510 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1107 transitions. Word has length 18 [2025-04-13 17:25:38,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:38,510 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1107 transitions. [2025-04-13 17:25:38,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:38,510 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1107 transitions. [2025-04-13 17:25:38,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:25:38,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:38,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:38,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:25:38,513 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:38,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:38,513 INFO L85 PathProgramCache]: Analyzing trace with hash -853497677, now seen corresponding path program 4 times [2025-04-13 17:25:38,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:38,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829951542] [2025-04-13 17:25:38,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:25:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:38,538 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 17:25:38,569 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:25:38,569 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:25:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:39,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-04-13 17:25:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:39,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829951542] [2025-04-13 17:25:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829951542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:25:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547757584] [2025-04-13 17:25:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:39,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:25:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:39,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:25:39,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:25:39,326 INFO L87 Difference]: Start difference. First operand 433 states and 1107 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:40,644 INFO L93 Difference]: Finished difference Result 852 states and 2054 transitions. [2025-04-13 17:25:40,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:25:40,645 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:25:40,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:40,648 INFO L225 Difference]: With dead ends: 852 [2025-04-13 17:25:40,648 INFO L226 Difference]: Without dead ends: 783 [2025-04-13 17:25:40,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:25:40,649 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 138 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:40,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 26 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:25:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-04-13 17:25:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 417. [2025-04-13 17:25:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 415 states have (on average 2.5421686746987953) internal successors, (1055), 416 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1055 transitions. [2025-04-13 17:25:40,675 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1055 transitions. Word has length 18 [2025-04-13 17:25:40,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:40,675 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1055 transitions. [2025-04-13 17:25:40,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:40,675 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1055 transitions. [2025-04-13 17:25:40,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:40,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:40,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:40,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:25:40,676 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:40,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1294407773, now seen corresponding path program 1 times [2025-04-13 17:25:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:40,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614852260] [2025-04-13 17:25:40,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:40,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:40,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:40,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:40,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:41,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-04-13 17:25:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:41,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614852260] [2025-04-13 17:25:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614852260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:25:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434315285] [2025-04-13 17:25:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:41,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:25:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:41,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:25:41,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:25:41,131 INFO L87 Difference]: Start difference. First operand 417 states and 1055 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:41,533 INFO L93 Difference]: Finished difference Result 487 states and 1190 transitions. [2025-04-13 17:25:41,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:25:41,534 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:41,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:41,536 INFO L225 Difference]: With dead ends: 487 [2025-04-13 17:25:41,536 INFO L226 Difference]: Without dead ends: 453 [2025-04-13 17:25:41,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:25:41,536 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 58 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:41,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:25:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-04-13 17:25:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 413. [2025-04-13 17:25:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 2.5450121654501214) internal successors, (1046), 412 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1046 transitions. [2025-04-13 17:25:41,564 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1046 transitions. Word has length 19 [2025-04-13 17:25:41,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:41,565 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1046 transitions. [2025-04-13 17:25:41,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:41,565 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1046 transitions. [2025-04-13 17:25:41,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:41,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:41,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:41,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:25:41,567 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:41,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:41,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1709758453, now seen corresponding path program 2 times [2025-04-13 17:25:41,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:41,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991321971] [2025-04-13 17:25:41,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:41,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:41,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:41,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:41,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:42,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991321971] [2025-04-13 17:25:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991321971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:25:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188921783] [2025-04-13 17:25:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:42,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:25:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:25:42,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:25:42,927 INFO L87 Difference]: Start difference. First operand 413 states and 1046 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:44,519 INFO L93 Difference]: Finished difference Result 494 states and 1206 transitions. [2025-04-13 17:25:44,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:25:44,520 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:44,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:44,522 INFO L225 Difference]: With dead ends: 494 [2025-04-13 17:25:44,522 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 17:25:44,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:25:44,522 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:44,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:25:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 17:25:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 421. [2025-04-13 17:25:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.544152744630072) internal successors, (1066), 420 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1066 transitions. [2025-04-13 17:25:44,545 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1066 transitions. Word has length 19 [2025-04-13 17:25:44,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:44,546 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1066 transitions. [2025-04-13 17:25:44,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:44,546 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1066 transitions. [2025-04-13 17:25:44,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:44,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:44,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:25:44,547 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:44,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2086507503, now seen corresponding path program 3 times [2025-04-13 17:25:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:44,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801695604] [2025-04-13 17:25:44,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:25:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:44,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:44,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:44,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:25:44,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:45,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801695604] [2025-04-13 17:25:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801695604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:25:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208603868] [2025-04-13 17:25:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:45,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:25:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:25:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:25:45,517 INFO L87 Difference]: Start difference. First operand 421 states and 1066 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:46,489 INFO L93 Difference]: Finished difference Result 479 states and 1173 transitions. [2025-04-13 17:25:46,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:25:46,489 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:46,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:46,491 INFO L225 Difference]: With dead ends: 479 [2025-04-13 17:25:46,491 INFO L226 Difference]: Without dead ends: 455 [2025-04-13 17:25:46,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:25:46,492 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:46,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:25:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-04-13 17:25:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 421. [2025-04-13 17:25:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.539379474940334) internal successors, (1064), 420 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1064 transitions. [2025-04-13 17:25:46,518 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1064 transitions. Word has length 19 [2025-04-13 17:25:46,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:46,518 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1064 transitions. [2025-04-13 17:25:46,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:46,519 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1064 transitions. [2025-04-13 17:25:46,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:46,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:46,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:46,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:25:46,520 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:46,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2088886087, now seen corresponding path program 4 times [2025-04-13 17:25:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:46,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161253693] [2025-04-13 17:25:46,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:25:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:46,545 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:25:46,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:46,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:25:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:46,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161253693] [2025-04-13 17:25:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161253693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:46,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:46,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:25:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727916468] [2025-04-13 17:25:46,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:46,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:25:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:46,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:25:46,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:46,867 INFO L87 Difference]: Start difference. First operand 421 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:47,265 INFO L93 Difference]: Finished difference Result 507 states and 1227 transitions. [2025-04-13 17:25:47,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:25:47,265 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:47,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:47,267 INFO L225 Difference]: With dead ends: 507 [2025-04-13 17:25:47,267 INFO L226 Difference]: Without dead ends: 473 [2025-04-13 17:25:47,268 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:47,268 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:47,268 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:25:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-13 17:25:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 421. [2025-04-13 17:25:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.5250596658711215) internal successors, (1058), 420 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1058 transitions. [2025-04-13 17:25:47,290 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1058 transitions. Word has length 19 [2025-04-13 17:25:47,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:47,290 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1058 transitions. [2025-04-13 17:25:47,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:47,291 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1058 transitions. [2025-04-13 17:25:47,291 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:47,291 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:47,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:47,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:25:47,291 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:47,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash 522990407, now seen corresponding path program 1 times [2025-04-13 17:25:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:47,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684506623] [2025-04-13 17:25:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:47,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:48,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684506623] [2025-04-13 17:25:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684506623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:48,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:25:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520083399] [2025-04-13 17:25:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:48,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:25:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:25:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:25:48,059 INFO L87 Difference]: Start difference. First operand 421 states and 1058 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:48,736 INFO L93 Difference]: Finished difference Result 489 states and 1190 transitions. [2025-04-13 17:25:48,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:25:48,736 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:48,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:48,738 INFO L225 Difference]: With dead ends: 489 [2025-04-13 17:25:48,738 INFO L226 Difference]: Without dead ends: 469 [2025-04-13 17:25:48,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:25:48,739 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:48,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:25:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-04-13 17:25:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 421. [2025-04-13 17:25:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 419 states have (on average 2.5250596658711215) internal successors, (1058), 420 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1058 transitions. [2025-04-13 17:25:48,762 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1058 transitions. Word has length 19 [2025-04-13 17:25:48,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:48,762 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1058 transitions. [2025-04-13 17:25:48,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:48,762 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1058 transitions. [2025-04-13 17:25:48,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:48,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:48,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:48,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:25:48,763 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:48,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1459666509, now seen corresponding path program 1 times [2025-04-13 17:25:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:48,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662563531] [2025-04-13 17:25:48,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:48,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:48,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:48,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:49,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662563531] [2025-04-13 17:25:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662563531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:49,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661007685] [2025-04-13 17:25:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:49,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:49,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:49,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:49,891 INFO L87 Difference]: Start difference. First operand 421 states and 1058 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:51,043 INFO L93 Difference]: Finished difference Result 512 states and 1253 transitions. [2025-04-13 17:25:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:25:51,043 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:51,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:51,045 INFO L225 Difference]: With dead ends: 512 [2025-04-13 17:25:51,045 INFO L226 Difference]: Without dead ends: 463 [2025-04-13 17:25:51,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:25:51,046 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:51,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:25:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-04-13 17:25:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 437. [2025-04-13 17:25:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 2.542528735632184) internal successors, (1106), 436 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1106 transitions. [2025-04-13 17:25:51,076 INFO L79 Accepts]: Start accepts. Automaton has 437 states and 1106 transitions. Word has length 19 [2025-04-13 17:25:51,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:51,076 INFO L485 AbstractCegarLoop]: Abstraction has 437 states and 1106 transitions. [2025-04-13 17:25:51,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:51,077 INFO L278 IsEmpty]: Start isEmpty. Operand 437 states and 1106 transitions. [2025-04-13 17:25:51,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:51,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:51,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:51,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:25:51,077 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:51,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1442223847, now seen corresponding path program 2 times [2025-04-13 17:25:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:51,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827641484] [2025-04-13 17:25:51,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:51,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:51,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:51,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:51,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:52,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827641484] [2025-04-13 17:25:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827641484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:52,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:25:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104865533] [2025-04-13 17:25:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:52,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:25:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:52,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:25:52,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:25:52,242 INFO L87 Difference]: Start difference. First operand 437 states and 1106 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:53,108 INFO L93 Difference]: Finished difference Result 529 states and 1339 transitions. [2025-04-13 17:25:53,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:25:53,109 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:53,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:53,111 INFO L225 Difference]: With dead ends: 529 [2025-04-13 17:25:53,111 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 17:25:53,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:25:53,112 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:53,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:25:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 17:25:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 455. [2025-04-13 17:25:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.5651214128035322) internal successors, (1162), 454 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1162 transitions. [2025-04-13 17:25:53,151 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1162 transitions. Word has length 19 [2025-04-13 17:25:53,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:53,152 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1162 transitions. [2025-04-13 17:25:53,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:53,152 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1162 transitions. [2025-04-13 17:25:53,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:53,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:53,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:53,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:25:53,153 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:53,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash -888111247, now seen corresponding path program 3 times [2025-04-13 17:25:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:53,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014358753] [2025-04-13 17:25:53,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:25:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:53,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:53,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:53,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:25:53,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:54,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014358753] [2025-04-13 17:25:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014358753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:25:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668209137] [2025-04-13 17:25:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:54,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:25:54,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:25:54,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:25:54,110 INFO L87 Difference]: Start difference. First operand 455 states and 1162 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:56,225 INFO L93 Difference]: Finished difference Result 655 states and 1560 transitions. [2025-04-13 17:25:56,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:25:56,225 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:56,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:56,228 INFO L225 Difference]: With dead ends: 655 [2025-04-13 17:25:56,228 INFO L226 Difference]: Without dead ends: 621 [2025-04-13 17:25:56,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=368, Invalid=1038, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:25:56,229 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 303 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:56,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 0 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:25:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-04-13 17:25:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 451. [2025-04-13 17:25:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 449 states have (on average 2.5657015590200447) internal successors, (1152), 450 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1152 transitions. [2025-04-13 17:25:56,271 INFO L79 Accepts]: Start accepts. Automaton has 451 states and 1152 transitions. Word has length 19 [2025-04-13 17:25:56,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:56,271 INFO L485 AbstractCegarLoop]: Abstraction has 451 states and 1152 transitions. [2025-04-13 17:25:56,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:56,271 INFO L278 IsEmpty]: Start isEmpty. Operand 451 states and 1152 transitions. [2025-04-13 17:25:56,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:56,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:56,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:56,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 17:25:56,273 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:56,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1960190151, now seen corresponding path program 4 times [2025-04-13 17:25:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:56,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112686499] [2025-04-13 17:25:56,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:25:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:56,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:25:56,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:56,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:25:56,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:57,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112686499] [2025-04-13 17:25:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112686499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480495794] [2025-04-13 17:25:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:57,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:57,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:57,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:57,319 INFO L87 Difference]: Start difference. First operand 451 states and 1152 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:58,206 INFO L93 Difference]: Finished difference Result 583 states and 1428 transitions. [2025-04-13 17:25:58,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:25:58,207 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:25:58,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:58,209 INFO L225 Difference]: With dead ends: 583 [2025-04-13 17:25:58,209 INFO L226 Difference]: Without dead ends: 563 [2025-04-13 17:25:58,209 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:25:58,210 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:58,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:25:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-04-13 17:25:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 449. [2025-04-13 17:25:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 447 states have (on average 2.5615212527964206) internal successors, (1145), 448 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1145 transitions. [2025-04-13 17:25:58,261 INFO L79 Accepts]: Start accepts. Automaton has 449 states and 1145 transitions. Word has length 19 [2025-04-13 17:25:58,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:58,261 INFO L485 AbstractCegarLoop]: Abstraction has 449 states and 1145 transitions. [2025-04-13 17:25:58,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:25:58,262 INFO L278 IsEmpty]: Start isEmpty. Operand 449 states and 1145 transitions. [2025-04-13 17:25:58,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:25:58,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:58,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:58,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 17:25:58,263 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:25:58,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1478281199, now seen corresponding path program 5 times [2025-04-13 17:25:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:58,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423117559] [2025-04-13 17:25:58,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:25:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:58,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:25:58,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:25:58,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:00,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423117559] [2025-04-13 17:26:00,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423117559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:00,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:00,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017035969] [2025-04-13 17:26:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:00,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:00,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:00,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:00,199 INFO L87 Difference]: Start difference. First operand 449 states and 1145 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:01,698 INFO L93 Difference]: Finished difference Result 531 states and 1328 transitions. [2025-04-13 17:26:01,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:26:01,699 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:01,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:01,701 INFO L225 Difference]: With dead ends: 531 [2025-04-13 17:26:01,701 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 17:26:01,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:26:01,701 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:01,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:26:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 17:26:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 431. [2025-04-13 17:26:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 2.543123543123543) internal successors, (1091), 430 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1091 transitions. [2025-04-13 17:26:01,739 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1091 transitions. Word has length 19 [2025-04-13 17:26:01,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:01,739 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1091 transitions. [2025-04-13 17:26:01,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:01,739 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1091 transitions. [2025-04-13 17:26:01,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:01,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:01,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:01,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 17:26:01,740 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:01,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1489624873, now seen corresponding path program 2 times [2025-04-13 17:26:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:01,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668877163] [2025-04-13 17:26:01,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:01,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:01,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:01,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:01,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:03,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668877163] [2025-04-13 17:26:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668877163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86623261] [2025-04-13 17:26:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:03,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:03,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:03,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:03,362 INFO L87 Difference]: Start difference. First operand 431 states and 1091 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:04,273 INFO L93 Difference]: Finished difference Result 546 states and 1346 transitions. [2025-04-13 17:26:04,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:26:04,273 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:04,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:04,275 INFO L225 Difference]: With dead ends: 546 [2025-04-13 17:26:04,275 INFO L226 Difference]: Without dead ends: 497 [2025-04-13 17:26:04,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:26:04,276 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:04,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:26:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-04-13 17:26:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 445. [2025-04-13 17:26:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 443 states have (on average 2.5553047404063207) internal successors, (1132), 444 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1132 transitions. [2025-04-13 17:26:04,316 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1132 transitions. Word has length 19 [2025-04-13 17:26:04,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:04,316 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1132 transitions. [2025-04-13 17:26:04,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:04,316 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1132 transitions. [2025-04-13 17:26:04,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:04,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:04,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:04,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 17:26:04,317 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:04,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -618249465, now seen corresponding path program 5 times [2025-04-13 17:26:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:04,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105954559] [2025-04-13 17:26:04,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:04,339 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:04,361 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:04,361 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:05,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105954559] [2025-04-13 17:26:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105954559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593709816] [2025-04-13 17:26:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:05,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:05,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:05,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:05,790 INFO L87 Difference]: Start difference. First operand 445 states and 1132 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:07,378 INFO L93 Difference]: Finished difference Result 574 states and 1426 transitions. [2025-04-13 17:26:07,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:07,378 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:07,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:07,380 INFO L225 Difference]: With dead ends: 574 [2025-04-13 17:26:07,380 INFO L226 Difference]: Without dead ends: 525 [2025-04-13 17:26:07,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:26:07,381 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:07,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:26:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-04-13 17:26:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 471. [2025-04-13 17:26:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 469 states have (on average 2.582089552238806) internal successors, (1211), 470 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1211 transitions. [2025-04-13 17:26:07,420 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 1211 transitions. Word has length 19 [2025-04-13 17:26:07,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:07,420 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 1211 transitions. [2025-04-13 17:26:07,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:07,420 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 1211 transitions. [2025-04-13 17:26:07,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:07,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:07,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:07,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 17:26:07,421 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:07,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1877503693, now seen corresponding path program 3 times [2025-04-13 17:26:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:07,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416135207] [2025-04-13 17:26:07,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:07,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:07,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:07,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:08,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:08,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416135207] [2025-04-13 17:26:08,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416135207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:08,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:08,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:08,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907737880] [2025-04-13 17:26:08,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:08,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:08,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:08,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:08,464 INFO L87 Difference]: Start difference. First operand 471 states and 1211 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:09,778 INFO L93 Difference]: Finished difference Result 608 states and 1513 transitions. [2025-04-13 17:26:09,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:26:09,779 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:09,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:09,781 INFO L225 Difference]: With dead ends: 608 [2025-04-13 17:26:09,781 INFO L226 Difference]: Without dead ends: 579 [2025-04-13 17:26:09,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:26:09,782 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:09,782 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:26:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-04-13 17:26:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 469. [2025-04-13 17:26:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.5738758029978586) internal successors, (1202), 468 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1202 transitions. [2025-04-13 17:26:09,822 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1202 transitions. Word has length 19 [2025-04-13 17:26:09,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:09,822 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1202 transitions. [2025-04-13 17:26:09,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:09,822 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1202 transitions. [2025-04-13 17:26:09,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:09,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:09,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:09,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 17:26:09,823 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:09,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -119548125, now seen corresponding path program 6 times [2025-04-13 17:26:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:09,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170697921] [2025-04-13 17:26:09,823 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:26:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:09,845 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:09,862 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:09,862 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:26:09,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:10,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170697921] [2025-04-13 17:26:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170697921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:26:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88585863] [2025-04-13 17:26:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:10,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:26:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:26:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:26:10,552 INFO L87 Difference]: Start difference. First operand 469 states and 1202 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:11,347 INFO L93 Difference]: Finished difference Result 603 states and 1482 transitions. [2025-04-13 17:26:11,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:26:11,347 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:11,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:11,350 INFO L225 Difference]: With dead ends: 603 [2025-04-13 17:26:11,350 INFO L226 Difference]: Without dead ends: 548 [2025-04-13 17:26:11,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:26:11,350 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:11,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 8 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:26:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-04-13 17:26:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 455. [2025-04-13 17:26:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.5364238410596025) internal successors, (1149), 454 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1149 transitions. [2025-04-13 17:26:11,394 INFO L79 Accepts]: Start accepts. Automaton has 455 states and 1149 transitions. Word has length 19 [2025-04-13 17:26:11,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:11,394 INFO L485 AbstractCegarLoop]: Abstraction has 455 states and 1149 transitions. [2025-04-13 17:26:11,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:11,394 INFO L278 IsEmpty]: Start isEmpty. Operand 455 states and 1149 transitions. [2025-04-13 17:26:11,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:11,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:11,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:11,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 17:26:11,395 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:11,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -616465527, now seen corresponding path program 7 times [2025-04-13 17:26:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:11,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064165636] [2025-04-13 17:26:11,395 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:26:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:11,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:11,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:11,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:11,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:12,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064165636] [2025-04-13 17:26:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064165636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739077103] [2025-04-13 17:26:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:12,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:12,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:12,770 INFO L87 Difference]: Start difference. First operand 455 states and 1149 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:14,236 INFO L93 Difference]: Finished difference Result 666 states and 1612 transitions. [2025-04-13 17:26:14,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:26:14,236 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:14,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:14,238 INFO L225 Difference]: With dead ends: 666 [2025-04-13 17:26:14,239 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 17:26:14,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:26:14,239 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:14,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:26:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 17:26:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 477. [2025-04-13 17:26:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 475 states have (on average 2.5726315789473686) internal successors, (1222), 476 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1222 transitions. [2025-04-13 17:26:14,283 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 1222 transitions. Word has length 19 [2025-04-13 17:26:14,283 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:14,283 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 1222 transitions. [2025-04-13 17:26:14,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:14,283 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 1222 transitions. [2025-04-13 17:26:14,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:14,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:14,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:14,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 17:26:14,284 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:14,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 226340249, now seen corresponding path program 4 times [2025-04-13 17:26:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:14,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248391277] [2025-04-13 17:26:14,285 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:26:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:14,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:26:14,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:14,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:26:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:15,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248391277] [2025-04-13 17:26:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248391277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:15,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:26:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730502919] [2025-04-13 17:26:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:15,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:26:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:15,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:26:15,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:26:15,281 INFO L87 Difference]: Start difference. First operand 477 states and 1222 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:16,580 INFO L93 Difference]: Finished difference Result 636 states and 1543 transitions. [2025-04-13 17:26:16,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:26:16,580 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:16,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:16,582 INFO L225 Difference]: With dead ends: 636 [2025-04-13 17:26:16,582 INFO L226 Difference]: Without dead ends: 587 [2025-04-13 17:26:16,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:26:16,583 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:16,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:26:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-04-13 17:26:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 481. [2025-04-13 17:26:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 479 states have (on average 2.58455114822547) internal successors, (1238), 480 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1238 transitions. [2025-04-13 17:26:16,629 INFO L79 Accepts]: Start accepts. Automaton has 481 states and 1238 transitions. Word has length 19 [2025-04-13 17:26:16,629 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:16,629 INFO L485 AbstractCegarLoop]: Abstraction has 481 states and 1238 transitions. [2025-04-13 17:26:16,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:16,629 INFO L278 IsEmpty]: Start isEmpty. Operand 481 states and 1238 transitions. [2025-04-13 17:26:16,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:16,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:16,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:16,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 17:26:16,630 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:16,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -962339037, now seen corresponding path program 8 times [2025-04-13 17:26:16,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:16,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600462319] [2025-04-13 17:26:16,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:16,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:16,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:16,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:17,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600462319] [2025-04-13 17:26:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600462319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193886965] [2025-04-13 17:26:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:17,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:17,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:17,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:17,996 INFO L87 Difference]: Start difference. First operand 481 states and 1238 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:19,731 INFO L93 Difference]: Finished difference Result 618 states and 1530 transitions. [2025-04-13 17:26:19,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:26:19,731 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:19,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:19,733 INFO L225 Difference]: With dead ends: 618 [2025-04-13 17:26:19,733 INFO L226 Difference]: Without dead ends: 573 [2025-04-13 17:26:19,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:26:19,734 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:19,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:26:19,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-04-13 17:26:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 487. [2025-04-13 17:26:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5917525773195877) internal successors, (1257), 486 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1257 transitions. [2025-04-13 17:26:19,789 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1257 transitions. Word has length 19 [2025-04-13 17:26:19,789 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:19,789 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1257 transitions. [2025-04-13 17:26:19,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:19,790 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1257 transitions. [2025-04-13 17:26:19,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:19,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:19,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:19,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 17:26:19,790 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:19,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash 795646259, now seen corresponding path program 5 times [2025-04-13 17:26:19,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:19,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821025305] [2025-04-13 17:26:19,791 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:19,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:19,847 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:19,847 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:19,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:21,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821025305] [2025-04-13 17:26:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821025305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898249752] [2025-04-13 17:26:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:21,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:21,378 INFO L87 Difference]: Start difference. First operand 487 states and 1257 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:22,366 INFO L93 Difference]: Finished difference Result 668 states and 1615 transitions. [2025-04-13 17:26:22,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:22,366 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:22,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:22,369 INFO L225 Difference]: With dead ends: 668 [2025-04-13 17:26:22,369 INFO L226 Difference]: Without dead ends: 619 [2025-04-13 17:26:22,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:26:22,369 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:22,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:26:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-04-13 17:26:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 483. [2025-04-13 17:26:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 481 states have (on average 2.58004158004158) internal successors, (1241), 482 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1241 transitions. [2025-04-13 17:26:22,421 INFO L79 Accepts]: Start accepts. Automaton has 483 states and 1241 transitions. Word has length 19 [2025-04-13 17:26:22,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:22,421 INFO L485 AbstractCegarLoop]: Abstraction has 483 states and 1241 transitions. [2025-04-13 17:26:22,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:22,421 INFO L278 IsEmpty]: Start isEmpty. Operand 483 states and 1241 transitions. [2025-04-13 17:26:22,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:22,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:22,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:22,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 17:26:22,422 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:22,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1533384521, now seen corresponding path program 9 times [2025-04-13 17:26:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:22,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42569418] [2025-04-13 17:26:22,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:22,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:22,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:22,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:22,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:22,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42569418] [2025-04-13 17:26:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42569418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:26:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213876109] [2025-04-13 17:26:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:22,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:26:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:22,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:26:22,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:26:22,771 INFO L87 Difference]: Start difference. First operand 483 states and 1241 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:23,227 INFO L93 Difference]: Finished difference Result 673 states and 1622 transitions. [2025-04-13 17:26:23,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:23,227 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:23,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:23,229 INFO L225 Difference]: With dead ends: 673 [2025-04-13 17:26:23,229 INFO L226 Difference]: Without dead ends: 635 [2025-04-13 17:26:23,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:23,230 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:23,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 8 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:26:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-04-13 17:26:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 485. [2025-04-13 17:26:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 483 states have (on average 2.546583850931677) internal successors, (1230), 484 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1230 transitions. [2025-04-13 17:26:23,282 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1230 transitions. Word has length 19 [2025-04-13 17:26:23,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:23,282 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1230 transitions. [2025-04-13 17:26:23,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:23,282 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1230 transitions. [2025-04-13 17:26:23,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:23,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:23,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:23,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 17:26:23,283 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:23,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1558009163, now seen corresponding path program 6 times [2025-04-13 17:26:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:23,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191680124] [2025-04-13 17:26:23,283 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:26:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:23,304 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:23,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:23,327 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:26:23,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:25,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191680124] [2025-04-13 17:26:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191680124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547481285] [2025-04-13 17:26:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:25,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:25,024 INFO L87 Difference]: Start difference. First operand 485 states and 1230 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:26,629 INFO L93 Difference]: Finished difference Result 580 states and 1431 transitions. [2025-04-13 17:26:26,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:26:26,630 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:26,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:26,632 INFO L225 Difference]: With dead ends: 580 [2025-04-13 17:26:26,632 INFO L226 Difference]: Without dead ends: 527 [2025-04-13 17:26:26,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:26:26,633 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:26,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:26:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-13 17:26:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 489. [2025-04-13 17:26:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 487 states have (on average 2.5544147843942504) internal successors, (1244), 488 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1244 transitions. [2025-04-13 17:26:26,696 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1244 transitions. Word has length 19 [2025-04-13 17:26:26,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:26,696 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1244 transitions. [2025-04-13 17:26:26,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:26,696 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1244 transitions. [2025-04-13 17:26:26,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:26,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:26,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:26,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 17:26:26,697 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:26,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -988241361, now seen corresponding path program 6 times [2025-04-13 17:26:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:26,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687352931] [2025-04-13 17:26:26,697 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:26:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:26,720 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:26,739 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:26,739 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:26:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:27,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687352931] [2025-04-13 17:26:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687352931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017529706] [2025-04-13 17:26:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:27,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:27,788 INFO L87 Difference]: Start difference. First operand 489 states and 1244 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:28,901 INFO L93 Difference]: Finished difference Result 588 states and 1457 transitions. [2025-04-13 17:26:28,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:28,901 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:28,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:28,903 INFO L225 Difference]: With dead ends: 588 [2025-04-13 17:26:28,903 INFO L226 Difference]: Without dead ends: 539 [2025-04-13 17:26:28,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:26:28,904 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:28,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:26:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-04-13 17:26:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 491. [2025-04-13 17:26:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.554192229038855) internal successors, (1249), 490 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1249 transitions. [2025-04-13 17:26:28,965 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1249 transitions. Word has length 19 [2025-04-13 17:26:28,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:28,965 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1249 transitions. [2025-04-13 17:26:28,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:28,965 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1249 transitions. [2025-04-13 17:26:28,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:28,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:28,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:28,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 17:26:28,966 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:28,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -971260491, now seen corresponding path program 7 times [2025-04-13 17:26:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:28,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56088407] [2025-04-13 17:26:28,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:26:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:28,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:29,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:29,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:29,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:30,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56088407] [2025-04-13 17:26:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56088407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:30,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:30,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:30,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362219488] [2025-04-13 17:26:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:30,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:30,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:30,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:30,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:30,574 INFO L87 Difference]: Start difference. First operand 491 states and 1249 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:32,128 INFO L93 Difference]: Finished difference Result 718 states and 1742 transitions. [2025-04-13 17:26:32,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:26:32,128 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:32,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:32,130 INFO L225 Difference]: With dead ends: 718 [2025-04-13 17:26:32,131 INFO L226 Difference]: Without dead ends: 669 [2025-04-13 17:26:32,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:26:32,131 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:32,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:26:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-04-13 17:26:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 495. [2025-04-13 17:26:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 493 states have (on average 2.5699797160243407) internal successors, (1267), 494 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1267 transitions. [2025-04-13 17:26:32,195 INFO L79 Accepts]: Start accepts. Automaton has 495 states and 1267 transitions. Word has length 19 [2025-04-13 17:26:32,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:32,195 INFO L485 AbstractCegarLoop]: Abstraction has 495 states and 1267 transitions. [2025-04-13 17:26:32,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:32,195 INFO L278 IsEmpty]: Start isEmpty. Operand 495 states and 1267 transitions. [2025-04-13 17:26:32,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:32,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:32,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:32,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 17:26:32,196 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:32,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -131745415, now seen corresponding path program 8 times [2025-04-13 17:26:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:32,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792951059] [2025-04-13 17:26:32,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:32,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:32,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:32,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:32,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:33,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:33,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792951059] [2025-04-13 17:26:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792951059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23578333] [2025-04-13 17:26:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:33,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:33,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:33,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:33,411 INFO L87 Difference]: Start difference. First operand 495 states and 1267 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:34,490 INFO L93 Difference]: Finished difference Result 592 states and 1473 transitions. [2025-04-13 17:26:34,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:26:34,490 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:34,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:34,492 INFO L225 Difference]: With dead ends: 592 [2025-04-13 17:26:34,492 INFO L226 Difference]: Without dead ends: 543 [2025-04-13 17:26:34,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:26:34,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:34,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:26:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-13 17:26:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 499. [2025-04-13 17:26:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.569416498993964) internal successors, (1277), 498 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1277 transitions. [2025-04-13 17:26:34,555 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1277 transitions. Word has length 19 [2025-04-13 17:26:34,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:34,555 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1277 transitions. [2025-04-13 17:26:34,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:34,556 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1277 transitions. [2025-04-13 17:26:34,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:34,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 17:26:34,556 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:34,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash -114764545, now seen corresponding path program 9 times [2025-04-13 17:26:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452416278] [2025-04-13 17:26:34,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:34,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:34,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:34,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:36,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452416278] [2025-04-13 17:26:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452416278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740982953] [2025-04-13 17:26:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:36,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:36,242 INFO L87 Difference]: Start difference. First operand 499 states and 1277 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:37,932 INFO L93 Difference]: Finished difference Result 662 states and 1664 transitions. [2025-04-13 17:26:37,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:26:37,932 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:37,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:37,934 INFO L225 Difference]: With dead ends: 662 [2025-04-13 17:26:37,934 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 17:26:37,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:26:37,935 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:37,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:26:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 17:26:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 517. [2025-04-13 17:26:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 515 states have (on average 2.5902912621359224) internal successors, (1334), 516 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1334 transitions. [2025-04-13 17:26:38,011 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1334 transitions. Word has length 19 [2025-04-13 17:26:38,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:38,011 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1334 transitions. [2025-04-13 17:26:38,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:38,011 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1334 transitions. [2025-04-13 17:26:38,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:38,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:38,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:38,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 17:26:38,012 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:38,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 439348055, now seen corresponding path program 10 times [2025-04-13 17:26:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:38,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5422513] [2025-04-13 17:26:38,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:26:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:38,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:26:38,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:38,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:26:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:39,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:39,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5422513] [2025-04-13 17:26:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5422513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255548680] [2025-04-13 17:26:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:39,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:26:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:39,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:26:39,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:39,763 INFO L87 Difference]: Start difference. First operand 517 states and 1334 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:41,820 INFO L93 Difference]: Finished difference Result 727 states and 1769 transitions. [2025-04-13 17:26:41,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:26:41,820 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:41,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:41,822 INFO L225 Difference]: With dead ends: 727 [2025-04-13 17:26:41,822 INFO L226 Difference]: Without dead ends: 707 [2025-04-13 17:26:41,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:26:41,823 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:41,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:26:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-04-13 17:26:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 525. [2025-04-13 17:26:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 523 states have (on average 2.604206500956023) internal successors, (1362), 524 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1362 transitions. [2025-04-13 17:26:41,908 INFO L79 Accepts]: Start accepts. Automaton has 525 states and 1362 transitions. Word has length 19 [2025-04-13 17:26:41,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:41,908 INFO L485 AbstractCegarLoop]: Abstraction has 525 states and 1362 transitions. [2025-04-13 17:26:41,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:41,908 INFO L278 IsEmpty]: Start isEmpty. Operand 525 states and 1362 transitions. [2025-04-13 17:26:41,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:41,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:41,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:41,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 17:26:41,909 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:41,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 451138909, now seen corresponding path program 7 times [2025-04-13 17:26:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:41,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872642921] [2025-04-13 17:26:41,910 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:26:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:41,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:41,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:41,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:41,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:43,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872642921] [2025-04-13 17:26:43,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872642921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:43,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:43,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:43,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583880393] [2025-04-13 17:26:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:43,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:43,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:43,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:43,567 INFO L87 Difference]: Start difference. First operand 525 states and 1362 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:44,981 INFO L93 Difference]: Finished difference Result 696 states and 1753 transitions. [2025-04-13 17:26:44,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:26:44,982 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:44,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:44,983 INFO L225 Difference]: With dead ends: 696 [2025-04-13 17:26:44,983 INFO L226 Difference]: Without dead ends: 643 [2025-04-13 17:26:44,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:26:44,984 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:44,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:26:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-04-13 17:26:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 531. [2025-04-13 17:26:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 529 states have (on average 2.614366729678639) internal successors, (1383), 530 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1383 transitions. [2025-04-13 17:26:45,079 INFO L79 Accepts]: Start accepts. Automaton has 531 states and 1383 transitions. Word has length 19 [2025-04-13 17:26:45,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:45,079 INFO L485 AbstractCegarLoop]: Abstraction has 531 states and 1383 transitions. [2025-04-13 17:26:45,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:45,079 INFO L278 IsEmpty]: Start isEmpty. Operand 531 states and 1383 transitions. [2025-04-13 17:26:45,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:45,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:45,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:45,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 17:26:45,080 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:45,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash 160588131, now seen corresponding path program 10 times [2025-04-13 17:26:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:45,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909065286] [2025-04-13 17:26:45,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:26:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:45,101 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:26:45,122 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:45,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:26:45,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:46,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909065286] [2025-04-13 17:26:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909065286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312745013] [2025-04-13 17:26:46,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:46,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:26:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:46,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:26:46,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:46,243 INFO L87 Difference]: Start difference. First operand 531 states and 1383 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:47,320 INFO L93 Difference]: Finished difference Result 690 states and 1688 transitions. [2025-04-13 17:26:47,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:26:47,320 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:47,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:47,322 INFO L225 Difference]: With dead ends: 690 [2025-04-13 17:26:47,322 INFO L226 Difference]: Without dead ends: 641 [2025-04-13 17:26:47,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:26:47,323 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:47,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:26:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-04-13 17:26:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 539. [2025-04-13 17:26:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 537 states have (on average 2.601489757914339) internal successors, (1397), 538 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1397 transitions. [2025-04-13 17:26:47,412 INFO L79 Accepts]: Start accepts. Automaton has 539 states and 1397 transitions. Word has length 19 [2025-04-13 17:26:47,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:47,412 INFO L485 AbstractCegarLoop]: Abstraction has 539 states and 1397 transitions. [2025-04-13 17:26:47,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:47,412 INFO L278 IsEmpty]: Start isEmpty. Operand 539 states and 1397 transitions. [2025-04-13 17:26:47,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:47,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:47,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:47,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 17:26:47,413 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:47,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 659289471, now seen corresponding path program 11 times [2025-04-13 17:26:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:47,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561600466] [2025-04-13 17:26:47,414 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:47,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:47,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:47,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:47,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:48,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:48,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561600466] [2025-04-13 17:26:48,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561600466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:48,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109217897] [2025-04-13 17:26:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:48,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:48,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:48,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:48,527 INFO L87 Difference]: Start difference. First operand 539 states and 1397 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:49,758 INFO L93 Difference]: Finished difference Result 613 states and 1540 transitions. [2025-04-13 17:26:49,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:49,758 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:49,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:49,760 INFO L225 Difference]: With dead ends: 613 [2025-04-13 17:26:49,760 INFO L226 Difference]: Without dead ends: 589 [2025-04-13 17:26:49,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:26:49,760 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:49,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:26:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-04-13 17:26:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 531. [2025-04-13 17:26:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 529 states have (on average 2.614366729678639) internal successors, (1383), 530 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1383 transitions. [2025-04-13 17:26:49,851 INFO L79 Accepts]: Start accepts. Automaton has 531 states and 1383 transitions. Word has length 19 [2025-04-13 17:26:49,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:49,851 INFO L485 AbstractCegarLoop]: Abstraction has 531 states and 1383 transitions. [2025-04-13 17:26:49,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:49,851 INFO L278 IsEmpty]: Start isEmpty. Operand 531 states and 1383 transitions. [2025-04-13 17:26:49,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:49,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:49,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:49,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 17:26:49,852 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:49,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash -78839341, now seen corresponding path program 8 times [2025-04-13 17:26:49,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:49,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775952569] [2025-04-13 17:26:49,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:49,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:49,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:49,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:49,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:50,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:50,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775952569] [2025-04-13 17:26:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775952569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:50,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:26:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137618959] [2025-04-13 17:26:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:50,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:26:50,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:50,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:26:50,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:26:50,922 INFO L87 Difference]: Start difference. First operand 531 states and 1383 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:52,056 INFO L93 Difference]: Finished difference Result 650 states and 1642 transitions. [2025-04-13 17:26:52,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:26:52,056 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:52,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:52,058 INFO L225 Difference]: With dead ends: 650 [2025-04-13 17:26:52,058 INFO L226 Difference]: Without dead ends: 601 [2025-04-13 17:26:52,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:52,059 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:52,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:26:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-04-13 17:26:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 521. [2025-04-13 17:26:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 519 states have (on average 2.597302504816956) internal successors, (1348), 520 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1348 transitions. [2025-04-13 17:26:52,151 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1348 transitions. Word has length 19 [2025-04-13 17:26:52,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:52,151 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1348 transitions. [2025-04-13 17:26:52,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:52,151 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1348 transitions. [2025-04-13 17:26:52,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:52,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:52,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:52,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 17:26:52,152 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:52,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:52,152 INFO L85 PathProgramCache]: Analyzing trace with hash -645964473, now seen corresponding path program 9 times [2025-04-13 17:26:52,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:52,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606020544] [2025-04-13 17:26:52,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:52,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:52,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:52,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:52,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:52,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:52,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606020544] [2025-04-13 17:26:52,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606020544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:52,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:52,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:26:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300397392] [2025-04-13 17:26:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:52,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:26:52,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:52,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:26:52,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:26:52,511 INFO L87 Difference]: Start difference. First operand 521 states and 1348 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:53,210 INFO L93 Difference]: Finished difference Result 738 states and 1798 transitions. [2025-04-13 17:26:53,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:26:53,210 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:53,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:53,212 INFO L225 Difference]: With dead ends: 738 [2025-04-13 17:26:53,212 INFO L226 Difference]: Without dead ends: 707 [2025-04-13 17:26:53,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:26:53,213 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:53,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 9 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:26:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-04-13 17:26:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 523. [2025-04-13 17:26:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 521 states have (on average 2.5854126679462572) internal successors, (1347), 522 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1347 transitions. [2025-04-13 17:26:53,298 INFO L79 Accepts]: Start accepts. Automaton has 523 states and 1347 transitions. Word has length 19 [2025-04-13 17:26:53,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:53,298 INFO L485 AbstractCegarLoop]: Abstraction has 523 states and 1347 transitions. [2025-04-13 17:26:53,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:53,298 INFO L278 IsEmpty]: Start isEmpty. Operand 523 states and 1347 transitions. [2025-04-13 17:26:53,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:53,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:53,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:53,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 17:26:53,299 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:53,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1932484251, now seen corresponding path program 11 times [2025-04-13 17:26:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:53,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802781886] [2025-04-13 17:26:53,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:53,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:53,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:53,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:54,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802781886] [2025-04-13 17:26:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802781886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:26:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370150510] [2025-04-13 17:26:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:54,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:26:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:54,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:26:54,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:54,644 INFO L87 Difference]: Start difference. First operand 523 states and 1347 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:57,067 INFO L93 Difference]: Finished difference Result 929 states and 2300 transitions. [2025-04-13 17:26:57,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:26:57,067 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:26:57,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:57,070 INFO L225 Difference]: With dead ends: 929 [2025-04-13 17:26:57,070 INFO L226 Difference]: Without dead ends: 909 [2025-04-13 17:26:57,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:26:57,071 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:57,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 0 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:26:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-04-13 17:26:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 517. [2025-04-13 17:26:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 515 states have (on average 2.574757281553398) internal successors, (1326), 516 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1326 transitions. [2025-04-13 17:26:57,160 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1326 transitions. Word has length 19 [2025-04-13 17:26:57,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:57,160 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1326 transitions. [2025-04-13 17:26:57,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:57,160 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1326 transitions. [2025-04-13 17:26:57,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:57,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:57,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:57,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 17:26:57,161 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:26:57,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:57,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1454362483, now seen corresponding path program 1 times [2025-04-13 17:26:57,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:57,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696304131] [2025-04-13 17:26:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:57,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:57,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:57,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:57,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:58,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696304131] [2025-04-13 17:26:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696304131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:26:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368893431] [2025-04-13 17:26:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:58,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:26:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:26:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:26:58,707 INFO L87 Difference]: Start difference. First operand 517 states and 1326 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:00,425 INFO L93 Difference]: Finished difference Result 672 states and 1689 transitions. [2025-04-13 17:27:00,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:27:00,426 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:00,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:00,428 INFO L225 Difference]: With dead ends: 672 [2025-04-13 17:27:00,428 INFO L226 Difference]: Without dead ends: 623 [2025-04-13 17:27:00,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:27:00,428 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:00,428 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:27:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-13 17:27:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 525. [2025-04-13 17:27:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 523 states have (on average 2.5889101338432123) internal successors, (1354), 524 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1354 transitions. [2025-04-13 17:27:00,521 INFO L79 Accepts]: Start accepts. Automaton has 525 states and 1354 transitions. Word has length 19 [2025-04-13 17:27:00,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:00,521 INFO L485 AbstractCegarLoop]: Abstraction has 525 states and 1354 transitions. [2025-04-13 17:27:00,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:00,521 INFO L278 IsEmpty]: Start isEmpty. Operand 525 states and 1354 transitions. [2025-04-13 17:27:00,522 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:00,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:00,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:00,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 17:27:00,522 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:00,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1638833525, now seen corresponding path program 2 times [2025-04-13 17:27:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:00,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216069498] [2025-04-13 17:27:00,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:00,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:00,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:00,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:01,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216069498] [2025-04-13 17:27:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216069498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71307072] [2025-04-13 17:27:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:01,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:01,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:01,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:01,378 INFO L87 Difference]: Start difference. First operand 525 states and 1354 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:08,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-13 17:27:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:08,380 INFO L93 Difference]: Finished difference Result 749 states and 1835 transitions. [2025-04-13 17:27:08,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:27:08,381 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:08,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:08,383 INFO L225 Difference]: With dead ends: 749 [2025-04-13 17:27:08,383 INFO L226 Difference]: Without dead ends: 726 [2025-04-13 17:27:08,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:27:08,384 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 292 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:08,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 0 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 947 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-04-13 17:27:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-04-13 17:27:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 527. [2025-04-13 17:27:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 525 states have (on average 2.5885714285714285) internal successors, (1359), 526 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1359 transitions. [2025-04-13 17:27:08,475 INFO L79 Accepts]: Start accepts. Automaton has 527 states and 1359 transitions. Word has length 19 [2025-04-13 17:27:08,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:08,475 INFO L485 AbstractCegarLoop]: Abstraction has 527 states and 1359 transitions. [2025-04-13 17:27:08,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:08,475 INFO L278 IsEmpty]: Start isEmpty. Operand 527 states and 1359 transitions. [2025-04-13 17:27:08,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:08,476 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:08,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:08,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 17:27:08,476 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:08,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1039935373, now seen corresponding path program 12 times [2025-04-13 17:27:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:08,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965556050] [2025-04-13 17:27:08,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:27:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:08,499 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:08,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:08,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:27:08,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:10,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965556050] [2025-04-13 17:27:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965556050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:10,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:27:10,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140259837] [2025-04-13 17:27:10,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:10,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:27:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:27:10,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:27:10,441 INFO L87 Difference]: Start difference. First operand 527 states and 1359 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:12,154 INFO L93 Difference]: Finished difference Result 664 states and 1645 transitions. [2025-04-13 17:27:12,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:27:12,155 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:12,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:12,158 INFO L225 Difference]: With dead ends: 664 [2025-04-13 17:27:12,158 INFO L226 Difference]: Without dead ends: 615 [2025-04-13 17:27:12,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:27:12,159 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:12,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:27:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-04-13 17:27:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 521. [2025-04-13 17:27:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 519 states have (on average 2.5741811175337186) internal successors, (1336), 520 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1336 transitions. [2025-04-13 17:27:12,262 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1336 transitions. Word has length 19 [2025-04-13 17:27:12,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:12,262 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1336 transitions. [2025-04-13 17:27:12,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:12,262 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1336 transitions. [2025-04-13 17:27:12,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:12,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:12,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:12,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 17:27:12,263 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:12,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 409176323, now seen corresponding path program 12 times [2025-04-13 17:27:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:12,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215239211] [2025-04-13 17:27:12,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:27:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:12,287 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:12,306 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:12,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:27:12,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:13,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215239211] [2025-04-13 17:27:13,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215239211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:13,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:13,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:27:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093431602] [2025-04-13 17:27:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:13,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:27:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:13,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:27:13,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:27:13,628 INFO L87 Difference]: Start difference. First operand 521 states and 1336 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:14,856 INFO L93 Difference]: Finished difference Result 591 states and 1479 transitions. [2025-04-13 17:27:14,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:27:14,856 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:14,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:14,859 INFO L225 Difference]: With dead ends: 591 [2025-04-13 17:27:14,859 INFO L226 Difference]: Without dead ends: 571 [2025-04-13 17:27:14,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:27:14,860 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:14,860 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:27:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-04-13 17:27:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 511. [2025-04-13 17:27:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 509 states have (on average 2.5717092337917484) internal successors, (1309), 510 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1309 transitions. [2025-04-13 17:27:14,965 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 1309 transitions. Word has length 19 [2025-04-13 17:27:14,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:14,965 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 1309 transitions. [2025-04-13 17:27:14,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:14,965 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 1309 transitions. [2025-04-13 17:27:14,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:14,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:14,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:14,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 17:27:14,966 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:14,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1495846017, now seen corresponding path program 10 times [2025-04-13 17:27:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:14,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528336094] [2025-04-13 17:27:14,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:27:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:14,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:27:15,023 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:15,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:27:15,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:16,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528336094] [2025-04-13 17:27:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528336094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:27:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940192150] [2025-04-13 17:27:16,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:16,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:27:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:27:16,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:27:16,179 INFO L87 Difference]: Start difference. First operand 511 states and 1309 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:17,446 INFO L93 Difference]: Finished difference Result 714 states and 1798 transitions. [2025-04-13 17:27:17,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:27:17,446 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:17,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:17,448 INFO L225 Difference]: With dead ends: 714 [2025-04-13 17:27:17,448 INFO L226 Difference]: Without dead ends: 665 [2025-04-13 17:27:17,449 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:27:17,449 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:17,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:27:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-04-13 17:27:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 509. [2025-04-13 17:27:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 507 states have (on average 2.5719921104536487) internal successors, (1304), 508 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1304 transitions. [2025-04-13 17:27:17,555 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1304 transitions. Word has length 19 [2025-04-13 17:27:17,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:17,556 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1304 transitions. [2025-04-13 17:27:17,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:17,556 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1304 transitions. [2025-04-13 17:27:17,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:17,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:17,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:17,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 17:27:17,557 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:17,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 362913677, now seen corresponding path program 13 times [2025-04-13 17:27:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:17,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213814458] [2025-04-13 17:27:17,557 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:27:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:17,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:17,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:27:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:19,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213814458] [2025-04-13 17:27:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213814458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292517461] [2025-04-13 17:27:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:19,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:19,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:19,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:19,574 INFO L87 Difference]: Start difference. First operand 509 states and 1304 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:21,470 INFO L93 Difference]: Finished difference Result 632 states and 1583 transitions. [2025-04-13 17:27:21,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:27:21,471 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:21,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:21,473 INFO L225 Difference]: With dead ends: 632 [2025-04-13 17:27:21,473 INFO L226 Difference]: Without dead ends: 579 [2025-04-13 17:27:21,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:27:21,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:21,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:27:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-04-13 17:27:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 509. [2025-04-13 17:27:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 507 states have (on average 2.5719921104536487) internal successors, (1304), 508 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1304 transitions. [2025-04-13 17:27:21,579 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1304 transitions. Word has length 19 [2025-04-13 17:27:21,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:21,579 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1304 transitions. [2025-04-13 17:27:21,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:21,579 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1304 transitions. [2025-04-13 17:27:21,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:21,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:21,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:21,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 17:27:21,580 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:21,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -464861179, now seen corresponding path program 11 times [2025-04-13 17:27:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:21,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524954073] [2025-04-13 17:27:21,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:27:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:21,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:21,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:21,656 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:23,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:23,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524954073] [2025-04-13 17:27:23,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524954073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:23,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:23,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404501616] [2025-04-13 17:27:23,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:23,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:23,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:23,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:23,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:23,347 INFO L87 Difference]: Start difference. First operand 509 states and 1304 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:25,208 INFO L93 Difference]: Finished difference Result 709 states and 1801 transitions. [2025-04-13 17:27:25,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:27:25,209 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:25,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:25,211 INFO L225 Difference]: With dead ends: 709 [2025-04-13 17:27:25,211 INFO L226 Difference]: Without dead ends: 660 [2025-04-13 17:27:25,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:27:25,212 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:25,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:27:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-13 17:27:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 511. [2025-04-13 17:27:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 509 states have (on average 2.5756385068762278) internal successors, (1311), 510 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1311 transitions. [2025-04-13 17:27:25,310 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 1311 transitions. Word has length 19 [2025-04-13 17:27:25,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:25,311 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 1311 transitions. [2025-04-13 17:27:25,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:25,311 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 1311 transitions. [2025-04-13 17:27:25,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:25,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:25,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:25,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 17:27:25,312 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:25,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:25,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2027784471, now seen corresponding path program 13 times [2025-04-13 17:27:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:25,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065535491] [2025-04-13 17:27:25,313 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:27:25,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:25,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:25,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:25,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:27:25,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:27,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065535491] [2025-04-13 17:27:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065535491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219301192] [2025-04-13 17:27:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:27,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:27,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:27,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:27,588 INFO L87 Difference]: Start difference. First operand 511 states and 1311 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:29,624 INFO L93 Difference]: Finished difference Result 674 states and 1688 transitions. [2025-04-13 17:27:29,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:27:29,624 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:29,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:29,626 INFO L225 Difference]: With dead ends: 674 [2025-04-13 17:27:29,627 INFO L226 Difference]: Without dead ends: 629 [2025-04-13 17:27:29,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:27:29,627 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:29,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:27:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-04-13 17:27:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 517. [2025-04-13 17:27:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 515 states have (on average 2.574757281553398) internal successors, (1326), 516 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1326 transitions. [2025-04-13 17:27:29,730 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1326 transitions. Word has length 19 [2025-04-13 17:27:29,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:29,731 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1326 transitions. [2025-04-13 17:27:29,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:29,731 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1326 transitions. [2025-04-13 17:27:29,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:29,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:29,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:29,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 17:27:29,732 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:29,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2044765341, now seen corresponding path program 14 times [2025-04-13 17:27:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:29,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004938171] [2025-04-13 17:27:29,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:29,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:29,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:29,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:31,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004938171] [2025-04-13 17:27:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004938171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:31,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:31,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845359308] [2025-04-13 17:27:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:31,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:31,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:31,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:31,388 INFO L87 Difference]: Start difference. First operand 517 states and 1326 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:33,115 INFO L93 Difference]: Finished difference Result 647 states and 1623 transitions. [2025-04-13 17:27:33,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:27:33,115 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:33,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:33,117 INFO L225 Difference]: With dead ends: 647 [2025-04-13 17:27:33,117 INFO L226 Difference]: Without dead ends: 627 [2025-04-13 17:27:33,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:27:33,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:33,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:27:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-04-13 17:27:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 507. [2025-04-13 17:27:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 2.5722772277227723) internal successors, (1299), 506 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1299 transitions. [2025-04-13 17:27:33,212 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1299 transitions. Word has length 19 [2025-04-13 17:27:33,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:33,212 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1299 transitions. [2025-04-13 17:27:33,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:33,212 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1299 transitions. [2025-04-13 17:27:33,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:33,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:33,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:33,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 17:27:33,213 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:33,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:33,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2113753383, now seen corresponding path program 14 times [2025-04-13 17:27:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:33,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022883020] [2025-04-13 17:27:33,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:33,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:33,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:33,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:33,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:34,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:34,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022883020] [2025-04-13 17:27:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022883020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:34,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637371545] [2025-04-13 17:27:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:34,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:34,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:34,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:34,459 INFO L87 Difference]: Start difference. First operand 507 states and 1299 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:35,781 INFO L93 Difference]: Finished difference Result 620 states and 1533 transitions. [2025-04-13 17:27:35,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:27:35,782 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:35,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:35,784 INFO L225 Difference]: With dead ends: 620 [2025-04-13 17:27:35,784 INFO L226 Difference]: Without dead ends: 571 [2025-04-13 17:27:35,784 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:27:35,784 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:35,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:27:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-04-13 17:27:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 509. [2025-04-13 17:27:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 507 states have (on average 2.5719921104536487) internal successors, (1304), 508 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1304 transitions. [2025-04-13 17:27:35,882 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1304 transitions. Word has length 19 [2025-04-13 17:27:35,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:35,882 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1304 transitions. [2025-04-13 17:27:35,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:35,882 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1304 transitions. [2025-04-13 17:27:35,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:35,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:35,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:35,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 17:27:35,883 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:35,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1682512573, now seen corresponding path program 15 times [2025-04-13 17:27:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:35,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694798031] [2025-04-13 17:27:35,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:27:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:35,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:35,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:35,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:27:35,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:36,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694798031] [2025-04-13 17:27:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694798031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:36,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944892293] [2025-04-13 17:27:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:36,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:36,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:36,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:36,908 INFO L87 Difference]: Start difference. First operand 509 states and 1304 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:37,897 INFO L93 Difference]: Finished difference Result 642 states and 1572 transitions. [2025-04-13 17:27:37,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:27:37,898 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:37,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:37,900 INFO L225 Difference]: With dead ends: 642 [2025-04-13 17:27:37,900 INFO L226 Difference]: Without dead ends: 591 [2025-04-13 17:27:37,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:27:37,901 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:37,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:27:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-04-13 17:27:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 503. [2025-04-13 17:27:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 501 states have (on average 2.5848303393213574) internal successors, (1295), 502 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1295 transitions. [2025-04-13 17:27:38,001 INFO L79 Accepts]: Start accepts. Automaton has 503 states and 1295 transitions. Word has length 19 [2025-04-13 17:27:38,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:38,002 INFO L485 AbstractCegarLoop]: Abstraction has 503 states and 1295 transitions. [2025-04-13 17:27:38,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:38,002 INFO L278 IsEmpty]: Start isEmpty. Operand 503 states and 1295 transitions. [2025-04-13 17:27:38,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:38,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:38,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:38,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 17:27:38,003 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:38,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1874325911, now seen corresponding path program 12 times [2025-04-13 17:27:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:38,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426648396] [2025-04-13 17:27:38,003 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:27:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:38,026 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:38,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:38,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:27:38,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:39,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426648396] [2025-04-13 17:27:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426648396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:39,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:39,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179565764] [2025-04-13 17:27:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:39,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:39,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:39,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:39,776 INFO L87 Difference]: Start difference. First operand 503 states and 1295 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:41,731 INFO L93 Difference]: Finished difference Result 652 states and 1637 transitions. [2025-04-13 17:27:41,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:27:41,731 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:41,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:41,733 INFO L225 Difference]: With dead ends: 652 [2025-04-13 17:27:41,733 INFO L226 Difference]: Without dead ends: 599 [2025-04-13 17:27:41,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:27:41,733 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:41,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:27:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-04-13 17:27:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2025-04-13 17:27:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 507 states have (on average 2.5956607495069033) internal successors, (1316), 508 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1316 transitions. [2025-04-13 17:27:41,845 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1316 transitions. Word has length 19 [2025-04-13 17:27:41,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:41,845 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1316 transitions. [2025-04-13 17:27:41,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:41,845 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1316 transitions. [2025-04-13 17:27:41,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:41,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:41,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:41,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 17:27:41,846 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:41,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash -994839429, now seen corresponding path program 13 times [2025-04-13 17:27:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:41,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115688056] [2025-04-13 17:27:41,846 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:27:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:41,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:41,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:41,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:27:41,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:42,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:42,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115688056] [2025-04-13 17:27:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115688056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:42,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:27:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821812643] [2025-04-13 17:27:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:42,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:27:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:42,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:27:42,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:27:42,783 INFO L87 Difference]: Start difference. First operand 509 states and 1316 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:43,831 INFO L93 Difference]: Finished difference Result 660 states and 1691 transitions. [2025-04-13 17:27:43,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:27:43,831 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:43,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:43,833 INFO L225 Difference]: With dead ends: 660 [2025-04-13 17:27:43,833 INFO L226 Difference]: Without dead ends: 611 [2025-04-13 17:27:43,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:27:43,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:43,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:27:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-04-13 17:27:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 487. [2025-04-13 17:27:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5628865979381446) internal successors, (1243), 486 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1243 transitions. [2025-04-13 17:27:43,921 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1243 transitions. Word has length 19 [2025-04-13 17:27:43,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:43,921 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1243 transitions. [2025-04-13 17:27:43,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:43,921 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1243 transitions. [2025-04-13 17:27:43,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:43,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:43,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:43,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 17:27:43,922 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:43,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 551291429, now seen corresponding path program 14 times [2025-04-13 17:27:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:43,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971668353] [2025-04-13 17:27:43,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:43,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:43,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:43,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:43,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:45,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971668353] [2025-04-13 17:27:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971668353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303903533] [2025-04-13 17:27:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:45,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:45,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:45,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:45,163 INFO L87 Difference]: Start difference. First operand 487 states and 1243 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:46,749 INFO L93 Difference]: Finished difference Result 742 states and 1872 transitions. [2025-04-13 17:27:46,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:27:46,750 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:46,750 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:46,752 INFO L225 Difference]: With dead ends: 742 [2025-04-13 17:27:46,752 INFO L226 Difference]: Without dead ends: 693 [2025-04-13 17:27:46,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:27:46,752 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:46,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:27:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-04-13 17:27:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 501. [2025-04-13 17:27:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.565130260521042) internal successors, (1280), 500 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1280 transitions. [2025-04-13 17:27:46,840 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1280 transitions. Word has length 19 [2025-04-13 17:27:46,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:46,840 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1280 transitions. [2025-04-13 17:27:46,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:46,840 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1280 transitions. [2025-04-13 17:27:46,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:46,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:46,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:46,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 17:27:46,841 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:46,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash 724963893, now seen corresponding path program 16 times [2025-04-13 17:27:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:46,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296657158] [2025-04-13 17:27:46,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:27:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:46,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:27:46,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:46,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:27:46,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:48,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296657158] [2025-04-13 17:27:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296657158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:27:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120296023] [2025-04-13 17:27:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:48,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:27:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:48,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:27:48,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:27:48,318 INFO L87 Difference]: Start difference. First operand 501 states and 1280 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:49,588 INFO L93 Difference]: Finished difference Result 676 states and 1653 transitions. [2025-04-13 17:27:49,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:27:49,588 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:49,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:49,590 INFO L225 Difference]: With dead ends: 676 [2025-04-13 17:27:49,590 INFO L226 Difference]: Without dead ends: 627 [2025-04-13 17:27:49,590 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:27:49,591 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:49,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:27:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-04-13 17:27:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 515. [2025-04-13 17:27:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 513 states have (on average 2.5828460038986356) internal successors, (1325), 514 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1325 transitions. [2025-04-13 17:27:49,678 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1325 transitions. Word has length 19 [2025-04-13 17:27:49,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:49,679 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1325 transitions. [2025-04-13 17:27:49,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:49,679 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1325 transitions. [2025-04-13 17:27:49,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:49,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:49,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:49,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 17:27:49,680 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:49,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash 163412609, now seen corresponding path program 15 times [2025-04-13 17:27:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:49,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406486751] [2025-04-13 17:27:49,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:27:49,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:49,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:49,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:49,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:27:49,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:50,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406486751] [2025-04-13 17:27:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406486751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:50,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761790339] [2025-04-13 17:27:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:50,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:50,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:50,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:50,944 INFO L87 Difference]: Start difference. First operand 515 states and 1325 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:52,446 INFO L93 Difference]: Finished difference Result 772 states and 1941 transitions. [2025-04-13 17:27:52,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:27:52,446 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:52,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:52,448 INFO L225 Difference]: With dead ends: 772 [2025-04-13 17:27:52,448 INFO L226 Difference]: Without dead ends: 747 [2025-04-13 17:27:52,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:27:52,449 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:52,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:27:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-04-13 17:27:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 517. [2025-04-13 17:27:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 515 states have (on average 2.578640776699029) internal successors, (1328), 516 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1328 transitions. [2025-04-13 17:27:52,539 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1328 transitions. Word has length 19 [2025-04-13 17:27:52,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:52,539 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1328 transitions. [2025-04-13 17:27:52,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:52,539 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1328 transitions. [2025-04-13 17:27:52,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:52,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:52,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:52,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 17:27:52,550 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:52,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1223665233, now seen corresponding path program 17 times [2025-04-13 17:27:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:52,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246830669] [2025-04-13 17:27:52,551 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:27:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:52,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:52,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:52,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:52,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:53,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246830669] [2025-04-13 17:27:53,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246830669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:53,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852363355] [2025-04-13 17:27:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:53,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:53,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:53,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:53,480 INFO L87 Difference]: Start difference. First operand 517 states and 1328 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:54,474 INFO L93 Difference]: Finished difference Result 692 states and 1691 transitions. [2025-04-13 17:27:54,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:27:54,474 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:54,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:54,476 INFO L225 Difference]: With dead ends: 692 [2025-04-13 17:27:54,476 INFO L226 Difference]: Without dead ends: 643 [2025-04-13 17:27:54,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:27:54,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:54,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:27:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-04-13 17:27:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 501. [2025-04-13 17:27:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.5571142284569137) internal successors, (1276), 500 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1276 transitions. [2025-04-13 17:27:54,573 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1276 transitions. Word has length 19 [2025-04-13 17:27:54,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:54,573 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1276 transitions. [2025-04-13 17:27:54,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:54,573 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1276 transitions. [2025-04-13 17:27:54,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:54,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:54,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:54,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 17:27:54,574 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:54,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1424450775, now seen corresponding path program 18 times [2025-04-13 17:27:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:54,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118085033] [2025-04-13 17:27:54,574 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:27:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:54,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:54,621 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:54,621 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:27:54,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:55,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118085033] [2025-04-13 17:27:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118085033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653535613] [2025-04-13 17:27:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:55,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:55,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:55,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:55,889 INFO L87 Difference]: Start difference. First operand 501 states and 1276 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:57,275 INFO L93 Difference]: Finished difference Result 702 states and 1750 transitions. [2025-04-13 17:27:57,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:27:57,275 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:57,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:57,277 INFO L225 Difference]: With dead ends: 702 [2025-04-13 17:27:57,277 INFO L226 Difference]: Without dead ends: 649 [2025-04-13 17:27:57,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:27:57,278 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:57,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:27:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-04-13 17:27:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 501. [2025-04-13 17:27:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 499 states have (on average 2.5571142284569137) internal successors, (1276), 500 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1276 transitions. [2025-04-13 17:27:57,377 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1276 transitions. Word has length 19 [2025-04-13 17:27:57,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:57,377 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1276 transitions. [2025-04-13 17:27:57,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:57,377 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1276 transitions. [2025-04-13 17:27:57,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:57,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:57,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 17:27:57,378 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:57,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1569553607, now seen corresponding path program 16 times [2025-04-13 17:27:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:57,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948135319] [2025-04-13 17:27:57,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:27:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:57,400 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:27:57,422 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:57,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:27:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:27:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:58,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948135319] [2025-04-13 17:27:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948135319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:27:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236080047] [2025-04-13 17:27:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:58,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:27:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:27:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:27:58,708 INFO L87 Difference]: Start difference. First operand 501 states and 1276 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:59,532 INFO L93 Difference]: Finished difference Result 692 states and 1701 transitions. [2025-04-13 17:27:59,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:27:59,532 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:59,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:59,534 INFO L225 Difference]: With dead ends: 692 [2025-04-13 17:27:59,534 INFO L226 Difference]: Without dead ends: 639 [2025-04-13 17:27:59,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:27:59,534 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:59,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:27:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-04-13 17:27:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 505. [2025-04-13 17:27:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 2.5685884691848906) internal successors, (1292), 504 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1292 transitions. [2025-04-13 17:27:59,628 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1292 transitions. Word has length 19 [2025-04-13 17:27:59,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:59,628 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1292 transitions. [2025-04-13 17:27:59,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:27:59,628 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1292 transitions. [2025-04-13 17:27:59,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:27:59,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:59,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:59,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 17:27:59,629 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:27:59,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2027710745, now seen corresponding path program 17 times [2025-04-13 17:27:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:59,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770844159] [2025-04-13 17:27:59,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:27:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:59,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:27:59,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:27:59,672 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:59,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:00,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770844159] [2025-04-13 17:28:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770844159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:00,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:00,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117429837] [2025-04-13 17:28:00,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:00,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:00,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:00,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:00,695 INFO L87 Difference]: Start difference. First operand 505 states and 1292 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:01,750 INFO L93 Difference]: Finished difference Result 674 states and 1668 transitions. [2025-04-13 17:28:01,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:28:01,751 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:01,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:01,752 INFO L225 Difference]: With dead ends: 674 [2025-04-13 17:28:01,752 INFO L226 Difference]: Without dead ends: 625 [2025-04-13 17:28:01,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:28:01,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:01,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-04-13 17:28:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 507. [2025-04-13 17:28:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 2.5722772277227723) internal successors, (1299), 506 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1299 transitions. [2025-04-13 17:28:01,849 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1299 transitions. Word has length 19 [2025-04-13 17:28:01,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:01,849 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1299 transitions. [2025-04-13 17:28:01,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:01,849 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1299 transitions. [2025-04-13 17:28:01,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:01,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:01,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:01,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 17:28:01,850 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:01,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2138859617, now seen corresponding path program 18 times [2025-04-13 17:28:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:01,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184124195] [2025-04-13 17:28:01,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:01,872 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:01,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:01,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:01,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:03,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184124195] [2025-04-13 17:28:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184124195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:28:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828155255] [2025-04-13 17:28:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:03,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:28:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:03,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:28:03,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:28:03,106 INFO L87 Difference]: Start difference. First operand 507 states and 1299 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:04,352 INFO L93 Difference]: Finished difference Result 682 states and 1712 transitions. [2025-04-13 17:28:04,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:04,352 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:04,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:04,354 INFO L225 Difference]: With dead ends: 682 [2025-04-13 17:28:04,354 INFO L226 Difference]: Without dead ends: 633 [2025-04-13 17:28:04,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:28:04,354 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:04,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-04-13 17:28:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 507. [2025-04-13 17:28:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 2.5643564356435644) internal successors, (1295), 506 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1295 transitions. [2025-04-13 17:28:04,452 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1295 transitions. Word has length 19 [2025-04-13 17:28:04,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:04,452 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1295 transitions. [2025-04-13 17:28:04,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:04,452 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1295 transitions. [2025-04-13 17:28:04,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:04,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:04,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:04,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 17:28:04,453 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:04,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1440962073, now seen corresponding path program 15 times [2025-04-13 17:28:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:04,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779276639] [2025-04-13 17:28:04,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:28:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:04,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:04,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:04,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:28:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:05,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779276639] [2025-04-13 17:28:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779276639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:05,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312831238] [2025-04-13 17:28:05,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:05,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:05,838 INFO L87 Difference]: Start difference. First operand 507 states and 1295 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:07,110 INFO L93 Difference]: Finished difference Result 713 states and 1747 transitions. [2025-04-13 17:28:07,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:07,110 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:07,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:07,112 INFO L225 Difference]: With dead ends: 713 [2025-04-13 17:28:07,112 INFO L226 Difference]: Without dead ends: 664 [2025-04-13 17:28:07,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:28:07,113 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:07,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:28:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-04-13 17:28:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 505. [2025-04-13 17:28:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 2.5606361829025843) internal successors, (1288), 504 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1288 transitions. [2025-04-13 17:28:07,223 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1288 transitions. Word has length 19 [2025-04-13 17:28:07,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:07,223 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1288 transitions. [2025-04-13 17:28:07,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:07,223 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1288 transitions. [2025-04-13 17:28:07,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:07,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:07,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:07,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 17:28:07,224 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:07,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1637356563, now seen corresponding path program 19 times [2025-04-13 17:28:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:07,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007691019] [2025-04-13 17:28:07,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:07,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:07,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:07,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:07,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:08,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007691019] [2025-04-13 17:28:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007691019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:08,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:08,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818207430] [2025-04-13 17:28:08,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:08,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:08,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:08,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:08,778 INFO L87 Difference]: Start difference. First operand 505 states and 1288 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:11,028 INFO L93 Difference]: Finished difference Result 713 states and 1747 transitions. [2025-04-13 17:28:11,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:28:11,028 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:11,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:11,030 INFO L225 Difference]: With dead ends: 713 [2025-04-13 17:28:11,030 INFO L226 Difference]: Without dead ends: 660 [2025-04-13 17:28:11,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:28:11,031 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:11,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:28:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-13 17:28:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 499. [2025-04-13 17:28:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.545271629778672) internal successors, (1265), 498 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1265 transitions. [2025-04-13 17:28:11,125 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1265 transitions. Word has length 19 [2025-04-13 17:28:11,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:11,126 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1265 transitions. [2025-04-13 17:28:11,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:11,126 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1265 transitions. [2025-04-13 17:28:11,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:11,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:11,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:11,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 17:28:11,127 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:11,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash 482907139, now seen corresponding path program 19 times [2025-04-13 17:28:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:11,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889622803] [2025-04-13 17:28:11,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:11,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:11,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:11,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:11,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:12,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889622803] [2025-04-13 17:28:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889622803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:12,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:12,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346751033] [2025-04-13 17:28:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:12,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:12,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:12,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:12,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:12,494 INFO L87 Difference]: Start difference. First operand 499 states and 1265 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:13,858 INFO L93 Difference]: Finished difference Result 694 states and 1712 transitions. [2025-04-13 17:28:13,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:13,858 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:13,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:13,860 INFO L225 Difference]: With dead ends: 694 [2025-04-13 17:28:13,860 INFO L226 Difference]: Without dead ends: 645 [2025-04-13 17:28:13,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:28:13,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:13,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:28:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-04-13 17:28:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 495. [2025-04-13 17:28:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 493 states have (on average 2.5334685598377282) internal successors, (1249), 494 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1249 transitions. [2025-04-13 17:28:13,951 INFO L79 Accepts]: Start accepts. Automaton has 495 states and 1249 transitions. Word has length 19 [2025-04-13 17:28:13,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:13,951 INFO L485 AbstractCegarLoop]: Abstraction has 495 states and 1249 transitions. [2025-04-13 17:28:13,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:13,951 INFO L278 IsEmpty]: Start isEmpty. Operand 495 states and 1249 transitions. [2025-04-13 17:28:13,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:13,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:13,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:13,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 17:28:13,952 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:13,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:13,953 INFO L85 PathProgramCache]: Analyzing trace with hash -597709053, now seen corresponding path program 16 times [2025-04-13 17:28:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:13,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022256433] [2025-04-13 17:28:13,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:28:13,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:13,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:28:14,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:14,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:28:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:15,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022256433] [2025-04-13 17:28:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022256433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830459486] [2025-04-13 17:28:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:15,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:15,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:15,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:15,704 INFO L87 Difference]: Start difference. First operand 495 states and 1249 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:17,939 INFO L93 Difference]: Finished difference Result 671 states and 1671 transitions. [2025-04-13 17:28:17,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:28:17,939 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:17,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:17,942 INFO L225 Difference]: With dead ends: 671 [2025-04-13 17:28:17,942 INFO L226 Difference]: Without dead ends: 651 [2025-04-13 17:28:17,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:28:17,942 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:17,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:28:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-04-13 17:28:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 499. [2025-04-13 17:28:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 497 states have (on average 2.541247484909457) internal successors, (1263), 498 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1263 transitions. [2025-04-13 17:28:18,041 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1263 transitions. Word has length 19 [2025-04-13 17:28:18,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:18,041 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1263 transitions. [2025-04-13 17:28:18,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:18,041 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1263 transitions. [2025-04-13 17:28:18,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:18,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:18,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:18,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 17:28:18,042 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:18,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1926151757, now seen corresponding path program 17 times [2025-04-13 17:28:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:18,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068839309] [2025-04-13 17:28:18,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:28:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:18,065 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:18,090 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:18,090 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:18,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:19,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:19,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068839309] [2025-04-13 17:28:19,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068839309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:19,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:19,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:19,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939661191] [2025-04-13 17:28:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:19,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:19,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:19,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:19,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:19,785 INFO L87 Difference]: Start difference. First operand 499 states and 1263 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:21,465 INFO L93 Difference]: Finished difference Result 722 states and 1808 transitions. [2025-04-13 17:28:21,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:28:21,465 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:21,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:21,467 INFO L225 Difference]: With dead ends: 722 [2025-04-13 17:28:21,467 INFO L226 Difference]: Without dead ends: 702 [2025-04-13 17:28:21,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:28:21,468 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:21,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:28:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-04-13 17:28:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 487. [2025-04-13 17:28:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5257731958762886) internal successors, (1225), 486 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1225 transitions. [2025-04-13 17:28:21,553 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1225 transitions. Word has length 19 [2025-04-13 17:28:21,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:21,553 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1225 transitions. [2025-04-13 17:28:21,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:21,553 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1225 transitions. [2025-04-13 17:28:21,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:21,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:21,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:21,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 17:28:21,554 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:21,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1871524933, now seen corresponding path program 20 times [2025-04-13 17:28:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:21,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788298438] [2025-04-13 17:28:21,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:28:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:21,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:21,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:21,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:23,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788298438] [2025-04-13 17:28:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788298438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077208072] [2025-04-13 17:28:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:23,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:23,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:23,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:23,271 INFO L87 Difference]: Start difference. First operand 487 states and 1225 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:24,664 INFO L93 Difference]: Finished difference Result 644 states and 1565 transitions. [2025-04-13 17:28:24,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:28:24,665 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:24,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:24,666 INFO L225 Difference]: With dead ends: 644 [2025-04-13 17:28:24,666 INFO L226 Difference]: Without dead ends: 595 [2025-04-13 17:28:24,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:28:24,667 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:24,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-04-13 17:28:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 487. [2025-04-13 17:28:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5175257731958762) internal successors, (1221), 486 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1221 transitions. [2025-04-13 17:28:24,749 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1221 transitions. Word has length 19 [2025-04-13 17:28:24,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:24,749 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1221 transitions. [2025-04-13 17:28:24,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:24,749 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1221 transitions. [2025-04-13 17:28:24,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:24,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:24,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:24,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 17:28:24,750 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:24,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1443076075, now seen corresponding path program 20 times [2025-04-13 17:28:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:24,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684815888] [2025-04-13 17:28:24,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:28:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:24,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:24,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:24,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:24,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:25,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684815888] [2025-04-13 17:28:25,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684815888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:25,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:28:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720972268] [2025-04-13 17:28:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:25,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:28:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:25,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:28:25,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:28:25,469 INFO L87 Difference]: Start difference. First operand 487 states and 1221 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:26,177 INFO L93 Difference]: Finished difference Result 658 states and 1578 transitions. [2025-04-13 17:28:26,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:28:26,178 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:26,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:26,179 INFO L225 Difference]: With dead ends: 658 [2025-04-13 17:28:26,179 INFO L226 Difference]: Without dead ends: 609 [2025-04-13 17:28:26,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:26,180 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:26,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:28:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-04-13 17:28:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 487. [2025-04-13 17:28:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.51340206185567) internal successors, (1219), 486 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1219 transitions. [2025-04-13 17:28:26,261 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1219 transitions. Word has length 19 [2025-04-13 17:28:26,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:26,262 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1219 transitions. [2025-04-13 17:28:26,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:26,262 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1219 transitions. [2025-04-13 17:28:26,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:26,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:26,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:26,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 17:28:26,263 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:26,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1483646113, now seen corresponding path program 21 times [2025-04-13 17:28:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:26,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202074322] [2025-04-13 17:28:26,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:28:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:26,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:26,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:26,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:28:26,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:27,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202074322] [2025-04-13 17:28:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202074322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450529170] [2025-04-13 17:28:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:27,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:27,788 INFO L87 Difference]: Start difference. First operand 487 states and 1219 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:29,142 INFO L93 Difference]: Finished difference Result 648 states and 1559 transitions. [2025-04-13 17:28:29,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:28:29,142 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:29,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:29,144 INFO L225 Difference]: With dead ends: 648 [2025-04-13 17:28:29,144 INFO L226 Difference]: Without dead ends: 623 [2025-04-13 17:28:29,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:28:29,145 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:29,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-13 17:28:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 473. [2025-04-13 17:28:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 2.5095541401273884) internal successors, (1182), 472 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1182 transitions. [2025-04-13 17:28:29,229 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 1182 transitions. Word has length 19 [2025-04-13 17:28:29,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:29,229 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 1182 transitions. [2025-04-13 17:28:29,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:29,229 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 1182 transitions. [2025-04-13 17:28:29,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:29,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:29,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:29,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 17:28:29,230 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:29,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash -944374735, now seen corresponding path program 21 times [2025-04-13 17:28:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:29,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530303787] [2025-04-13 17:28:29,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:28:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:29,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:29,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:29,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:28:29,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:30,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:30,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530303787] [2025-04-13 17:28:30,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530303787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:30,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:28:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56379123] [2025-04-13 17:28:30,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:30,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:28:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:30,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:28:30,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:28:30,350 INFO L87 Difference]: Start difference. First operand 473 states and 1182 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:31,504 INFO L93 Difference]: Finished difference Result 641 states and 1528 transitions. [2025-04-13 17:28:31,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:28:31,504 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:31,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:31,506 INFO L225 Difference]: With dead ends: 641 [2025-04-13 17:28:31,506 INFO L226 Difference]: Without dead ends: 619 [2025-04-13 17:28:31,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:28:31,506 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:31,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-04-13 17:28:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 469. [2025-04-13 17:28:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.5096359743040684) internal successors, (1172), 468 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1172 transitions. [2025-04-13 17:28:31,593 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1172 transitions. Word has length 19 [2025-04-13 17:28:31,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:31,593 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1172 transitions. [2025-04-13 17:28:31,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:31,594 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1172 transitions. [2025-04-13 17:28:31,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:31,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:31,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:31,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 17:28:31,594 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:31,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1420282759, now seen corresponding path program 18 times [2025-04-13 17:28:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:31,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957121991] [2025-04-13 17:28:31,595 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:31,617 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:31,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:31,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:31,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:33,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:33,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957121991] [2025-04-13 17:28:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957121991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:28:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386871173] [2025-04-13 17:28:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:33,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:28:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:33,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:28:33,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:28:33,013 INFO L87 Difference]: Start difference. First operand 469 states and 1172 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:34,046 INFO L93 Difference]: Finished difference Result 613 states and 1502 transitions. [2025-04-13 17:28:34,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:28:34,046 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:34,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:34,048 INFO L225 Difference]: With dead ends: 613 [2025-04-13 17:28:34,048 INFO L226 Difference]: Without dead ends: 593 [2025-04-13 17:28:34,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:28:34,048 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:34,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:28:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-04-13 17:28:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 465. [2025-04-13 17:28:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 463 states have (on average 2.5053995680345573) internal successors, (1160), 464 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1160 transitions. [2025-04-13 17:28:34,128 INFO L79 Accepts]: Start accepts. Automaton has 465 states and 1160 transitions. Word has length 19 [2025-04-13 17:28:34,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:34,128 INFO L485 AbstractCegarLoop]: Abstraction has 465 states and 1160 transitions. [2025-04-13 17:28:34,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:34,128 INFO L278 IsEmpty]: Start isEmpty. Operand 465 states and 1160 transitions. [2025-04-13 17:28:34,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:34,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:34,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:34,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 17:28:34,129 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:34,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:34,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1959676425, now seen corresponding path program 22 times [2025-04-13 17:28:34,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:34,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027692796] [2025-04-13 17:28:34,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:28:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:34,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:28:34,182 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:34,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:28:34,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:35,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:35,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027692796] [2025-04-13 17:28:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027692796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930513685] [2025-04-13 17:28:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:35,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:35,352 INFO L87 Difference]: Start difference. First operand 465 states and 1160 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:36,399 INFO L93 Difference]: Finished difference Result 592 states and 1427 transitions. [2025-04-13 17:28:36,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:28:36,399 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:36,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:36,401 INFO L225 Difference]: With dead ends: 592 [2025-04-13 17:28:36,401 INFO L226 Difference]: Without dead ends: 547 [2025-04-13 17:28:36,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:28:36,401 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:36,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:28:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-04-13 17:28:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 467. [2025-04-13 17:28:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 2.5053763440860215) internal successors, (1165), 466 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1165 transitions. [2025-04-13 17:28:36,490 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1165 transitions. Word has length 19 [2025-04-13 17:28:36,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:36,490 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1165 transitions. [2025-04-13 17:28:36,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:36,490 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1165 transitions. [2025-04-13 17:28:36,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:36,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:36,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:36,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 17:28:36,491 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:36,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1971756707, now seen corresponding path program 3 times [2025-04-13 17:28:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:36,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410284621] [2025-04-13 17:28:36,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:28:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:36,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:36,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:36,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:28:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:37,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410284621] [2025-04-13 17:28:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410284621] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:37,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:37,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543719084] [2025-04-13 17:28:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:37,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:37,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:37,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:37,731 INFO L87 Difference]: Start difference. First operand 467 states and 1165 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:38,980 INFO L93 Difference]: Finished difference Result 582 states and 1414 transitions. [2025-04-13 17:28:38,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:38,980 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:38,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:38,982 INFO L225 Difference]: With dead ends: 582 [2025-04-13 17:28:38,983 INFO L226 Difference]: Without dead ends: 559 [2025-04-13 17:28:38,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:28:38,983 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:38,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:28:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-04-13 17:28:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 461. [2025-04-13 17:28:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 459 states have (on average 2.505446623093682) internal successors, (1150), 460 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1150 transitions. [2025-04-13 17:28:39,069 INFO L79 Accepts]: Start accepts. Automaton has 461 states and 1150 transitions. Word has length 19 [2025-04-13 17:28:39,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:39,069 INFO L485 AbstractCegarLoop]: Abstraction has 461 states and 1150 transitions. [2025-04-13 17:28:39,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:39,069 INFO L278 IsEmpty]: Start isEmpty. Operand 461 states and 1150 transitions. [2025-04-13 17:28:39,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:39,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:39,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:39,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 17:28:39,070 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:39,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -244341025, now seen corresponding path program 22 times [2025-04-13 17:28:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:39,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163745714] [2025-04-13 17:28:39,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:28:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:39,097 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:28:39,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:39,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:28:39,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:40,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163745714] [2025-04-13 17:28:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163745714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188514189] [2025-04-13 17:28:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:40,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:40,251 INFO L87 Difference]: Start difference. First operand 461 states and 1150 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:41,405 INFO L93 Difference]: Finished difference Result 741 states and 1869 transitions. [2025-04-13 17:28:41,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:28:41,405 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:41,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:41,407 INFO L225 Difference]: With dead ends: 741 [2025-04-13 17:28:41,407 INFO L226 Difference]: Without dead ends: 692 [2025-04-13 17:28:41,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:28:41,407 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:41,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:28:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-04-13 17:28:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 487. [2025-04-13 17:28:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 485 states have (on average 2.5216494845360824) internal successors, (1223), 486 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1223 transitions. [2025-04-13 17:28:41,493 INFO L79 Accepts]: Start accepts. Automaton has 487 states and 1223 transitions. Word has length 19 [2025-04-13 17:28:41,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:41,493 INFO L485 AbstractCegarLoop]: Abstraction has 487 states and 1223 transitions. [2025-04-13 17:28:41,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:41,493 INFO L278 IsEmpty]: Start isEmpty. Operand 487 states and 1223 transitions. [2025-04-13 17:28:41,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:41,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:41,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:41,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 17:28:41,494 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:41,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash -70668561, now seen corresponding path program 23 times [2025-04-13 17:28:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:41,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237837499] [2025-04-13 17:28:41,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:28:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:41,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:41,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:41,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:42,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237837499] [2025-04-13 17:28:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237837499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531637088] [2025-04-13 17:28:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:42,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:42,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:42,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:42,785 INFO L87 Difference]: Start difference. First operand 487 states and 1223 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:44,801 INFO L93 Difference]: Finished difference Result 863 states and 2119 transitions. [2025-04-13 17:28:44,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:28:44,802 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:44,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:44,804 INFO L225 Difference]: With dead ends: 863 [2025-04-13 17:28:44,804 INFO L226 Difference]: Without dead ends: 810 [2025-04-13 17:28:44,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:28:44,805 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:44,805 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:28:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-04-13 17:28:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 515. [2025-04-13 17:28:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 513 states have (on average 2.5555555555555554) internal successors, (1311), 514 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1311 transitions. [2025-04-13 17:28:44,892 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1311 transitions. Word has length 19 [2025-04-13 17:28:44,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:44,892 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1311 transitions. [2025-04-13 17:28:44,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:44,892 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1311 transitions. [2025-04-13 17:28:44,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:44,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:44,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:44,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 17:28:44,893 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:44,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -632219845, now seen corresponding path program 23 times [2025-04-13 17:28:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:44,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835811913] [2025-04-13 17:28:44,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:28:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:44,916 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:44,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:44,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:46,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835811913] [2025-04-13 17:28:46,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835811913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:46,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:46,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305162794] [2025-04-13 17:28:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:46,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:46,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:46,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:46,142 INFO L87 Difference]: Start difference. First operand 515 states and 1311 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:47,398 INFO L93 Difference]: Finished difference Result 729 states and 1787 transitions. [2025-04-13 17:28:47,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:28:47,398 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:47,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:47,401 INFO L225 Difference]: With dead ends: 729 [2025-04-13 17:28:47,401 INFO L226 Difference]: Without dead ends: 674 [2025-04-13 17:28:47,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:28:47,401 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:47,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:28:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-04-13 17:28:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 527. [2025-04-13 17:28:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 525 states have (on average 2.558095238095238) internal successors, (1343), 526 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1343 transitions. [2025-04-13 17:28:47,497 INFO L79 Accepts]: Start accepts. Automaton has 527 states and 1343 transitions. Word has length 19 [2025-04-13 17:28:47,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:47,497 INFO L485 AbstractCegarLoop]: Abstraction has 527 states and 1343 transitions. [2025-04-13 17:28:47,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:47,497 INFO L278 IsEmpty]: Start isEmpty. Operand 527 states and 1343 transitions. [2025-04-13 17:28:47,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:47,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:47,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:47,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 17:28:47,498 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:47,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash -942043969, now seen corresponding path program 24 times [2025-04-13 17:28:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:47,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569275743] [2025-04-13 17:28:47,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:47,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:47,550 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:47,550 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:48,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569275743] [2025-04-13 17:28:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569275743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:48,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096489145] [2025-04-13 17:28:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:48,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:48,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:48,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:48,917 INFO L87 Difference]: Start difference. First operand 527 states and 1343 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:49,889 INFO L93 Difference]: Finished difference Result 729 states and 1807 transitions. [2025-04-13 17:28:49,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:28:49,889 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:49,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:49,891 INFO L225 Difference]: With dead ends: 729 [2025-04-13 17:28:49,891 INFO L226 Difference]: Without dead ends: 680 [2025-04-13 17:28:49,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:28:49,892 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:49,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:28:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-04-13 17:28:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 527. [2025-04-13 17:28:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 525 states have (on average 2.5504761904761906) internal successors, (1339), 526 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1339 transitions. [2025-04-13 17:28:49,980 INFO L79 Accepts]: Start accepts. Automaton has 527 states and 1339 transitions. Word has length 19 [2025-04-13 17:28:49,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:49,981 INFO L485 AbstractCegarLoop]: Abstraction has 527 states and 1339 transitions. [2025-04-13 17:28:49,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:49,981 INFO L278 IsEmpty]: Start isEmpty. Operand 527 states and 1339 transitions. [2025-04-13 17:28:49,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:49,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:49,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:49,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 17:28:49,982 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:49,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1471624097, now seen corresponding path program 25 times [2025-04-13 17:28:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:49,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531301435] [2025-04-13 17:28:49,982 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:50,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:50,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:50,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:51,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-04-13 17:28:51,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:51,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531301435] [2025-04-13 17:28:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531301435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:51,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:28:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596850226] [2025-04-13 17:28:51,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:51,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:28:51,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:51,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:28:51,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:28:51,529 INFO L87 Difference]: Start difference. First operand 527 states and 1339 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:52,684 INFO L93 Difference]: Finished difference Result 689 states and 1693 transitions. [2025-04-13 17:28:52,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:28:52,684 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:52,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:52,686 INFO L225 Difference]: With dead ends: 689 [2025-04-13 17:28:52,686 INFO L226 Difference]: Without dead ends: 640 [2025-04-13 17:28:52,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:28:52,687 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:52,687 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-04-13 17:28:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 533. [2025-04-13 17:28:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 531 states have (on average 2.56120527306968) internal successors, (1360), 532 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1360 transitions. [2025-04-13 17:28:52,782 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 1360 transitions. Word has length 19 [2025-04-13 17:28:52,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:52,782 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 1360 transitions. [2025-04-13 17:28:52,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:52,782 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 1360 transitions. [2025-04-13 17:28:52,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:52,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:52,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:52,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 17:28:52,783 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:52,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1329922789, now seen corresponding path program 26 times [2025-04-13 17:28:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:52,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773528512] [2025-04-13 17:28:52,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:28:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:52,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:52,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:52,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:53,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773528512] [2025-04-13 17:28:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773528512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:28:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720384105] [2025-04-13 17:28:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:53,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:28:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:28:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:28:53,929 INFO L87 Difference]: Start difference. First operand 533 states and 1360 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:55,248 INFO L93 Difference]: Finished difference Result 773 states and 1941 transitions. [2025-04-13 17:28:55,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:55,248 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:55,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:55,250 INFO L225 Difference]: With dead ends: 773 [2025-04-13 17:28:55,250 INFO L226 Difference]: Without dead ends: 744 [2025-04-13 17:28:55,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:28:55,250 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:55,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:28:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-04-13 17:28:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 531. [2025-04-13 17:28:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 529 states have (on average 2.55765595463138) internal successors, (1353), 530 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1353 transitions. [2025-04-13 17:28:55,348 INFO L79 Accepts]: Start accepts. Automaton has 531 states and 1353 transitions. Word has length 19 [2025-04-13 17:28:55,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:55,348 INFO L485 AbstractCegarLoop]: Abstraction has 531 states and 1353 transitions. [2025-04-13 17:28:55,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:55,348 INFO L278 IsEmpty]: Start isEmpty. Operand 531 states and 1353 transitions. [2025-04-13 17:28:55,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:55,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:55,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:55,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 17:28:55,349 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:55,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2041391899, now seen corresponding path program 19 times [2025-04-13 17:28:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:55,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095749642] [2025-04-13 17:28:55,349 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:55,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:55,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:55,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:55,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:28:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:56,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095749642] [2025-04-13 17:28:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095749642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:56,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:28:56,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250844009] [2025-04-13 17:28:56,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:56,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:28:56,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:56,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:28:56,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:28:56,826 INFO L87 Difference]: Start difference. First operand 531 states and 1353 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:58,422 INFO L93 Difference]: Finished difference Result 709 states and 1751 transitions. [2025-04-13 17:28:58,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:28:58,422 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:28:58,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:58,424 INFO L225 Difference]: With dead ends: 709 [2025-04-13 17:28:58,424 INFO L226 Difference]: Without dead ends: 660 [2025-04-13 17:28:58,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:28:58,425 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:58,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:28:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-13 17:28:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 537. [2025-04-13 17:28:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 535 states have (on average 2.5570093457943925) internal successors, (1368), 536 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1368 transitions. [2025-04-13 17:28:58,528 INFO L79 Accepts]: Start accepts. Automaton has 537 states and 1368 transitions. Word has length 19 [2025-04-13 17:28:58,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:58,528 INFO L485 AbstractCegarLoop]: Abstraction has 537 states and 1368 transitions. [2025-04-13 17:28:58,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:28:58,529 INFO L278 IsEmpty]: Start isEmpty. Operand 537 states and 1368 transitions. [2025-04-13 17:28:58,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:28:58,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:58,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:58,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 17:28:58,530 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:28:58,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -68884623, now seen corresponding path program 24 times [2025-04-13 17:28:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:58,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5610134] [2025-04-13 17:28:58,530 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:58,553 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:28:58,581 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:28:58,581 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:58,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:00,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5610134] [2025-04-13 17:29:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5610134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:00,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:29:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775774890] [2025-04-13 17:29:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:00,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:29:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:00,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:29:00,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:29:00,244 INFO L87 Difference]: Start difference. First operand 537 states and 1368 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:02,082 INFO L93 Difference]: Finished difference Result 757 states and 1889 transitions. [2025-04-13 17:29:02,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:29:02,083 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:02,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:02,085 INFO L225 Difference]: With dead ends: 757 [2025-04-13 17:29:02,085 INFO L226 Difference]: Without dead ends: 704 [2025-04-13 17:29:02,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:29:02,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:02,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:29:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-04-13 17:29:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 547. [2025-04-13 17:29:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 545 states have (on average 2.5743119266055046) internal successors, (1403), 546 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1403 transitions. [2025-04-13 17:29:02,189 INFO L79 Accepts]: Start accepts. Automaton has 547 states and 1403 transitions. Word has length 19 [2025-04-13 17:29:02,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:02,189 INFO L485 AbstractCegarLoop]: Abstraction has 547 states and 1403 transitions. [2025-04-13 17:29:02,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:02,190 INFO L278 IsEmpty]: Start isEmpty. Operand 547 states and 1403 transitions. [2025-04-13 17:29:02,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:02,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:02,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:02,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 17:29:02,191 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:02,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2058372769, now seen corresponding path program 20 times [2025-04-13 17:29:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:02,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316425061] [2025-04-13 17:29:02,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:29:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:02,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:02,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:02,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:02,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:03,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316425061] [2025-04-13 17:29:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316425061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:03,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:29:03,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461037175] [2025-04-13 17:29:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:03,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:29:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:03,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:29:03,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:29:03,314 INFO L87 Difference]: Start difference. First operand 547 states and 1403 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:04,791 INFO L93 Difference]: Finished difference Result 739 states and 1800 transitions. [2025-04-13 17:29:04,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:29:04,791 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:04,791 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:04,793 INFO L225 Difference]: With dead ends: 739 [2025-04-13 17:29:04,793 INFO L226 Difference]: Without dead ends: 719 [2025-04-13 17:29:04,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:29:04,793 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:04,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:04,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-04-13 17:29:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 543. [2025-04-13 17:29:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 541 states have (on average 2.5711645101663585) internal successors, (1391), 542 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1391 transitions. [2025-04-13 17:29:04,897 INFO L79 Accepts]: Start accepts. Automaton has 543 states and 1391 transitions. Word has length 19 [2025-04-13 17:29:04,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:04,897 INFO L485 AbstractCegarLoop]: Abstraction has 543 states and 1391 transitions. [2025-04-13 17:29:04,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:04,897 INFO L278 IsEmpty]: Start isEmpty. Operand 543 states and 1391 transitions. [2025-04-13 17:29:04,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:04,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:04,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:04,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 17:29:04,898 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:04,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -415219925, now seen corresponding path program 4 times [2025-04-13 17:29:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:04,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439169129] [2025-04-13 17:29:04,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:04,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:29:04,956 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:04,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:04,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:05,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439169129] [2025-04-13 17:29:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439169129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:29:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487319326] [2025-04-13 17:29:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:05,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:29:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:29:05,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:29:05,988 INFO L87 Difference]: Start difference. First operand 543 states and 1391 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:07,828 INFO L93 Difference]: Finished difference Result 832 states and 2137 transitions. [2025-04-13 17:29:07,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:29:07,829 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:07,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:07,831 INFO L225 Difference]: With dead ends: 832 [2025-04-13 17:29:07,831 INFO L226 Difference]: Without dead ends: 787 [2025-04-13 17:29:07,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:29:07,832 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:07,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:29:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-04-13 17:29:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 549. [2025-04-13 17:29:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 547 states have (on average 2.5813528336380256) internal successors, (1412), 548 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1412 transitions. [2025-04-13 17:29:07,951 INFO L79 Accepts]: Start accepts. Automaton has 549 states and 1412 transitions. Word has length 19 [2025-04-13 17:29:07,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:07,952 INFO L485 AbstractCegarLoop]: Abstraction has 549 states and 1412 transitions. [2025-04-13 17:29:07,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:07,952 INFO L278 IsEmpty]: Start isEmpty. Operand 549 states and 1412 transitions. [2025-04-13 17:29:07,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:07,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:07,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:07,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 17:29:07,953 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:07,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 282944811, now seen corresponding path program 25 times [2025-04-13 17:29:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:07,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60778535] [2025-04-13 17:29:07,953 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:29:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:08,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:08,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:09,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:09,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60778535] [2025-04-13 17:29:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60778535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:09,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:29:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414368411] [2025-04-13 17:29:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:09,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:29:09,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:09,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:29:09,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:29:09,410 INFO L87 Difference]: Start difference. First operand 549 states and 1412 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:10,805 INFO L93 Difference]: Finished difference Result 694 states and 1760 transitions. [2025-04-13 17:29:10,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:29:10,805 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:10,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:10,807 INFO L225 Difference]: With dead ends: 694 [2025-04-13 17:29:10,807 INFO L226 Difference]: Without dead ends: 645 [2025-04-13 17:29:10,807 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:29:10,807 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:10,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:29:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-04-13 17:29:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 555. [2025-04-13 17:29:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 2.5840867992766725) internal successors, (1429), 554 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1429 transitions. [2025-04-13 17:29:10,917 INFO L79 Accepts]: Start accepts. Automaton has 555 states and 1429 transitions. Word has length 19 [2025-04-13 17:29:10,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:10,917 INFO L485 AbstractCegarLoop]: Abstraction has 555 states and 1429 transitions. [2025-04-13 17:29:10,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:10,917 INFO L278 IsEmpty]: Start isEmpty. Operand 555 states and 1429 transitions. [2025-04-13 17:29:10,918 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:10,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:10,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 17:29:10,918 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:10,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1303786817, now seen corresponding path program 27 times [2025-04-13 17:29:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:10,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278269017] [2025-04-13 17:29:10,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:29:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:10,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:10,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:10,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:29:10,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:11,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278269017] [2025-04-13 17:29:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278269017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:29:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205420420] [2025-04-13 17:29:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:11,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:29:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:11,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:29:11,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:29:11,482 INFO L87 Difference]: Start difference. First operand 555 states and 1429 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:12,231 INFO L93 Difference]: Finished difference Result 755 states and 1826 transitions. [2025-04-13 17:29:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:29:12,231 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:12,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:12,233 INFO L225 Difference]: With dead ends: 755 [2025-04-13 17:29:12,233 INFO L226 Difference]: Without dead ends: 714 [2025-04-13 17:29:12,234 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:29:12,234 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:12,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:29:12,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-04-13 17:29:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 557. [2025-04-13 17:29:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 2.5513513513513515) internal successors, (1416), 556 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1416 transitions. [2025-04-13 17:29:12,342 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 1416 transitions. Word has length 19 [2025-04-13 17:29:12,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:12,343 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 1416 transitions. [2025-04-13 17:29:12,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:12,343 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 1416 transitions. [2025-04-13 17:29:12,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:12,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:12,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:12,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 17:29:12,344 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:12,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 270864529, now seen corresponding path program 5 times [2025-04-13 17:29:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:12,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166240342] [2025-04-13 17:29:12,344 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:12,366 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:12,388 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:12,388 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:13,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166240342] [2025-04-13 17:29:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166240342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:29:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719759805] [2025-04-13 17:29:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:13,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:29:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:13,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:29:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:29:13,705 INFO L87 Difference]: Start difference. First operand 557 states and 1416 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:15,037 INFO L93 Difference]: Finished difference Result 712 states and 1757 transitions. [2025-04-13 17:29:15,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:29:15,037 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:15,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:15,039 INFO L225 Difference]: With dead ends: 712 [2025-04-13 17:29:15,039 INFO L226 Difference]: Without dead ends: 663 [2025-04-13 17:29:15,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:29:15,040 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:15,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-04-13 17:29:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 553. [2025-04-13 17:29:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 551 states have (on average 2.5517241379310347) internal successors, (1406), 552 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1406 transitions. [2025-04-13 17:29:15,155 INFO L79 Accepts]: Start accepts. Automaton has 553 states and 1406 transitions. Word has length 19 [2025-04-13 17:29:15,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:15,155 INFO L485 AbstractCegarLoop]: Abstraction has 553 states and 1406 transitions. [2025-04-13 17:29:15,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:15,155 INFO L278 IsEmpty]: Start isEmpty. Operand 553 states and 1406 transitions. [2025-04-13 17:29:15,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:15,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:15,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:15,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 17:29:15,156 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:15,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -706382481, now seen corresponding path program 6 times [2025-04-13 17:29:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:15,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214601056] [2025-04-13 17:29:15,156 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:29:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:15,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:15,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:15,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:29:15,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:19,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:19,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214601056] [2025-04-13 17:29:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214601056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:19,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:19,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:29:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706415256] [2025-04-13 17:29:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:19,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:29:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:19,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:29:19,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:29:19,319 INFO L87 Difference]: Start difference. First operand 553 states and 1406 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:24,288 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 17:29:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:32,219 INFO L93 Difference]: Finished difference Result 808 states and 1965 transitions. [2025-04-13 17:29:32,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:32,219 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:32,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:32,221 INFO L225 Difference]: With dead ends: 808 [2025-04-13 17:29:32,221 INFO L226 Difference]: Without dead ends: 785 [2025-04-13 17:29:32,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:29:32,222 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:32,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1044 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-04-13 17:29:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-04-13 17:29:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 557. [2025-04-13 17:29:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 2.554954954954955) internal successors, (1418), 556 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1418 transitions. [2025-04-13 17:29:32,360 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 1418 transitions. Word has length 19 [2025-04-13 17:29:32,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:32,360 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 1418 transitions. [2025-04-13 17:29:32,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:32,361 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 1418 transitions. [2025-04-13 17:29:32,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:32,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:32,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:32,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 17:29:32,361 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:32,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1516298927, now seen corresponding path program 26 times [2025-04-13 17:29:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:32,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702259803] [2025-04-13 17:29:32,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:29:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:32,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:32,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:32,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:33,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702259803] [2025-04-13 17:29:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702259803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:29:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539757854] [2025-04-13 17:29:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:33,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:29:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:33,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:29:33,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:29:33,125 INFO L87 Difference]: Start difference. First operand 557 states and 1418 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:35,245 INFO L93 Difference]: Finished difference Result 818 states and 1946 transitions. [2025-04-13 17:29:35,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:29:35,246 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:35,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:35,248 INFO L225 Difference]: With dead ends: 818 [2025-04-13 17:29:35,248 INFO L226 Difference]: Without dead ends: 780 [2025-04-13 17:29:35,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:29:35,249 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:35,249 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-04-13 17:29:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 557. [2025-04-13 17:29:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 555 states have (on average 2.5297297297297296) internal successors, (1404), 556 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1404 transitions. [2025-04-13 17:29:35,374 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 1404 transitions. Word has length 19 [2025-04-13 17:29:35,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:35,374 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 1404 transitions. [2025-04-13 17:29:35,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:35,374 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 1404 transitions. [2025-04-13 17:29:35,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:35,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:35,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:35,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 17:29:35,375 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:35,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1980090179, now seen corresponding path program 28 times [2025-04-13 17:29:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:35,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563160269] [2025-04-13 17:29:35,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:35,399 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:29:35,423 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:35,423 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:35,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:36,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563160269] [2025-04-13 17:29:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563160269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:29:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277011026] [2025-04-13 17:29:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:36,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:29:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:29:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:29:36,517 INFO L87 Difference]: Start difference. First operand 557 states and 1404 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:38,160 INFO L93 Difference]: Finished difference Result 799 states and 1970 transitions. [2025-04-13 17:29:38,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:29:38,160 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:38,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:38,162 INFO L225 Difference]: With dead ends: 799 [2025-04-13 17:29:38,162 INFO L226 Difference]: Without dead ends: 746 [2025-04-13 17:29:38,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:29:38,163 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:38,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:29:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-04-13 17:29:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 563. [2025-04-13 17:29:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 561 states have (on average 2.536541889483066) internal successors, (1423), 562 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1423 transitions. [2025-04-13 17:29:38,295 INFO L79 Accepts]: Start accepts. Automaton has 563 states and 1423 transitions. Word has length 19 [2025-04-13 17:29:38,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:38,296 INFO L485 AbstractCegarLoop]: Abstraction has 563 states and 1423 transitions. [2025-04-13 17:29:38,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:38,296 INFO L278 IsEmpty]: Start isEmpty. Operand 563 states and 1423 transitions. [2025-04-13 17:29:38,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:38,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:38,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:38,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 17:29:38,297 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:38,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1684631903, now seen corresponding path program 21 times [2025-04-13 17:29:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:38,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929825933] [2025-04-13 17:29:38,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:29:38,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:38,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:38,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:38,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:29:38,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:40,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-04-13 17:29:40,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:40,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929825933] [2025-04-13 17:29:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929825933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720585510] [2025-04-13 17:29:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:40,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:29:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:29:40,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:29:40,716 INFO L87 Difference]: Start difference. First operand 563 states and 1423 transitions. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:44,736 INFO L93 Difference]: Finished difference Result 804 states and 1985 transitions. [2025-04-13 17:29:44,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:29:44,737 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:44,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:44,739 INFO L225 Difference]: With dead ends: 804 [2025-04-13 17:29:44,739 INFO L226 Difference]: Without dead ends: 784 [2025-04-13 17:29:44,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:29:44,740 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:44,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 17:29:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-04-13 17:29:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 549. [2025-04-13 17:29:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 547 states have (on average 2.541133455210238) internal successors, (1390), 548 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1390 transitions. [2025-04-13 17:29:44,881 INFO L79 Accepts]: Start accepts. Automaton has 549 states and 1390 transitions. Word has length 19 [2025-04-13 17:29:44,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:44,881 INFO L485 AbstractCegarLoop]: Abstraction has 549 states and 1390 transitions. [2025-04-13 17:29:44,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:44,881 INFO L278 IsEmpty]: Start isEmpty. Operand 549 states and 1390 transitions. [2025-04-13 17:29:44,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:44,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:44,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:44,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 17:29:44,882 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:44,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1410784169, now seen corresponding path program 29 times [2025-04-13 17:29:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:44,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179003359] [2025-04-13 17:29:44,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:44,905 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:44,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:44,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:44,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:45,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179003359] [2025-04-13 17:29:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179003359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:45,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:29:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462995411] [2025-04-13 17:29:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:45,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:29:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:45,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:29:45,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:29:45,917 INFO L87 Difference]: Start difference. First operand 549 states and 1390 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:47,141 INFO L93 Difference]: Finished difference Result 823 states and 2060 transitions. [2025-04-13 17:29:47,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:29:47,142 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:47,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:47,144 INFO L225 Difference]: With dead ends: 823 [2025-04-13 17:29:47,144 INFO L226 Difference]: Without dead ends: 774 [2025-04-13 17:29:47,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:29:47,144 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:47,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:29:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-04-13 17:29:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 551. [2025-04-13 17:29:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 549 states have (on average 2.540983606557377) internal successors, (1395), 550 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1395 transitions. [2025-04-13 17:29:47,291 INFO L79 Accepts]: Start accepts. Automaton has 551 states and 1395 transitions. Word has length 19 [2025-04-13 17:29:47,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:47,291 INFO L485 AbstractCegarLoop]: Abstraction has 551 states and 1395 transitions. [2025-04-13 17:29:47,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:47,291 INFO L278 IsEmpty]: Start isEmpty. Operand 551 states and 1395 transitions. [2025-04-13 17:29:47,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:47,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:47,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:47,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 17:29:47,292 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:47,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1653211825, now seen corresponding path program 27 times [2025-04-13 17:29:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:47,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594651682] [2025-04-13 17:29:47,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:29:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:47,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:47,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:47,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:29:47,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:48,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594651682] [2025-04-13 17:29:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594651682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:29:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552454267] [2025-04-13 17:29:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:48,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:29:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:48,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:29:48,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:29:48,963 INFO L87 Difference]: Start difference. First operand 551 states and 1395 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:50,331 INFO L93 Difference]: Finished difference Result 753 states and 1839 transitions. [2025-04-13 17:29:50,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:29:50,331 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:50,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:50,334 INFO L225 Difference]: With dead ends: 753 [2025-04-13 17:29:50,334 INFO L226 Difference]: Without dead ends: 704 [2025-04-13 17:29:50,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:29:50,335 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:50,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-04-13 17:29:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 563. [2025-04-13 17:29:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 561 states have (on average 2.522281639928699) internal successors, (1415), 562 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1415 transitions. [2025-04-13 17:29:50,473 INFO L79 Accepts]: Start accepts. Automaton has 563 states and 1415 transitions. Word has length 19 [2025-04-13 17:29:50,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:50,473 INFO L485 AbstractCegarLoop]: Abstraction has 563 states and 1415 transitions. [2025-04-13 17:29:50,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:50,473 INFO L278 IsEmpty]: Start isEmpty. Operand 563 states and 1415 transitions. [2025-04-13 17:29:50,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:50,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:50,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:50,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 17:29:50,474 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:50,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1393341507, now seen corresponding path program 22 times [2025-04-13 17:29:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:50,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701547206] [2025-04-13 17:29:50,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:50,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:29:50,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:50,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:50,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:51,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701547206] [2025-04-13 17:29:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701547206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:29:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62618845] [2025-04-13 17:29:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:51,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:29:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:51,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:29:51,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:29:51,802 INFO L87 Difference]: Start difference. First operand 563 states and 1415 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:53,064 INFO L93 Difference]: Finished difference Result 776 states and 1907 transitions. [2025-04-13 17:29:53,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:29:53,064 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:53,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:53,066 INFO L225 Difference]: With dead ends: 776 [2025-04-13 17:29:53,066 INFO L226 Difference]: Without dead ends: 756 [2025-04-13 17:29:53,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:29:53,067 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:53,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:29:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-04-13 17:29:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 559. [2025-04-13 17:29:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 557 states have (on average 2.5224416517055657) internal successors, (1405), 558 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1405 transitions. [2025-04-13 17:29:53,210 INFO L79 Accepts]: Start accepts. Automaton has 559 states and 1405 transitions. Word has length 19 [2025-04-13 17:29:53,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:53,210 INFO L485 AbstractCegarLoop]: Abstraction has 559 states and 1405 transitions. [2025-04-13 17:29:53,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:53,210 INFO L278 IsEmpty]: Start isEmpty. Operand 559 states and 1405 transitions. [2025-04-13 17:29:53,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:53,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:53,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:53,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 17:29:53,211 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:53,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1154510485, now seen corresponding path program 28 times [2025-04-13 17:29:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:53,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725296876] [2025-04-13 17:29:53,212 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:53,235 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:29:53,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:53,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:53,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725296876] [2025-04-13 17:29:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725296876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:29:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243172622] [2025-04-13 17:29:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:53,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:29:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:53,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:29:53,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:29:53,994 INFO L87 Difference]: Start difference. First operand 559 states and 1405 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:55,196 INFO L93 Difference]: Finished difference Result 731 states and 1772 transitions. [2025-04-13 17:29:55,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:29:55,196 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:55,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:55,198 INFO L225 Difference]: With dead ends: 731 [2025-04-13 17:29:55,198 INFO L226 Difference]: Without dead ends: 668 [2025-04-13 17:29:55,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:29:55,199 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:55,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-04-13 17:29:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 539. [2025-04-13 17:29:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 537 states have (on average 2.541899441340782) internal successors, (1365), 538 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1365 transitions. [2025-04-13 17:29:55,330 INFO L79 Accepts]: Start accepts. Automaton has 539 states and 1365 transitions. Word has length 19 [2025-04-13 17:29:55,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:55,330 INFO L485 AbstractCegarLoop]: Abstraction has 539 states and 1365 transitions. [2025-04-13 17:29:55,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:55,330 INFO L278 IsEmpty]: Start isEmpty. Operand 539 states and 1365 transitions. [2025-04-13 17:29:55,331 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:55,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:55,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:55,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 17:29:55,331 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:55,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1833791961, now seen corresponding path program 23 times [2025-04-13 17:29:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:55,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137629353] [2025-04-13 17:29:55,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:55,354 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:55,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:55,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:55,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:57,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137629353] [2025-04-13 17:29:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137629353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:29:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061454056] [2025-04-13 17:29:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:57,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:29:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:57,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:29:57,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:29:57,096 INFO L87 Difference]: Start difference. First operand 539 states and 1365 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:58,596 INFO L93 Difference]: Finished difference Result 770 states and 1914 transitions. [2025-04-13 17:29:58,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:29:58,596 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:29:58,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:58,598 INFO L225 Difference]: With dead ends: 770 [2025-04-13 17:29:58,598 INFO L226 Difference]: Without dead ends: 750 [2025-04-13 17:29:58,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:29:58,599 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:58,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:29:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-04-13 17:29:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 533. [2025-04-13 17:29:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 531 states have (on average 2.5386064030131825) internal successors, (1348), 532 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1348 transitions. [2025-04-13 17:29:58,732 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 1348 transitions. Word has length 19 [2025-04-13 17:29:58,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:58,732 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 1348 transitions. [2025-04-13 17:29:58,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:58,732 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 1348 transitions. [2025-04-13 17:29:58,733 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:29:58,733 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:58,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:58,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 17:29:58,733 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:29:58,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1740007189, now seen corresponding path program 29 times [2025-04-13 17:29:58,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:58,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095884184] [2025-04-13 17:29:58,733 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:58,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:29:58,774 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:29:58,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:58,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:29:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:59,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095884184] [2025-04-13 17:29:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095884184] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:29:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218286332] [2025-04-13 17:29:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:59,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:29:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:29:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:29:59,697 INFO L87 Difference]: Start difference. First operand 533 states and 1348 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:01,015 INFO L93 Difference]: Finished difference Result 745 states and 1815 transitions. [2025-04-13 17:30:01,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:30:01,015 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:01,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:01,017 INFO L225 Difference]: With dead ends: 745 [2025-04-13 17:30:01,017 INFO L226 Difference]: Without dead ends: 719 [2025-04-13 17:30:01,017 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:30:01,018 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:01,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:30:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-04-13 17:30:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 535. [2025-04-13 17:30:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 533 states have (on average 2.5422138836772983) internal successors, (1355), 534 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1355 transitions. [2025-04-13 17:30:01,148 INFO L79 Accepts]: Start accepts. Automaton has 535 states and 1355 transitions. Word has length 19 [2025-04-13 17:30:01,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:01,148 INFO L485 AbstractCegarLoop]: Abstraction has 535 states and 1355 transitions. [2025-04-13 17:30:01,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:01,148 INFO L278 IsEmpty]: Start isEmpty. Operand 535 states and 1355 transitions. [2025-04-13 17:30:01,149 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:01,149 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:01,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:01,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 17:30:01,149 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:01,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1038775935, now seen corresponding path program 30 times [2025-04-13 17:30:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:01,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088066640] [2025-04-13 17:30:01,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:30:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:01,172 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:01,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:01,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:30:01,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:03,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088066640] [2025-04-13 17:30:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088066640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014644131] [2025-04-13 17:30:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:03,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:03,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:03,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:03,315 INFO L87 Difference]: Start difference. First operand 535 states and 1355 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:05,152 INFO L93 Difference]: Finished difference Result 781 states and 1905 transitions. [2025-04-13 17:30:05,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:30:05,153 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:05,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:05,155 INFO L225 Difference]: With dead ends: 781 [2025-04-13 17:30:05,155 INFO L226 Difference]: Without dead ends: 728 [2025-04-13 17:30:05,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:05,156 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:05,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:30:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-04-13 17:30:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 541. [2025-04-13 17:30:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 539 states have (on average 2.5528756957328387) internal successors, (1376), 540 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1376 transitions. [2025-04-13 17:30:05,312 INFO L79 Accepts]: Start accepts. Automaton has 541 states and 1376 transitions. Word has length 19 [2025-04-13 17:30:05,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:05,312 INFO L485 AbstractCegarLoop]: Abstraction has 541 states and 1376 transitions. [2025-04-13 17:30:05,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:05,312 INFO L278 IsEmpty]: Start isEmpty. Operand 541 states and 1376 transitions. [2025-04-13 17:30:05,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:05,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:05,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:05,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 17:30:05,313 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:05,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1699298405, now seen corresponding path program 31 times [2025-04-13 17:30:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:05,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354679040] [2025-04-13 17:30:05,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:05,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:05,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:05,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:06,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354679040] [2025-04-13 17:30:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354679040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:06,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:30:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502166064] [2025-04-13 17:30:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:06,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:06,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:06,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:06,434 INFO L87 Difference]: Start difference. First operand 541 states and 1376 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:07,417 INFO L93 Difference]: Finished difference Result 715 states and 1740 transitions. [2025-04-13 17:30:07,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:30:07,417 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:07,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:07,420 INFO L225 Difference]: With dead ends: 715 [2025-04-13 17:30:07,420 INFO L226 Difference]: Without dead ends: 666 [2025-04-13 17:30:07,420 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:30:07,421 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:07,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:30:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-04-13 17:30:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 519. [2025-04-13 17:30:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 517 states have (on average 2.5357833655705995) internal successors, (1311), 518 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1311 transitions. [2025-04-13 17:30:07,557 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1311 transitions. Word has length 19 [2025-04-13 17:30:07,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:07,558 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1311 transitions. [2025-04-13 17:30:07,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:07,558 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1311 transitions. [2025-04-13 17:30:07,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:07,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:07,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:07,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 17:30:07,559 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:07,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash 624650305, now seen corresponding path program 24 times [2025-04-13 17:30:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:07,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158716110] [2025-04-13 17:30:07,559 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:30:07,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:07,592 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:07,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:07,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:30:07,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:08,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158716110] [2025-04-13 17:30:08,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158716110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:08,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:08,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742297733] [2025-04-13 17:30:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:08,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:08,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:08,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:08,923 INFO L87 Difference]: Start difference. First operand 519 states and 1311 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:10,471 INFO L93 Difference]: Finished difference Result 743 states and 1804 transitions. [2025-04-13 17:30:10,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:10,471 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:10,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:10,474 INFO L225 Difference]: With dead ends: 743 [2025-04-13 17:30:10,474 INFO L226 Difference]: Without dead ends: 723 [2025-04-13 17:30:10,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:10,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:10,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:30:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-04-13 17:30:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 513. [2025-04-13 17:30:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 511 states have (on average 2.524461839530333) internal successors, (1290), 512 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1290 transitions. [2025-04-13 17:30:10,605 INFO L79 Accepts]: Start accepts. Automaton has 513 states and 1290 transitions. Word has length 19 [2025-04-13 17:30:10,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:10,605 INFO L485 AbstractCegarLoop]: Abstraction has 513 states and 1290 transitions. [2025-04-13 17:30:10,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:10,605 INFO L278 IsEmpty]: Start isEmpty. Operand 513 states and 1290 transitions. [2025-04-13 17:30:10,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:10,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:10,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:10,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 17:30:10,606 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:10,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash -240168921, now seen corresponding path program 30 times [2025-04-13 17:30:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:10,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885605400] [2025-04-13 17:30:10,607 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:30:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:10,630 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:10,663 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:10,663 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:30:10,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:11,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885605400] [2025-04-13 17:30:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885605400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903973394] [2025-04-13 17:30:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:11,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:11,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:11,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:11,829 INFO L87 Difference]: Start difference. First operand 513 states and 1290 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:13,379 INFO L93 Difference]: Finished difference Result 730 states and 1828 transitions. [2025-04-13 17:30:13,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:30:13,380 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:13,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:13,382 INFO L225 Difference]: With dead ends: 730 [2025-04-13 17:30:13,382 INFO L226 Difference]: Without dead ends: 681 [2025-04-13 17:30:13,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:13,382 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:13,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:30:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-04-13 17:30:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 533. [2025-04-13 17:30:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 531 states have (on average 2.553672316384181) internal successors, (1356), 532 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1356 transitions. [2025-04-13 17:30:13,541 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 1356 transitions. Word has length 19 [2025-04-13 17:30:13,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:13,541 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 1356 transitions. [2025-04-13 17:30:13,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:13,541 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 1356 transitions. [2025-04-13 17:30:13,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:13,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:13,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:13,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 17:30:13,542 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:13,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash -252249203, now seen corresponding path program 7 times [2025-04-13 17:30:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:13,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806956005] [2025-04-13 17:30:13,542 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:13,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:13,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:13,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:14,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806956005] [2025-04-13 17:30:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806956005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:14,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985810314] [2025-04-13 17:30:14,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:14,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:14,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:14,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:14,875 INFO L87 Difference]: Start difference. First operand 533 states and 1356 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:16,976 INFO L93 Difference]: Finished difference Result 744 states and 1841 transitions. [2025-04-13 17:30:16,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:30:16,977 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:16,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:16,979 INFO L225 Difference]: With dead ends: 744 [2025-04-13 17:30:16,979 INFO L226 Difference]: Without dead ends: 695 [2025-04-13 17:30:16,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:30:16,979 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:16,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:30:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-04-13 17:30:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 529. [2025-04-13 17:30:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 527 states have (on average 2.5464895635673623) internal successors, (1342), 528 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1342 transitions. [2025-04-13 17:30:17,128 INFO L79 Accepts]: Start accepts. Automaton has 529 states and 1342 transitions. Word has length 19 [2025-04-13 17:30:17,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:17,128 INFO L485 AbstractCegarLoop]: Abstraction has 529 states and 1342 transitions. [2025-04-13 17:30:17,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:17,128 INFO L278 IsEmpty]: Start isEmpty. Operand 529 states and 1342 transitions. [2025-04-13 17:30:17,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:17,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:17,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:17,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 17:30:17,129 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:17,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1109934441, now seen corresponding path program 8 times [2025-04-13 17:30:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:17,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144508327] [2025-04-13 17:30:17,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:17,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:17,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:17,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:17,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:18,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144508327] [2025-04-13 17:30:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144508327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395461672] [2025-04-13 17:30:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:18,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:18,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:18,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:18,456 INFO L87 Difference]: Start difference. First operand 529 states and 1342 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:20,146 INFO L93 Difference]: Finished difference Result 726 states and 1786 transitions. [2025-04-13 17:30:20,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:30:20,146 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:20,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:20,148 INFO L225 Difference]: With dead ends: 726 [2025-04-13 17:30:20,148 INFO L226 Difference]: Without dead ends: 677 [2025-04-13 17:30:20,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:20,149 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:20,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:30:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-04-13 17:30:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 491. [2025-04-13 17:30:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 489 states have (on average 2.492842535787321) internal successors, (1219), 490 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1219 transitions. [2025-04-13 17:30:20,257 INFO L79 Accepts]: Start accepts. Automaton has 491 states and 1219 transitions. Word has length 19 [2025-04-13 17:30:20,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:20,257 INFO L485 AbstractCegarLoop]: Abstraction has 491 states and 1219 transitions. [2025-04-13 17:30:20,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:20,257 INFO L278 IsEmpty]: Start isEmpty. Operand 491 states and 1219 transitions. [2025-04-13 17:30:20,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:20,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:20,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:20,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 17:30:20,258 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:20,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -570414309, now seen corresponding path program 32 times [2025-04-13 17:30:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:20,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688980598] [2025-04-13 17:30:20,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:20,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:20,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:20,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:20,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:21,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:21,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688980598] [2025-04-13 17:30:21,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688980598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:21,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:21,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:30:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126513794] [2025-04-13 17:30:21,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:21,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:21,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:21,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:21,135 INFO L87 Difference]: Start difference. First operand 491 states and 1219 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:22,463 INFO L93 Difference]: Finished difference Result 705 states and 1671 transitions. [2025-04-13 17:30:22,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:30:22,464 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:22,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:22,466 INFO L225 Difference]: With dead ends: 705 [2025-04-13 17:30:22,466 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 17:30:22,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:30:22,466 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:22,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:30:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 17:30:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 493. [2025-04-13 17:30:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 491 states have (on average 2.488798370672098) internal successors, (1222), 492 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1222 transitions. [2025-04-13 17:30:22,587 INFO L79 Accepts]: Start accepts. Automaton has 493 states and 1222 transitions. Word has length 19 [2025-04-13 17:30:22,587 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:22,587 INFO L485 AbstractCegarLoop]: Abstraction has 493 states and 1222 transitions. [2025-04-13 17:30:22,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:22,587 INFO L278 IsEmpty]: Start isEmpty. Operand 493 states and 1222 transitions. [2025-04-13 17:30:22,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:22,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:22,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:22,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 17:30:22,588 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:22,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash 895674651, now seen corresponding path program 33 times [2025-04-13 17:30:22,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:22,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211893873] [2025-04-13 17:30:22,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:30:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:22,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:22,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:22,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:30:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:24,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:24,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211893873] [2025-04-13 17:30:24,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211893873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:24,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:30:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887969246] [2025-04-13 17:30:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:24,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:24,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:24,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:24,010 INFO L87 Difference]: Start difference. First operand 493 states and 1222 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:25,684 INFO L93 Difference]: Finished difference Result 644 states and 1581 transitions. [2025-04-13 17:30:25,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:30:25,685 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:25,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:25,687 INFO L225 Difference]: With dead ends: 644 [2025-04-13 17:30:25,687 INFO L226 Difference]: Without dead ends: 595 [2025-04-13 17:30:25,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:30:25,687 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:25,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:30:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-04-13 17:30:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 507. [2025-04-13 17:30:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 2.497029702970297) internal successors, (1261), 506 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1261 transitions. [2025-04-13 17:30:25,803 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1261 transitions. Word has length 19 [2025-04-13 17:30:25,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:25,803 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1261 transitions. [2025-04-13 17:30:25,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:25,803 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1261 transitions. [2025-04-13 17:30:25,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:25,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:25,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:25,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 17:30:25,804 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:25,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1640255863, now seen corresponding path program 34 times [2025-04-13 17:30:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:25,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982849285] [2025-04-13 17:30:25,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:30:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:25,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:30:25,850 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:25,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:30:25,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:26,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:26,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982849285] [2025-04-13 17:30:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982849285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:30:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947541729] [2025-04-13 17:30:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:26,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:30:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:26,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:30:26,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:30:26,916 INFO L87 Difference]: Start difference. First operand 507 states and 1261 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:28,364 INFO L93 Difference]: Finished difference Result 745 states and 1781 transitions. [2025-04-13 17:30:28,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:28,364 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:28,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:28,366 INFO L225 Difference]: With dead ends: 745 [2025-04-13 17:30:28,366 INFO L226 Difference]: Without dead ends: 716 [2025-04-13 17:30:28,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:30:28,367 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:28,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:30:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-04-13 17:30:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 507. [2025-04-13 17:30:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 505 states have (on average 2.493069306930693) internal successors, (1259), 506 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1259 transitions. [2025-04-13 17:30:28,492 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1259 transitions. Word has length 19 [2025-04-13 17:30:28,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:28,492 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1259 transitions. [2025-04-13 17:30:28,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:28,492 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1259 transitions. [2025-04-13 17:30:28,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:28,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:28,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 17:30:28,493 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:28,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 507795831, now seen corresponding path program 35 times [2025-04-13 17:30:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:28,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058309045] [2025-04-13 17:30:28,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:30:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:28,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:28,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:28,541 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:28,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:30,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058309045] [2025-04-13 17:30:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058309045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133961432] [2025-04-13 17:30:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:30,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:30,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:30,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:30,173 INFO L87 Difference]: Start difference. First operand 507 states and 1259 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:31,793 INFO L93 Difference]: Finished difference Result 692 states and 1685 transitions. [2025-04-13 17:30:31,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:31,793 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:31,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:31,795 INFO L225 Difference]: With dead ends: 692 [2025-04-13 17:30:31,795 INFO L226 Difference]: Without dead ends: 631 [2025-04-13 17:30:31,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:31,796 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:31,796 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:30:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-04-13 17:30:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 497. [2025-04-13 17:30:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 495 states have (on average 2.492929292929293) internal successors, (1234), 496 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1234 transitions. [2025-04-13 17:30:31,920 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1234 transitions. Word has length 19 [2025-04-13 17:30:31,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:31,920 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1234 transitions. [2025-04-13 17:30:31,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:31,920 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1234 transitions. [2025-04-13 17:30:31,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:31,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:31,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:31,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 17:30:31,921 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:31,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2137890909, now seen corresponding path program 31 times [2025-04-13 17:30:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:31,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994991824] [2025-04-13 17:30:31,921 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:31,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:31,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:31,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:31,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:33,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:33,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994991824] [2025-04-13 17:30:33,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994991824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:33,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:33,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:33,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671267748] [2025-04-13 17:30:33,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:33,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:33,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:33,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:33,029 INFO L87 Difference]: Start difference. First operand 497 states and 1234 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:34,222 INFO L93 Difference]: Finished difference Result 657 states and 1597 transitions. [2025-04-13 17:30:34,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:30:34,222 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:34,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:34,225 INFO L225 Difference]: With dead ends: 657 [2025-04-13 17:30:34,225 INFO L226 Difference]: Without dead ends: 604 [2025-04-13 17:30:34,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:30:34,225 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:34,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 10 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:30:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-04-13 17:30:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 479. [2025-04-13 17:30:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 477 states have (on average 2.4842767295597485) internal successors, (1185), 478 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1185 transitions. [2025-04-13 17:30:34,346 INFO L79 Accepts]: Start accepts. Automaton has 479 states and 1185 transitions. Word has length 19 [2025-04-13 17:30:34,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:34,346 INFO L485 AbstractCegarLoop]: Abstraction has 479 states and 1185 transitions. [2025-04-13 17:30:34,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:34,346 INFO L278 IsEmpty]: Start isEmpty. Operand 479 states and 1185 transitions. [2025-04-13 17:30:34,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:34,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:34,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:34,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 17:30:34,347 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:34,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash -717119209, now seen corresponding path program 25 times [2025-04-13 17:30:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:34,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510272703] [2025-04-13 17:30:34,347 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:34,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:34,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:34,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:35,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:35,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510272703] [2025-04-13 17:30:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510272703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:35,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:35,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:30:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397200892] [2025-04-13 17:30:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:35,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:35,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:35,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:35,868 INFO L87 Difference]: Start difference. First operand 479 states and 1185 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:37,430 INFO L93 Difference]: Finished difference Result 749 states and 1777 transitions. [2025-04-13 17:30:37,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:30:37,430 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:37,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:37,433 INFO L225 Difference]: With dead ends: 749 [2025-04-13 17:30:37,433 INFO L226 Difference]: Without dead ends: 704 [2025-04-13 17:30:37,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:30:37,433 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:37,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:30:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-04-13 17:30:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 477. [2025-04-13 17:30:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 475 states have (on average 2.48) internal successors, (1178), 476 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1178 transitions. [2025-04-13 17:30:37,558 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 1178 transitions. Word has length 19 [2025-04-13 17:30:37,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:37,558 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 1178 transitions. [2025-04-13 17:30:37,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:37,559 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 1178 transitions. [2025-04-13 17:30:37,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:37,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:37,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:37,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 17:30:37,559 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:37,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1895202953, now seen corresponding path program 36 times [2025-04-13 17:30:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:37,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161209343] [2025-04-13 17:30:37,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:30:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:37,583 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:37,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:37,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:30:37,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:38,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161209343] [2025-04-13 17:30:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161209343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:38,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:38,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115748553] [2025-04-13 17:30:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:38,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:30:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:38,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:30:38,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:30:38,660 INFO L87 Difference]: Start difference. First operand 477 states and 1178 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:39,902 INFO L93 Difference]: Finished difference Result 608 states and 1461 transitions. [2025-04-13 17:30:39,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:30:39,902 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:39,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:39,904 INFO L225 Difference]: With dead ends: 608 [2025-04-13 17:30:39,904 INFO L226 Difference]: Without dead ends: 559 [2025-04-13 17:30:39,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:30:39,905 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:39,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 18 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:30:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-04-13 17:30:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 475. [2025-04-13 17:30:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 2.4841437632135306) internal successors, (1175), 474 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1175 transitions. [2025-04-13 17:30:40,025 INFO L79 Accepts]: Start accepts. Automaton has 475 states and 1175 transitions. Word has length 19 [2025-04-13 17:30:40,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:40,025 INFO L485 AbstractCegarLoop]: Abstraction has 475 states and 1175 transitions. [2025-04-13 17:30:40,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:40,025 INFO L278 IsEmpty]: Start isEmpty. Operand 475 states and 1175 transitions. [2025-04-13 17:30:40,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:40,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:40,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:40,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 17:30:40,026 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:40,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2011885523, now seen corresponding path program 37 times [2025-04-13 17:30:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:40,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390789481] [2025-04-13 17:30:40,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:40,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:40,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:40,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:40,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:41,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390789481] [2025-04-13 17:30:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390789481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:41,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:41,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42268134] [2025-04-13 17:30:41,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:41,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:41,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:41,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:41,775 INFO L87 Difference]: Start difference. First operand 475 states and 1175 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:43,932 INFO L93 Difference]: Finished difference Result 602 states and 1456 transitions. [2025-04-13 17:30:43,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:43,933 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:43,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:43,935 INFO L225 Difference]: With dead ends: 602 [2025-04-13 17:30:43,935 INFO L226 Difference]: Without dead ends: 575 [2025-04-13 17:30:43,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:30:43,936 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:43,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:30:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-04-13 17:30:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 469. [2025-04-13 17:30:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 467 states have (on average 2.4796573875803) internal successors, (1158), 468 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1158 transitions. [2025-04-13 17:30:44,067 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1158 transitions. Word has length 19 [2025-04-13 17:30:44,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:44,067 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1158 transitions. [2025-04-13 17:30:44,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:44,068 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1158 transitions. [2025-04-13 17:30:44,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:44,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:44,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:44,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 17:30:44,068 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:44,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -390600423, now seen corresponding path program 38 times [2025-04-13 17:30:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:44,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989208524] [2025-04-13 17:30:44,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:44,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:44,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:44,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:44,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:45,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:45,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989208524] [2025-04-13 17:30:45,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989208524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:45,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:45,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004848611] [2025-04-13 17:30:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:45,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:45,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:45,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:45,709 INFO L87 Difference]: Start difference. First operand 469 states and 1158 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:47,708 INFO L93 Difference]: Finished difference Result 616 states and 1475 transitions. [2025-04-13 17:30:47,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:30:47,709 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:47,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:47,711 INFO L225 Difference]: With dead ends: 616 [2025-04-13 17:30:47,711 INFO L226 Difference]: Without dead ends: 557 [2025-04-13 17:30:47,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:30:47,711 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:47,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 17:30:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-04-13 17:30:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 443. [2025-04-13 17:30:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 441 states have (on average 2.492063492063492) internal successors, (1099), 442 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1099 transitions. [2025-04-13 17:30:47,845 INFO L79 Accepts]: Start accepts. Automaton has 443 states and 1099 transitions. Word has length 19 [2025-04-13 17:30:47,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:47,845 INFO L485 AbstractCegarLoop]: Abstraction has 443 states and 1099 transitions. [2025-04-13 17:30:47,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:47,845 INFO L278 IsEmpty]: Start isEmpty. Operand 443 states and 1099 transitions. [2025-04-13 17:30:47,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:47,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:47,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:47,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 17:30:47,846 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:47,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash 480227933, now seen corresponding path program 26 times [2025-04-13 17:30:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:47,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859457615] [2025-04-13 17:30:47,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:47,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:47,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:47,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:49,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859457615] [2025-04-13 17:30:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859457615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:30:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954324372] [2025-04-13 17:30:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:49,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:30:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:49,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:30:49,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:30:49,652 INFO L87 Difference]: Start difference. First operand 443 states and 1099 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:52,171 INFO L93 Difference]: Finished difference Result 573 states and 1385 transitions. [2025-04-13 17:30:52,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:52,172 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:52,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:52,174 INFO L225 Difference]: With dead ends: 573 [2025-04-13 17:30:52,174 INFO L226 Difference]: Without dead ends: 524 [2025-04-13 17:30:52,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:52,174 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:52,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:30:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-04-13 17:30:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 427. [2025-04-13 17:30:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 425 states have (on average 2.458823529411765) internal successors, (1045), 426 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1045 transitions. [2025-04-13 17:30:52,291 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 1045 transitions. Word has length 19 [2025-04-13 17:30:52,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:52,291 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 1045 transitions. [2025-04-13 17:30:52,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:52,291 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 1045 transitions. [2025-04-13 17:30:52,291 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:52,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:52,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 17:30:52,292 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:52,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 198921753, now seen corresponding path program 39 times [2025-04-13 17:30:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:52,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878425202] [2025-04-13 17:30:52,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:30:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:52,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:52,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:52,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:30:52,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:53,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878425202] [2025-04-13 17:30:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878425202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806824524] [2025-04-13 17:30:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:53,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:53,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:53,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:53,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:53,800 INFO L87 Difference]: Start difference. First operand 427 states and 1045 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:55,818 INFO L93 Difference]: Finished difference Result 538 states and 1296 transitions. [2025-04-13 17:30:55,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:30:55,818 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:30:55,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:55,820 INFO L225 Difference]: With dead ends: 538 [2025-04-13 17:30:55,820 INFO L226 Difference]: Without dead ends: 485 [2025-04-13 17:30:55,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:30:55,821 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:55,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:30:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-13 17:30:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 425. [2025-04-13 17:30:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 423 states have (on average 2.4491725768321513) internal successors, (1036), 424 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1036 transitions. [2025-04-13 17:30:55,932 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1036 transitions. Word has length 19 [2025-04-13 17:30:55,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:55,932 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1036 transitions. [2025-04-13 17:30:55,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:55,932 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1036 transitions. [2025-04-13 17:30:55,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:30:55,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:55,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:55,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 17:30:55,933 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:30:55,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:55,933 INFO L85 PathProgramCache]: Analyzing trace with hash -643884023, now seen corresponding path program 32 times [2025-04-13 17:30:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:55,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748245549] [2025-04-13 17:30:55,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:55,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:30:55,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:30:55,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:30:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:57,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748245549] [2025-04-13 17:30:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748245549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:57,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:57,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:30:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720388662] [2025-04-13 17:30:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:57,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:30:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:57,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:30:57,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:30:57,887 INFO L87 Difference]: Start difference. First operand 425 states and 1036 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:00,433 INFO L93 Difference]: Finished difference Result 599 states and 1434 transitions. [2025-04-13 17:31:00,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:31:00,433 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:00,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:00,435 INFO L225 Difference]: With dead ends: 599 [2025-04-13 17:31:00,435 INFO L226 Difference]: Without dead ends: 546 [2025-04-13 17:31:00,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:31:00,436 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:00,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:31:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-04-13 17:31:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 429. [2025-04-13 17:31:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 2.459016393442623) internal successors, (1050), 428 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1050 transitions. [2025-04-13 17:31:00,557 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1050 transitions. Word has length 19 [2025-04-13 17:31:00,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:00,557 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1050 transitions. [2025-04-13 17:31:00,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:00,557 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1050 transitions. [2025-04-13 17:31:00,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:00,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:00,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:00,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 17:31:00,558 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:00,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash -990219325, now seen corresponding path program 9 times [2025-04-13 17:31:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:00,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339430926] [2025-04-13 17:31:00,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:31:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:00,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:00,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:00,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:31:00,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:02,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339430926] [2025-04-13 17:31:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339430926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:02,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:02,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:31:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578440257] [2025-04-13 17:31:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:02,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:31:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:02,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:31:02,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:31:02,240 INFO L87 Difference]: Start difference. First operand 429 states and 1050 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:03,957 INFO L93 Difference]: Finished difference Result 598 states and 1460 transitions. [2025-04-13 17:31:03,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:31:03,957 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:03,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:03,959 INFO L225 Difference]: With dead ends: 598 [2025-04-13 17:31:03,959 INFO L226 Difference]: Without dead ends: 553 [2025-04-13 17:31:03,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:31:03,960 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:03,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:31:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-04-13 17:31:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 427. [2025-04-13 17:31:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 425 states have (on average 2.449411764705882) internal successors, (1041), 426 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1041 transitions. [2025-04-13 17:31:04,086 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 1041 transitions. Word has length 19 [2025-04-13 17:31:04,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:04,086 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 1041 transitions. [2025-04-13 17:31:04,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:04,086 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 1041 transitions. [2025-04-13 17:31:04,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:04,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:04,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:04,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 17:31:04,087 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:04,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -79148801, now seen corresponding path program 33 times [2025-04-13 17:31:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:04,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589126511] [2025-04-13 17:31:04,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:31:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:04,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:04,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:04,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:31:04,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:05,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589126511] [2025-04-13 17:31:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589126511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:31:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922343180] [2025-04-13 17:31:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:05,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:31:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:05,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:31:05,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:31:05,650 INFO L87 Difference]: Start difference. First operand 427 states and 1041 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:07,420 INFO L93 Difference]: Finished difference Result 566 states and 1358 transitions. [2025-04-13 17:31:07,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:31:07,420 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:07,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:07,422 INFO L225 Difference]: With dead ends: 566 [2025-04-13 17:31:07,422 INFO L226 Difference]: Without dead ends: 521 [2025-04-13 17:31:07,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:31:07,423 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:07,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:31:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-04-13 17:31:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 427. [2025-04-13 17:31:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 425 states have (on average 2.4447058823529413) internal successors, (1039), 426 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1039 transitions. [2025-04-13 17:31:07,555 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 1039 transitions. Word has length 19 [2025-04-13 17:31:07,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:07,555 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 1039 transitions. [2025-04-13 17:31:07,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:07,555 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 1039 transitions. [2025-04-13 17:31:07,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:07,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:07,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:07,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 17:31:07,556 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:07,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1281381881, now seen corresponding path program 10 times [2025-04-13 17:31:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:07,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704354117] [2025-04-13 17:31:07,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:31:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:07,579 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:31:07,618 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:07,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:31:07,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:09,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704354117] [2025-04-13 17:31:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704354117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:31:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018022037] [2025-04-13 17:31:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:09,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:09,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:09,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:09,403 INFO L87 Difference]: Start difference. First operand 427 states and 1039 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:13,269 INFO L93 Difference]: Finished difference Result 727 states and 1711 transitions. [2025-04-13 17:31:13,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:31:13,269 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:13,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:13,271 INFO L225 Difference]: With dead ends: 727 [2025-04-13 17:31:13,271 INFO L226 Difference]: Without dead ends: 688 [2025-04-13 17:31:13,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:31:13,272 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 325 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:13,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 0 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 17:31:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-04-13 17:31:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 433. [2025-04-13 17:31:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 431 states have (on average 2.4501160092807424) internal successors, (1056), 432 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1056 transitions. [2025-04-13 17:31:13,403 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1056 transitions. Word has length 19 [2025-04-13 17:31:13,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:13,403 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1056 transitions. [2025-04-13 17:31:13,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:13,403 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1056 transitions. [2025-04-13 17:31:13,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:13,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:13,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:13,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 17:31:13,404 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:13,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash -79770675, now seen corresponding path program 34 times [2025-04-13 17:31:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:13,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323551615] [2025-04-13 17:31:13,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:31:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:13,427 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:31:13,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:13,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:31:13,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:14,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323551615] [2025-04-13 17:31:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323551615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:14,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:31:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238384340] [2025-04-13 17:31:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:14,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:31:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:14,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:31:14,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:31:14,495 INFO L87 Difference]: Start difference. First operand 433 states and 1056 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:16,122 INFO L93 Difference]: Finished difference Result 603 states and 1426 transitions. [2025-04-13 17:31:16,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:31:16,122 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:16,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:16,124 INFO L225 Difference]: With dead ends: 603 [2025-04-13 17:31:16,124 INFO L226 Difference]: Without dead ends: 550 [2025-04-13 17:31:16,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:31:16,125 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:16,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:31:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-04-13 17:31:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 439. [2025-04-13 17:31:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 437 states have (on average 2.4645308924485128) internal successors, (1077), 438 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1077 transitions. [2025-04-13 17:31:16,273 INFO L79 Accepts]: Start accepts. Automaton has 439 states and 1077 transitions. Word has length 19 [2025-04-13 17:31:16,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:16,273 INFO L485 AbstractCegarLoop]: Abstraction has 439 states and 1077 transitions. [2025-04-13 17:31:16,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:16,273 INFO L278 IsEmpty]: Start isEmpty. Operand 439 states and 1077 transitions. [2025-04-13 17:31:16,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:16,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:16,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:16,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 17:31:16,274 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:16,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash -426105977, now seen corresponding path program 11 times [2025-04-13 17:31:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:16,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049687667] [2025-04-13 17:31:16,274 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:31:16,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:16,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:16,330 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:16,330 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:31:16,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:17,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049687667] [2025-04-13 17:31:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049687667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:17,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:17,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:31:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518567408] [2025-04-13 17:31:17,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:17,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:31:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:17,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:31:17,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:31:17,359 INFO L87 Difference]: Start difference. First operand 439 states and 1077 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:19,071 INFO L93 Difference]: Finished difference Result 590 states and 1436 transitions. [2025-04-13 17:31:19,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:31:19,071 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:19,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:19,073 INFO L225 Difference]: With dead ends: 590 [2025-04-13 17:31:19,073 INFO L226 Difference]: Without dead ends: 545 [2025-04-13 17:31:19,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:31:19,074 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:19,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:31:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-04-13 17:31:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 431. [2025-04-13 17:31:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 429 states have (on average 2.445221445221445) internal successors, (1049), 430 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1049 transitions. [2025-04-13 17:31:19,211 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1049 transitions. Word has length 19 [2025-04-13 17:31:19,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:19,211 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1049 transitions. [2025-04-13 17:31:19,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:19,211 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1049 transitions. [2025-04-13 17:31:19,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:19,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:19,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:19,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 17:31:19,212 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:19,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -620252029, now seen corresponding path program 35 times [2025-04-13 17:31:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:19,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373169759] [2025-04-13 17:31:19,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:31:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:19,235 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:19,254 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:19,255 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:31:19,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:20,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373169759] [2025-04-13 17:31:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373169759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:20,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:31:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719915461] [2025-04-13 17:31:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:20,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:31:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:20,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:31:20,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:31:20,265 INFO L87 Difference]: Start difference. First operand 431 states and 1049 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:21,652 INFO L93 Difference]: Finished difference Result 580 states and 1403 transitions. [2025-04-13 17:31:21,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:31:21,652 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:21,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:21,654 INFO L225 Difference]: With dead ends: 580 [2025-04-13 17:31:21,654 INFO L226 Difference]: Without dead ends: 531 [2025-04-13 17:31:21,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:31:21,655 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:21,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:31:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-04-13 17:31:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 417. [2025-04-13 17:31:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 415 states have (on average 2.424096385542169) internal successors, (1006), 416 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1006 transitions. [2025-04-13 17:31:21,782 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1006 transitions. Word has length 19 [2025-04-13 17:31:21,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:21,782 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1006 transitions. [2025-04-13 17:31:21,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:21,782 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1006 transitions. [2025-04-13 17:31:21,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:21,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:21,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:21,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 17:31:21,782 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:21,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1584884833, now seen corresponding path program 40 times [2025-04-13 17:31:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:21,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357606124] [2025-04-13 17:31:21,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:31:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:21,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 17:31:21,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:21,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:31:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:22,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:22,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357606124] [2025-04-13 17:31:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357606124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:31:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632893654] [2025-04-13 17:31:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:22,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:31:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:31:22,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:31:22,503 INFO L87 Difference]: Start difference. First operand 417 states and 1006 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:23,432 INFO L93 Difference]: Finished difference Result 535 states and 1216 transitions. [2025-04-13 17:31:23,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:31:23,433 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:23,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:23,435 INFO L225 Difference]: With dead ends: 535 [2025-04-13 17:31:23,435 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 17:31:23,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:31:23,435 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:23,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:31:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 17:31:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 415. [2025-04-13 17:31:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 413 states have (on average 2.4188861985472156) internal successors, (999), 414 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 999 transitions. [2025-04-13 17:31:23,565 INFO L79 Accepts]: Start accepts. Automaton has 415 states and 999 transitions. Word has length 19 [2025-04-13 17:31:23,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:23,565 INFO L485 AbstractCegarLoop]: Abstraction has 415 states and 999 transitions. [2025-04-13 17:31:23,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:23,565 INFO L278 IsEmpty]: Start isEmpty. Operand 415 states and 999 transitions. [2025-04-13 17:31:23,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:23,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:23,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:23,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 17:31:23,566 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:23,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash 605643875, now seen corresponding path program 41 times [2025-04-13 17:31:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:23,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758380314] [2025-04-13 17:31:23,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:31:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:23,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:23,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:23,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:31:23,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:24,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:24,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758380314] [2025-04-13 17:31:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758380314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:24,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:31:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971276986] [2025-04-13 17:31:24,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:24,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:31:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:24,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:31:24,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:31:24,180 INFO L87 Difference]: Start difference. First operand 415 states and 999 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:25,567 INFO L93 Difference]: Finished difference Result 527 states and 1188 transitions. [2025-04-13 17:31:25,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:31:25,567 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:25,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:25,569 INFO L225 Difference]: With dead ends: 527 [2025-04-13 17:31:25,569 INFO L226 Difference]: Without dead ends: 490 [2025-04-13 17:31:25,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:31:25,569 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:25,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:31:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-04-13 17:31:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 409. [2025-04-13 17:31:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 407 states have (on average 2.4176904176904177) internal successors, (984), 408 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 984 transitions. [2025-04-13 17:31:25,700 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 984 transitions. Word has length 19 [2025-04-13 17:31:25,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:25,700 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 984 transitions. [2025-04-13 17:31:25,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:25,700 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 984 transitions. [2025-04-13 17:31:25,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:25,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:25,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:25,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 17:31:25,701 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:25,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -156528077, now seen corresponding path program 42 times [2025-04-13 17:31:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:25,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964941883] [2025-04-13 17:31:25,702 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:31:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:25,725 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:25,741 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:25,742 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:31:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:26,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964941883] [2025-04-13 17:31:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964941883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:31:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344168062] [2025-04-13 17:31:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:26,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:31:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:26,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:31:26,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:31:26,409 INFO L87 Difference]: Start difference. First operand 409 states and 984 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:27,286 INFO L93 Difference]: Finished difference Result 451 states and 1054 transitions. [2025-04-13 17:31:27,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 17:31:27,287 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:27,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:27,289 INFO L225 Difference]: With dead ends: 451 [2025-04-13 17:31:27,289 INFO L226 Difference]: Without dead ends: 416 [2025-04-13 17:31:27,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:27,289 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:27,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:31:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-04-13 17:31:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 407. [2025-04-13 17:31:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 405 states have (on average 2.417283950617284) internal successors, (979), 406 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 979 transitions. [2025-04-13 17:31:27,420 INFO L79 Accepts]: Start accepts. Automaton has 407 states and 979 transitions. Word has length 19 [2025-04-13 17:31:27,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:27,420 INFO L485 AbstractCegarLoop]: Abstraction has 407 states and 979 transitions. [2025-04-13 17:31:27,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:27,420 INFO L278 IsEmpty]: Start isEmpty. Operand 407 states and 979 transitions. [2025-04-13 17:31:27,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:27,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:27,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:27,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 17:31:27,420 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:27,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 898786769, now seen corresponding path program 36 times [2025-04-13 17:31:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:27,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43306188] [2025-04-13 17:31:27,421 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:31:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:27,445 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:27,462 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:27,462 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:31:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:28,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43306188] [2025-04-13 17:31:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43306188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:31:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179877386] [2025-04-13 17:31:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:28,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:31:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:28,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:31:28,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:31:28,265 INFO L87 Difference]: Start difference. First operand 407 states and 979 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:29,288 INFO L93 Difference]: Finished difference Result 472 states and 1101 transitions. [2025-04-13 17:31:29,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:31:29,288 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:29,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:29,290 INFO L225 Difference]: With dead ends: 472 [2025-04-13 17:31:29,290 INFO L226 Difference]: Without dead ends: 423 [2025-04-13 17:31:29,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:31:29,291 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:29,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:31:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-04-13 17:31:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 403. [2025-04-13 17:31:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 401 states have (on average 2.401496259351621) internal successors, (963), 402 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 963 transitions. [2025-04-13 17:31:29,413 INFO L79 Accepts]: Start accepts. Automaton has 403 states and 963 transitions. Word has length 19 [2025-04-13 17:31:29,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:29,413 INFO L485 AbstractCegarLoop]: Abstraction has 403 states and 963 transitions. [2025-04-13 17:31:29,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:29,413 INFO L278 IsEmpty]: Start isEmpty. Operand 403 states and 963 transitions. [2025-04-13 17:31:29,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:29,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:29,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:29,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 17:31:29,414 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:29,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash -649319821, now seen corresponding path program 12 times [2025-04-13 17:31:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:29,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958182556] [2025-04-13 17:31:29,414 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:31:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:29,437 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:29,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:29,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:31:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:31,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958182556] [2025-04-13 17:31:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958182556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:31:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438843085] [2025-04-13 17:31:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:31,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:31,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:31,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:31,685 INFO L87 Difference]: Start difference. First operand 403 states and 963 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:34,406 INFO L93 Difference]: Finished difference Result 511 states and 1178 transitions. [2025-04-13 17:31:34,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:31:34,407 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:34,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:34,409 INFO L225 Difference]: With dead ends: 511 [2025-04-13 17:31:34,409 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 17:31:34,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:31:34,410 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:34,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 17:31:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 17:31:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 397. [2025-04-13 17:31:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 395 states have (on average 2.3848101265822783) internal successors, (942), 396 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 942 transitions. [2025-04-13 17:31:34,529 INFO L79 Accepts]: Start accepts. Automaton has 397 states and 942 transitions. Word has length 19 [2025-04-13 17:31:34,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:34,529 INFO L485 AbstractCegarLoop]: Abstraction has 397 states and 942 transitions. [2025-04-13 17:31:34,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:34,529 INFO L278 IsEmpty]: Start isEmpty. Operand 397 states and 942 transitions. [2025-04-13 17:31:34,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:31:34,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:34,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:34,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 17:31:34,529 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:34,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1799458337, now seen corresponding path program 13 times [2025-04-13 17:31:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:34,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578351647] [2025-04-13 17:31:34,530 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:31:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:34,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:31:34,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:31:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:36,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578351647] [2025-04-13 17:31:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578351647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:31:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059517112] [2025-04-13 17:31:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:36,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:36,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:36,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:36,580 INFO L87 Difference]: Start difference. First operand 397 states and 942 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:39,397 INFO L93 Difference]: Finished difference Result 541 states and 1236 transitions. [2025-04-13 17:31:39,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:31:39,397 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:31:39,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:39,399 INFO L225 Difference]: With dead ends: 541 [2025-04-13 17:31:39,400 INFO L226 Difference]: Without dead ends: 502 [2025-04-13 17:31:39,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:31:39,400 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:39,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:31:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-04-13 17:31:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 383. [2025-04-13 17:31:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 381 states have (on average 2.3963254593175853) internal successors, (913), 382 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 913 transitions. [2025-04-13 17:31:39,517 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 913 transitions. Word has length 19 [2025-04-13 17:31:39,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:39,517 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 913 transitions. [2025-04-13 17:31:39,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:39,517 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 913 transitions. [2025-04-13 17:31:39,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:31:39,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:39,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:39,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 17:31:39,518 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:39,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 131785415, now seen corresponding path program 1 times [2025-04-13 17:31:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:39,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946682806] [2025-04-13 17:31:39,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:31:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:39,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:31:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:31:39,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:31:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:40,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946682806] [2025-04-13 17:31:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946682806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:31:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598642897] [2025-04-13 17:31:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:40,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:31:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:40,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:31:40,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:31:40,913 INFO L87 Difference]: Start difference. First operand 383 states and 913 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:42,363 INFO L93 Difference]: Finished difference Result 437 states and 999 transitions. [2025-04-13 17:31:42,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:31:42,363 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 17:31:42,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:42,365 INFO L225 Difference]: With dead ends: 437 [2025-04-13 17:31:42,365 INFO L226 Difference]: Without dead ends: 404 [2025-04-13 17:31:42,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:31:42,366 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:42,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 24 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 17:31:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-13 17:31:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 379. [2025-04-13 17:31:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 377 states have (on average 2.3978779840848805) internal successors, (904), 378 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 904 transitions. [2025-04-13 17:31:42,485 INFO L79 Accepts]: Start accepts. Automaton has 379 states and 904 transitions. Word has length 20 [2025-04-13 17:31:42,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:42,485 INFO L485 AbstractCegarLoop]: Abstraction has 379 states and 904 transitions. [2025-04-13 17:31:42,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:31:42,485 INFO L278 IsEmpty]: Start isEmpty. Operand 379 states and 904 transitions. [2025-04-13 17:31:42,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:31:42,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:42,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:42,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 17:31:42,486 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:31:42,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash -966231499, now seen corresponding path program 1 times [2025-04-13 17:31:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:42,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581356690] [2025-04-13 17:31:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:31:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:31:42,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:31:42,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:42,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:31:42,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:31:42,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:31:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:31:42,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:42,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:31:42,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:31:42,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:31:42,613 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:31:42,614 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:31:42,614 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_write_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:31:42,614 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 17:31:42,614 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 17:31:42,614 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:31:42,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 17:31:42,616 INFO L422 BasicCegarLoop]: Path program histogram: [42, 36, 26, 13, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:42,701 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:31:42,702 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:31:42,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:31:42 BasicIcfg [2025-04-13 17:31:42,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:31:42,704 INFO L158 Benchmark]: Toolchain (without parser) took 402003.18ms. Allocated memory was 155.2MB in the beginning and 813.7MB in the end (delta: 658.5MB). Free memory was 99.0MB in the beginning and 409.0MB in the end (delta: -310.0MB). Peak memory consumption was 347.7MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 86.7MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 5070.65ms. Allocated memory was 155.2MB in the beginning and 159.4MB in the end (delta: 4.2MB). Free memory was 99.0MB in the beginning and 42.6MB in the end (delta: 56.4MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.80ms. Allocated memory is still 159.4MB. Free memory was 42.6MB in the beginning and 33.1MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: Boogie Preprocessor took 98.64ms. Allocated memory was 159.4MB in the beginning and 427.8MB in the end (delta: 268.4MB). Free memory was 33.1MB in the beginning and 355.1MB in the end (delta: -322.0MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: RCFGBuilder took 1878.51ms. Allocated memory is still 427.8MB. Free memory was 355.1MB in the beginning and 290.5MB in the end (delta: 64.5MB). Peak memory consumption was 276.3MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L158 Benchmark]: TraceAbstraction took 394825.75ms. Allocated memory was 427.8MB in the beginning and 813.7MB in the end (delta: 385.9MB). Free memory was 290.5MB in the beginning and 409.0MB in the end (delta: -118.5MB). Peak memory consumption was 265.3MB. Max. memory is 8.0GB. [2025-04-13 17:31:42,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 86.7MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 5070.65ms. Allocated memory was 155.2MB in the beginning and 159.4MB in the end (delta: 4.2MB). Free memory was 99.0MB in the beginning and 42.6MB in the end (delta: 56.4MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 123.80ms. Allocated memory is still 159.4MB. Free memory was 42.6MB in the beginning and 33.1MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.64ms. Allocated memory was 159.4MB in the beginning and 427.8MB in the end (delta: 268.4MB). Free memory was 33.1MB in the beginning and 355.1MB in the end (delta: -322.0MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1878.51ms. Allocated memory is still 427.8MB. Free memory was 355.1MB in the beginning and 290.5MB in the end (delta: 64.5MB). Peak memory consumption was 276.3MB. Max. memory is 8.0GB. * TraceAbstraction took 394825.75ms. Allocated memory was 427.8MB in the beginning and 813.7MB in the end (delta: 385.9MB). Free memory was 290.5MB in the beginning and 409.0MB in the end (delta: -118.5MB). Peak memory consumption was 265.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 3228]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] - GenericResultAtLocation [Line: 5817]: Unsoundness Warning Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 175]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L247] 0 unsigned long jiffies; [L6522] 0 const unsigned int default_alloc_size = 4; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6692] 0 static struct mutex nvram_mutex = { 1, 0 }; [L6693] 0 static ssize_t nvram_len; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6790-L6796] 0 struct file_operations nvram_fops = { .owner = ((struct module *)0), .llseek = nvram_llseek, .read = read_nvram, .write = write_nvram, .unlocked_ioctl = nvram_unlocked_ioctl, }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6797-L6801] 0 static struct miscdevice nvram_dev = { 144, "nvram", &nvram_fops }; [L6820] 0 int (* _whoop_init)(void) = nvram_init; [L6821] 0 void (* _whoop_exit)(void) = nvram_cleanup; [L6822] 0 struct inode *whoop_inode_0; [L6823] 0 struct file *whoop_file_0; [L6824] 0 struct inode *whoop_inode_1; [L6825] 0 struct file *whoop_file_1; [L6826] 0 struct inode *whoop_inode_2; [L6827] 0 struct file *whoop_file_2; [L6828] 0 struct inode *whoop_inode_3; [L6829] 0 struct file *whoop_file_3; [L6830] 0 struct inode *whoop_inode_4; [L6831] 0 struct file *whoop_file_4; [L6832] 0 struct pci_dev *whoop_pci_dev; [L6833] 0 char *whoop_buf; [L6834] 0 struct platform_device *whoop_platform_device; [L6835] 0 struct vm_area_struct *whoop_vm_area_struct; [L6836] 0 struct cx_dev *whoop_cx_dev; [L6837] 0 poll_table *whoop_poll_table; [L6838] 0 loff_t *whoop_loff_t; [L6839] 0 int whoop_int; [L6867] 0 whoop_inode_0 = (struct inode *) malloc(sizeof(struct inode)) [L6868] 0 whoop_file_0 = (struct file *) malloc(sizeof(struct file)) [L6869] 0 whoop_inode_1 = (struct inode *) malloc(sizeof(struct inode)) [L6870] 0 whoop_file_1 = (struct file *) malloc(sizeof(struct file)) [L6871] 0 whoop_inode_2 = (struct inode *) malloc(sizeof(struct inode)) [L6872] 0 whoop_file_2 = (struct file *) malloc(sizeof(struct file)) [L6873] 0 whoop_inode_3 = (struct inode *) malloc(sizeof(struct inode)) [L6874] 0 whoop_file_3 = (struct file *) malloc(sizeof(struct file)) [L6875] 0 whoop_inode_4 = (struct inode *) malloc(sizeof(struct inode)) [L6876] 0 whoop_file_4 = (struct file *) malloc(sizeof(struct file)) [L6877] 0 whoop_pci_dev = (struct pci_dev *) malloc(sizeof(struct pci_dev)) [L6878] 0 whoop_buf = (char *) malloc(sizeof(char)) [L6879] 0 whoop_platform_device = (struct platform_device *) malloc(sizeof(struct platform_device)) [L6880] 0 whoop_vm_area_struct = (struct vm_area_struct *) malloc(sizeof(struct vm_area_struct)) [L6881] 0 whoop_cx_dev = (struct cx_dev *) malloc(sizeof(struct cx_dev)) [L6882] 0 whoop_poll_table = (poll_table *) malloc(sizeof(poll_table)) [L6883] 0 whoop_loff_t = (loff_t *) malloc(sizeof(loff_t)) [L6884] 0 *whoop_loff_t = __VERIFIER_nondet_longlong() [L6885] 0 whoop_int = __VERIFIER_nondet_int() [L6886] CALL 0 assume_abort_if_not(whoop_int >= 0) [L171] COND FALSE 0 !(!cond) [L6886] RET 0 assume_abort_if_not(whoop_int >= 0) [L6887] CALL, EXPR 0 _whoop_init() [L6804] 0 int ret = 0; [L6805-L6806] CALL 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6650] 0 return __VERIFIER_nondet_int(); [L6805-L6806] RET 0 printk("\001" "6" "Generic non-volatile memory driver v%s\n", "1.1") [L6807] CALL, EXPR 0 misc_register(&nvram_dev) [L6624] 0 return __VERIFIER_nondet_int(); [L6807] RET, EXPR 0 misc_register(&nvram_dev) [L6807] 0 ret = misc_register(&nvram_dev) [L6808] COND FALSE 0 !(ret != 0) [L6810] CALL, EXPR 0 nvram_get_size() [L6632] 0 return __VERIFIER_nondet_long(); [L6810] RET, EXPR 0 nvram_get_size() [L6810] 0 nvram_len = nvram_get_size() [L6811] COND TRUE 0 nvram_len < 0 [L6812] 0 nvram_len = 8192 [L6814] 0 return ret; [L6887] RET, EXPR 0 _whoop_init() [L6887] 0 int _whoop_init_result = _whoop_init(); [L6888] 0 pthread_t pthread_t_write_nvram; [L6889] 0 pthread_t pthread_t_read_nvram; [L6890] FCALL, FORK 0 pthread_create(&pthread_t_write_nvram, ((void *)0), whoop_wrapper_write_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, pthread_t_write_nvram=0, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6842] CALL 1 write_nvram(whoop_file_0, whoop_buf, whoop_int, whoop_loff_t) [L6744] 1 unsigned int i; [L6745] 1 const char *p = buf; [L6746] 1 char c = __VERIFIER_nondet_char(); [L6747] CALL, EXPR 1 access_ok(0, buf, count) [L6551] 1 return __VERIFIER_nondet_int(); [L6747] RET, EXPR 1 access_ok(0, buf, count) [L6747] COND FALSE 1 !(!access_ok(0, buf, count)) [L6750] EXPR 1 \read(*ppos) [L6750] 1 ssize_t lppos = *ppos; [L6752] COND FALSE 1 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=2, default_alloc_size=4, file={-10:0}, jiffies=0, lppos=8188, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:0}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6755] EXPR 1 \read(*ppos) [L6755] 1 lppos = *ppos [L6757] 1 i = lppos [L6757] COND TRUE 1 count > 0 && i < nvram_len [L6758] CALL 1 __get_user(c, p) [L6535] 1 return __VERIFIER_nondet_int(); [L6758] RET 1 __get_user(c, p) [L6758] COND FALSE 1 !(__get_user(c, p)) [L6760] FCALL 1 nvram_write_byte(c, i) [L6757] 1 ++i [L6757] 1 ++p [L6757] 1 --count VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=1, default_alloc_size=4, file={-10:0}, i=8189, jiffies=0, lppos=8188, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:1}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6757] COND TRUE 1 count > 0 && i < nvram_len [L6758] CALL 1 __get_user(c, p) [L6535] 1 return __VERIFIER_nondet_int(); [L6758] RET 1 __get_user(c, p) [L6758] COND FALSE 1 !(__get_user(c, p)) [L6760] FCALL 1 nvram_write_byte(c, i) [L6757] 1 ++i [L6757] 1 ++p [L6757] 1 --count [L6757] COND FALSE 1 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-10:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, c=0, count=0, default_alloc_size=4, file={-10:0}, i=8190, jiffies=0, lppos=8188, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:2}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6763] 1 *ppos = i VAL [\at(args, Pre)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6891] FCALL, FORK 0 pthread_create(&pthread_t_read_nvram, ((void *)0), whoop_wrapper_read_nvram, ((void *)0)) VAL [_whoop_exit={-1:5}, _whoop_init={-1:4}, _whoop_init_result=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, pthread_t_read_nvram=1, pthread_t_write_nvram=0, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6847] CALL 2 read_nvram(whoop_file_1, whoop_buf, whoop_int, whoop_loff_t) [L6717] 2 unsigned int i; [L6718] 2 char *p = buf; [L6719] CALL, EXPR 2 access_ok(1, buf, count) [L6551] 2 return __VERIFIER_nondet_int(); [L6719] RET, EXPR 2 access_ok(1, buf, count) [L6719] COND FALSE 2 !(!access_ok(1, buf, count)) [L6722] EXPR 2 \read(*ppos) [L6722] 2 ssize_t lppos = *ppos; [L6724] COND FALSE 2 !(lppos >= nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=2, default_alloc_size=4, file={-13:0}, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:0}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6727] EXPR 2 \read(*ppos) [L6727] 2 lppos = *ppos [L6729] 2 i = lppos [L6729] COND TRUE 2 count > 0 && i < nvram_len [L6730] CALL, EXPR 2 nvram_read_byte(i) [L6636] 2 return __VERIFIER_nondet_uchar(); [L6730] RET, EXPR 2 nvram_read_byte(i) [L6730] CALL 2 __put_user(nvram_read_byte(i), p) [L6543] 2 return __VERIFIER_nondet_int(); [L6730] RET 2 __put_user(nvram_read_byte(i), p) [L6730] COND FALSE 2 !(__put_user(nvram_read_byte(i), p)) [L6729] 2 ++i [L6729] 2 ++p [L6729] 2 --count VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=1, default_alloc_size=4, file={-13:0}, i=8191, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:1}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6729] COND TRUE 2 count > 0 && i < nvram_len [L6730] CALL, EXPR 2 nvram_read_byte(i) [L6636] 2 return __VERIFIER_nondet_uchar(); [L6730] RET, EXPR 2 nvram_read_byte(i) [L6730] CALL 2 __put_user(nvram_read_byte(i), p) [L6543] 2 return __VERIFIER_nondet_int(); [L6730] RET 2 __put_user(nvram_read_byte(i), p) [L6730] COND FALSE 2 !(__put_user(nvram_read_byte(i), p)) [L6729] 2 ++i [L6729] 2 ++p [L6729] 2 --count [L6729] COND FALSE 2 !(count > 0 && i < nvram_len) VAL [\at(buf, Pre)={-9:0}, \at(count, Pre)=2, \at(file, Pre)={-13:0}, \at(ppos, Pre)={-6:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, buf={-9:0}, count=0, default_alloc_size=4, file={-13:0}, i=8192, jiffies=0, lppos=8190, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, p={-9:2}, ppos={-6:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6733] 2 *ppos = i VAL [\at(args, Pre)={0:0}, _whoop_exit={-1:5}, _whoop_init={-1:4}, args={0:0}, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] [L6766] EXPR 1 \read(*ppos) [L6766] 1 lppos = *ppos [L6768] CALL 1 __VERIFIER_assert(lppos == i) [L174] COND TRUE 1 !(cond) [L175] 1 reach_error() VAL [\at(cond, Pre)=0, _whoop_exit={-1:5}, _whoop_init={-1:4}, cond=0, default_alloc_size=4, jiffies=0, nvram_dev={9:0}, nvram_fops={8:0}, nvram_len=8192, nvram_mutex={7:0}, whoop_buf={-9:0}, whoop_cx_dev={-11:0}, whoop_file_0={-10:0}, whoop_file_1={-13:0}, whoop_file_2={-18:0}, whoop_file_3={-8:0}, whoop_file_4={-3:0}, whoop_inode_0={-2:0}, whoop_inode_1={-5:0}, whoop_inode_2={-14:0}, whoop_inode_3={-17:0}, whoop_inode_4={-16:0}, whoop_int=2, whoop_loff_t={-6:0}, whoop_pci_dev={-12:0}, whoop_platform_device={-7:0}, whoop_poll_table={-4:0}, whoop_vm_area_struct={-15:0}] - UnprovableResult [Line: 175]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6891]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 6890]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 78 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 394.6s, OverallIterations: 132, TraceHistogramMax: 1, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.1s, AutomataDifference: 207.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 16248 SdHoareTripleChecker+Valid, 111.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16248 mSDsluCounter, 284 SdHoareTripleChecker+Invalid, 101.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 3157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92204 IncrementalHoareTripleChecker+Invalid, 95363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3157 mSolverCounterUnsat, 66 mSDtfsCounter, 92204 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2807 GetRequests, 249 SyntacticMatches, 25 SemanticMatches, 2533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6951 ImplicationChecksByTransitivity, 100.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=93, InterpolantAutomatonStates: 1671, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 131 MinimizatonAttempts, 18217 StatesRemovedByMinimization, 131 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 168.0s InterpolantComputationTime, 2471 NumberOfCodeBlocks, 2471 NumberOfCodeBlocksAsserted, 153 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 117735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 131 InterpolantComputations, 131 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 17:31:42,908 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 17:31:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...