./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:07:20,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:07:20,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:07:20,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:07:20,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:07:20,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:07:20,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:07:20,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:07:20,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:07:20,700 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:07:20,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:07:20,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:07:20,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:07:20,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:07:20,701 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:07:20,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:07:20,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:07:20,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:07:20,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:07:20,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:07:20,705 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f16b4cfe031f645c2fa5eeec572887c79d8e9243727503d849e4b19e0e31cc63 [2025-02-08 01:07:21,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:07:21,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:07:21,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:07:21,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:07:21,035 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:07:21,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 01:07:22,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96e5b7a11/fb64254313474102b28f63f25ab9dd1a/FLAG0a250d591 [2025-02-08 01:07:22,923 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:07:22,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 01:07:22,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96e5b7a11/fb64254313474102b28f63f25ab9dd1a/FLAG0a250d591 [2025-02-08 01:07:22,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96e5b7a11/fb64254313474102b28f63f25ab9dd1a [2025-02-08 01:07:22,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:07:22,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:07:22,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:07:22,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:07:23,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:07:23,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:07:22" (1/1) ... [2025-02-08 01:07:23,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c24ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:23, skipping insertion in model container [2025-02-08 01:07:23,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:07:22" (1/1) ... [2025-02-08 01:07:23,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:07:23,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-02-08 01:07:28,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:07:28,672 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:07:28,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_write_nvram.i[5520,5533] [2025-02-08 01:07:28,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "b %b0, %1\n" : "+q" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 01:07:28,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "w %w0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 01:07:28,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "l %0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 01:07:28,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile ("" "xchg" "q %q0, %1\n" : "+r" (__ret), "+m" (*((&head->first))) : : "memory", "cc"); [3228] [2025-02-08 01:07:28,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2025-02-08 01:07:28,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:07:29,358 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:07:29,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29 WrapperNode [2025-02-08 01:07:29,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:07:29,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:07:29,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:07:29,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:07:29,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,523 INFO L138 Inliner]: procedures = 1354, calls = 1479, calls flagged for inlining = 352, calls inlined = 18, statements flattened = 394 [2025-02-08 01:07:29,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:07:29,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:07:29,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:07:29,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:07:29,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,571 INFO L175 MemorySlicer]: Split 52 memory accesses to 7 slices as follows [2, 9, 31, 1, 4, 2, 3]. 60 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 31, 1, 4, 2, 3]. The 3 writes are split as follows [0, 3, 0, 0, 0, 0, 0]. [2025-02-08 01:07:29,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:07:29,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:07:29,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:07:29,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:07:29,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (1/1) ... [2025-02-08 01:07:29,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:07:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:07:29,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:07:29,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:07:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:07:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2025-02-08 01:07:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:07:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_write_nvram [2025-02-08 01:07:29,686 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_write_nvram [2025-02-08 01:07:29,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 01:07:29,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 01:07:29,689 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:07:30,109 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:07:30,111 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:07:30,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1065#1; [2025-02-08 01:07:30,306 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc __put_user_#t~nondet1063#1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-5: havoc __put_user_#t~nondet1063#1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-4: assume -2147483648 <= __put_user_#t~nondet1063#1 && __put_user_#t~nondet1063#1 <= 2147483647; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-3: __put_user_#res#1 := __put_user_#t~nondet1063#1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543-2: havoc __put_user_#t~nondet1063#1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6636: havoc nvram_read_byte_#t~nondet1081#1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-3: read_nvram_#t~pre1102#1 := read_nvram_~count#1 - 1; [2025-02-08 01:07:30,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-2: read_nvram_~count#1 := read_nvram_~count#1 - 1; [2025-02-08 01:07:30,308 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-1: havoc read_nvram_#t~pre1102#1; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-7: havoc read_nvram_#t~pre1100#1; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-6: read_nvram_#t~pre1101#1.base, read_nvram_#t~pre1101#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-5: read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset := read_nvram_~p~1#1.base, 1 + read_nvram_~p~1#1.offset; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-4: havoc read_nvram_#t~pre1101#1.base, read_nvram_#t~pre1101#1.offset; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-9: read_nvram_#t~pre1100#1 := 1 + read_nvram_~i~1#1; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6729-8: read_nvram_~i~1#1 := 1 + read_nvram_~i~1#1; [2025-02-08 01:07:30,309 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730: havoc read_nvram_#t~ret1099#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-4: havoc read_nvram_#t~ret1098#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-3: havoc read_nvram_#t~ret1098#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-2: assume 0 != read_nvram_#t~ret1099#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-2: assume !(0 != read_nvram_#t~ret1099#1); [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-1: havoc read_nvram_#t~ret1099#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-8: read_nvram_#t~ret1099#1 := __put_user_#res#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-7: havoc __put_user_#t~nondet1063#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-6: havoc __put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-5: assume { :end_inline___put_user } true;assume -2147483648 <= read_nvram_#t~ret1099#1 && read_nvram_#t~ret1099#1 <= 2147483647; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-12: havoc nvram_read_byte_#in~arg0#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-11: assume { :end_inline_nvram_read_byte } true;assume { :begin_inline___put_user } true;__put_user_#in~arg0#1, __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset := (if read_nvram_#t~ret1098#1 % 256 % 4294967296 <= 2147483647 then read_nvram_#t~ret1098#1 % 256 % 4294967296 else read_nvram_#t~ret1098#1 % 256 % 4294967296 - 4294967296), read_nvram_~p~1#1.base, read_nvram_~p~1#1.offset; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-10: havoc __put_user_#res#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-9: havoc __put_user_#t~nondet1063#1, __put_user_~arg0#1, __put_user_~arg1#1.base, __put_user_~arg1#1.offset; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-14: read_nvram_#t~ret1098#1 := nvram_read_byte_#res#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6730-13: havoc nvram_read_byte_#t~nondet1081#1, nvram_read_byte_~arg0#1; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6731-1: read_nvram_#res#1 := -14; [2025-02-08 01:07:30,310 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542: __put_user_~arg1#1.base, __put_user_~arg1#1.offset := __put_user_#in~arg1#1.base, __put_user_#in~arg1#1.offset; [2025-02-08 01:07:30,311 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6542-1: __put_user_~arg0#1 := __put_user_#in~arg0#1; [2025-02-08 01:07:30,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-7: havoc write_nvram_#t~pre1109#1; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-6: write_nvram_#t~pre1110#1.base, write_nvram_#t~pre1110#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-5: write_nvram_~p~2#1.base, write_nvram_~p~2#1.offset := write_nvram_~p~2#1.base, 1 + write_nvram_~p~2#1.offset; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-4: havoc write_nvram_#t~pre1110#1.base, write_nvram_#t~pre1110#1.offset; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-8: write_nvram_~i~2#1 := 1 + write_nvram_~i~2#1; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc access_ok_#t~nondet1065#1; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: assume 0 != write_nvram_#t~ret1108#1; [2025-02-08 01:07:30,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758: assume !(0 != write_nvram_#t~ret1108#1); [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc __get_user_#t~nondet1061#1; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-4: havoc __get_user_#in~arg0#1, __get_user_#in~arg1#1.base, __get_user_#in~arg1#1.offset; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-3: assume { :end_inline___get_user } true;assume -2147483648 <= write_nvram_#t~ret1108#1 && write_nvram_#t~ret1108#1 <= 2147483647; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-2: havoc write_nvram_#t~ret1108#1; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-1: havoc write_nvram_#t~ret1108#1; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-6: write_nvram_#t~ret1108#1 := __get_user_#res#1; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6758-5: havoc __get_user_#t~nondet1061#1, __get_user_~arg0#1, __get_user_~arg1#1.base, __get_user_~arg1#1.offset; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6759-1: write_nvram_#res#1 := -14; [2025-02-08 01:07:30,419 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-2: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-1: havoc nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760: assume { :end_inline_nvram_write_byte } true;write_nvram_#t~pre1109#1 := 1 + write_nvram_~i~2#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-4: assume { :begin_inline_nvram_write_byte } true;nvram_write_byte_#in~arg0#1, nvram_write_byte_#in~arg1#1 := write_nvram_~c~4#1, (if write_nvram_~i~2#1 % 4294967296 % 4294967296 <= 2147483647 then write_nvram_~i~2#1 % 4294967296 % 4294967296 else write_nvram_~i~2#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6760-3: havoc nvram_write_byte_~arg0#1, nvram_write_byte_~arg1#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641-1: nvram_write_byte_~arg0#1 := nvram_write_byte_#in~arg0#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6641: nvram_write_byte_~arg1#1 := nvram_write_byte_#in~arg1#1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-3: write_nvram_#t~pre1111#1 := write_nvram_~count#1 - 1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-2: write_nvram_~count#1 := write_nvram_~count#1 - 1; [2025-02-08 01:07:30,420 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6757-1: havoc write_nvram_#t~pre1111#1; [2025-02-08 01:07:30,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc nvram_get_size_#t~nondet1080#1; [2025-02-08 01:07:30,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6650: havoc printk_#t~nondet1083#1; [2025-02-08 01:07:30,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc misc_register_#t~nondet1078#1; [2025-02-08 01:07:30,648 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:07:30,649 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:07:31,200 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:07:31,200 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:07:31,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:07:31 BoogieIcfgContainer [2025-02-08 01:07:31,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:07:31,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:07:31,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:07:31,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:07:31,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:07:22" (1/3) ... [2025-02-08 01:07:31,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a735e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:07:31, skipping insertion in model container [2025-02-08 01:07:31,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:29" (2/3) ... [2025-02-08 01:07:31,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4a735e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:07:31, skipping insertion in model container [2025-02-08 01:07:31,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:07:31" (3/3) ... [2025-02-08 01:07:31,211 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_write_nvram.i [2025-02-08 01:07:31,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:07:31,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_write_nvram.i that has 3 procedures, 45 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-08 01:07:31,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:07:31,310 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:07:31,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 110 flow [2025-02-08 01:07:31,386 INFO L124 PetriNetUnfolderBase]: 4/46 cut-off events. [2025-02-08 01:07:31,390 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:07:31,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 4/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-02-08 01:07:31,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 48 transitions, 110 flow [2025-02-08 01:07:31,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 43 transitions, 95 flow [2025-02-08 01:07:31,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:07:31,421 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ec104c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:07:31,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 01:07:31,442 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:07:31,442 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-02-08 01:07:31,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:07:31,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:31,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:31,444 INFO L396 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-02-08 01:07:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1546097117, now seen corresponding path program 1 times [2025-02-08 01:07:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298253649] [2025-02-08 01:07:31,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:31,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:07:31,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:07:31,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:31,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298253649] [2025-02-08 01:07:32,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298253649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:32,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:32,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:07:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186030029] [2025-02-08 01:07:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:32,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:07:32,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:32,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:07:32,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:07:32,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-02-08 01:07:32,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:33,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:33,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-02-08 01:07:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:33,553 INFO L124 PetriNetUnfolderBase]: 547/1079 cut-off events. [2025-02-08 01:07:33,554 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 01:07:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1079 events. 547/1079 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5302 event pairs, 242 based on Foata normal form. 51/1043 useless extension candidates. Maximal degree in co-relation 1991. Up to 509 conditions per place. [2025-02-08 01:07:33,566 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 62 selfloop transitions, 11 changer transitions 16/98 dead transitions. [2025-02-08 01:07:33,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 392 flow [2025-02-08 01:07:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:07:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:07:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-02-08 01:07:33,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 01:07:33,579 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 95 flow. Second operand 7 states and 182 transitions. [2025-02-08 01:07:33,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 392 flow [2025-02-08 01:07:33,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:07:33,588 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 152 flow [2025-02-08 01:07:33,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-02-08 01:07:33,595 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2025-02-08 01:07:33,595 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 152 flow [2025-02-08 01:07:33,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:33,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:33,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:33,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:07:33,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-02-08 01:07:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1544775500, now seen corresponding path program 1 times [2025-02-08 01:07:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:33,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82006455] [2025-02-08 01:07:33,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 01:07:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 01:07:33,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:33,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82006455] [2025-02-08 01:07:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82006455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:07:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782666609] [2025-02-08 01:07:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:34,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:07:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:34,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:07:34,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:07:34,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-02-08 01:07:34,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:34,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:34,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-02-08 01:07:34,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:35,898 INFO L124 PetriNetUnfolderBase]: 599/1171 cut-off events. [2025-02-08 01:07:35,898 INFO L125 PetriNetUnfolderBase]: For 531/559 co-relation queries the response was YES. [2025-02-08 01:07:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1171 events. 599/1171 cut-off events. For 531/559 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5999 event pairs, 151 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 2503. Up to 326 conditions per place. [2025-02-08 01:07:35,910 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 69 selfloop transitions, 14 changer transitions 51/144 dead transitions. [2025-02-08 01:07:35,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 144 transitions, 786 flow [2025-02-08 01:07:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:07:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:07:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2025-02-08 01:07:35,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:07:35,914 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 152 flow. Second operand 9 states and 216 transitions. [2025-02-08 01:07:35,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 144 transitions, 786 flow [2025-02-08 01:07:35,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 144 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:35,920 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 264 flow [2025-02-08 01:07:35,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-02-08 01:07:35,921 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2025-02-08 01:07:35,921 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 264 flow [2025-02-08 01:07:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:35,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:35,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:35,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:07:35,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-02-08 01:07:35,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 524002711, now seen corresponding path program 1 times [2025-02-08 01:07:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103723651] [2025-02-08 01:07:35,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:07:36,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:07:36,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103723651] [2025-02-08 01:07:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103723651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:07:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918184608] [2025-02-08 01:07:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:37,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:07:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:37,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:07:37,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:07:37,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:07:37,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:37,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:37,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:07:37,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:38,754 INFO L124 PetriNetUnfolderBase]: 641/1300 cut-off events. [2025-02-08 01:07:38,754 INFO L125 PetriNetUnfolderBase]: For 1419/1419 co-relation queries the response was YES. [2025-02-08 01:07:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 1300 events. 641/1300 cut-off events. For 1419/1419 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7086 event pairs, 102 based on Foata normal form. 8/1308 useless extension candidates. Maximal degree in co-relation 3811. Up to 307 conditions per place. [2025-02-08 01:07:38,766 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 74 selfloop transitions, 16 changer transitions 71/170 dead transitions. [2025-02-08 01:07:38,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 170 transitions, 1130 flow [2025-02-08 01:07:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 01:07:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 01:07:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 279 transitions. [2025-02-08 01:07:38,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2025-02-08 01:07:38,772 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 264 flow. Second operand 14 states and 279 transitions. [2025-02-08 01:07:38,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 170 transitions, 1130 flow [2025-02-08 01:07:38,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 170 transitions, 1128 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:07:38,790 INFO L231 Difference]: Finished difference. Result has 84 places, 54 transitions, 328 flow [2025-02-08 01:07:38,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=328, PETRI_PLACES=84, PETRI_TRANSITIONS=54} [2025-02-08 01:07:38,791 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places. [2025-02-08 01:07:38,791 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 54 transitions, 328 flow [2025-02-08 01:07:38,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:38,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:38,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:38,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:07:38,792 INFO L396 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-02-08 01:07:38,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash -213571701, now seen corresponding path program 1 times [2025-02-08 01:07:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:38,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100348425] [2025-02-08 01:07:38,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:38,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:07:38,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:07:38,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:38,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100348425] [2025-02-08 01:07:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100348425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:07:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77034747] [2025-02-08 01:07:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:40,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:07:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:40,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:07:40,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:07:40,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:07:40,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 54 transitions, 328 flow. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:40,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:40,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:07:40,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:46,652 INFO L124 PetriNetUnfolderBase]: 1274/2553 cut-off events. [2025-02-08 01:07:46,652 INFO L125 PetriNetUnfolderBase]: For 6008/6068 co-relation queries the response was YES. [2025-02-08 01:07:46,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9114 conditions, 2553 events. 1274/2553 cut-off events. For 6008/6068 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16467 event pairs, 120 based on Foata normal form. 51/2600 useless extension candidates. Maximal degree in co-relation 8304. Up to 460 conditions per place. [2025-02-08 01:07:46,679 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 121 selfloop transitions, 64 changer transitions 140/334 dead transitions. [2025-02-08 01:07:46,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 334 transitions, 2686 flow [2025-02-08 01:07:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 01:07:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-08 01:07:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 644 transitions. [2025-02-08 01:07:46,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3946078431372549 [2025-02-08 01:07:46,685 INFO L175 Difference]: Start difference. First operand has 84 places, 54 transitions, 328 flow. Second operand 34 states and 644 transitions. [2025-02-08 01:07:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 334 transitions, 2686 flow [2025-02-08 01:07:46,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 334 transitions, 2455 flow, removed 14 selfloop flow, removed 10 redundant places. [2025-02-08 01:07:46,718 INFO L231 Difference]: Finished difference. Result has 123 places, 108 transitions, 979 flow [2025-02-08 01:07:46,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=979, PETRI_PLACES=123, PETRI_TRANSITIONS=108} [2025-02-08 01:07:46,719 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 77 predicate places. [2025-02-08 01:07:46,719 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 979 flow [2025-02-08 01:07:46,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:46,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:46,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:07:46,721 INFO L396 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-02-08 01:07:46,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 9291179, now seen corresponding path program 2 times [2025-02-08 01:07:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144513654] [2025-02-08 01:07:46,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:07:46,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:46,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:07:46,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:07:46,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:07:46,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144513654] [2025-02-08 01:07:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144513654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 01:07:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96475159] [2025-02-08 01:07:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:07:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:07:51,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:07:51,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-08 01:07:51,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 979 flow. Second operand has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:51,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:51,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-08 01:07:51,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:54,026 INFO L124 PetriNetUnfolderBase]: 1297/2637 cut-off events. [2025-02-08 01:07:54,026 INFO L125 PetriNetUnfolderBase]: For 13447/13447 co-relation queries the response was YES. [2025-02-08 01:07:54,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11388 conditions, 2637 events. 1297/2637 cut-off events. For 13447/13447 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17136 event pairs, 108 based on Foata normal form. 8/2645 useless extension candidates. Maximal degree in co-relation 11221. Up to 538 conditions per place. [2025-02-08 01:07:54,054 INFO L140 encePairwiseOnDemand]: 30/48 looper letters, 156 selfloop transitions, 61 changer transitions 116/340 dead transitions. [2025-02-08 01:07:54,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 340 transitions, 3514 flow [2025-02-08 01:07:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 01:07:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 01:07:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 361 transitions. [2025-02-08 01:07:54,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37604166666666666 [2025-02-08 01:07:54,059 INFO L175 Difference]: Start difference. First operand has 123 places, 108 transitions, 979 flow. Second operand 20 states and 361 transitions. [2025-02-08 01:07:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 340 transitions, 3514 flow [2025-02-08 01:07:54,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 340 transitions, 3398 flow, removed 58 selfloop flow, removed 5 redundant places. [2025-02-08 01:07:54,120 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 1409 flow [2025-02-08 01:07:54,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1409, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2025-02-08 01:07:54,122 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places. [2025-02-08 01:07:54,124 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 1409 flow [2025-02-08 01:07:54,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:54,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:54,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:07:54,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-02-08 01:07:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1067083599, now seen corresponding path program 2 times [2025-02-08 01:07:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220606] [2025-02-08 01:07:54,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:07:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:54,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:07:54,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:07:54,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:07:54,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:07:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220606] [2025-02-08 01:07:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 01:07:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074701225] [2025-02-08 01:07:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:56,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 01:07:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:56,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 01:07:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:07:57,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-08 01:07:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 1409 flow. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:57,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:57,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-08 01:07:57,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:58,721 INFO L124 PetriNetUnfolderBase]: 925/1996 cut-off events. [2025-02-08 01:07:58,721 INFO L125 PetriNetUnfolderBase]: For 14292/14336 co-relation queries the response was YES. [2025-02-08 01:07:58,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9775 conditions, 1996 events. 925/1996 cut-off events. For 14292/14336 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12863 event pairs, 60 based on Foata normal form. 29/2021 useless extension candidates. Maximal degree in co-relation 9601. Up to 575 conditions per place. [2025-02-08 01:07:58,744 INFO L140 encePairwiseOnDemand]: 29/48 looper letters, 139 selfloop transitions, 62 changer transitions 77/285 dead transitions. [2025-02-08 01:07:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 285 transitions, 3434 flow [2025-02-08 01:07:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 01:07:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 01:07:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 407 transitions. [2025-02-08 01:07:58,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3686594202898551 [2025-02-08 01:07:58,746 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 1409 flow. Second operand 23 states and 407 transitions. [2025-02-08 01:07:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 285 transitions, 3434 flow [2025-02-08 01:07:58,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 285 transitions, 3100 flow, removed 83 selfloop flow, removed 13 redundant places. [2025-02-08 01:07:58,807 INFO L231 Difference]: Finished difference. Result has 154 places, 133 transitions, 1563 flow [2025-02-08 01:07:58,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1563, PETRI_PLACES=154, PETRI_TRANSITIONS=133} [2025-02-08 01:07:58,808 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 108 predicate places. [2025-02-08 01:07:58,808 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 133 transitions, 1563 flow [2025-02-08 01:07:58,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:58,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:58,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:07:58,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-02-08 01:07:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 916331151, now seen corresponding path program 3 times [2025-02-08 01:07:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752172222] [2025-02-08 01:07:58,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:07:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:58,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:07:58,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:07:58,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:07:58,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:59,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-02-08 01:07:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:59,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752172222] [2025-02-08 01:07:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752172222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:07:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18061736] [2025-02-08 01:07:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:59,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:07:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:59,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:07:59,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:07:59,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:07:59,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 1563 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:59,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:59,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:07:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:00,909 INFO L124 PetriNetUnfolderBase]: 570/1296 cut-off events. [2025-02-08 01:08:00,910 INFO L125 PetriNetUnfolderBase]: For 10747/10759 co-relation queries the response was YES. [2025-02-08 01:08:00,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1296 events. 570/1296 cut-off events. For 10747/10759 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7683 event pairs, 49 based on Foata normal form. 22/1316 useless extension candidates. Maximal degree in co-relation 6453. Up to 376 conditions per place. [2025-02-08 01:08:00,919 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 121 selfloop transitions, 45 changer transitions 43/220 dead transitions. [2025-02-08 01:08:00,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 220 transitions, 2755 flow [2025-02-08 01:08:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 01:08:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 01:08:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 280 transitions. [2025-02-08 01:08:00,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-08 01:08:00,921 INFO L175 Difference]: Start difference. First operand has 154 places, 133 transitions, 1563 flow. Second operand 14 states and 280 transitions. [2025-02-08 01:08:00,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 220 transitions, 2755 flow [2025-02-08 01:08:00,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 220 transitions, 2525 flow, removed 48 selfloop flow, removed 13 redundant places. [2025-02-08 01:08:00,965 INFO L231 Difference]: Finished difference. Result has 153 places, 124 transitions, 1407 flow [2025-02-08 01:08:00,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1407, PETRI_PLACES=153, PETRI_TRANSITIONS=124} [2025-02-08 01:08:00,966 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 107 predicate places. [2025-02-08 01:08:00,966 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 124 transitions, 1407 flow [2025-02-08 01:08:00,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:00,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:00,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:00,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:08:00,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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-02-08 01:08:00,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1810925369, now seen corresponding path program 3 times [2025-02-08 01:08:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:00,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548083842] [2025-02-08 01:08:00,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:08:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:01,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:01,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:01,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:08:01,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:04,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:04,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548083842] [2025-02-08 01:08:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548083842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-08 01:08:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867740491] [2025-02-08 01:08:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:04,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 01:08:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 01:08:04,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-02-08 01:08:04,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-08 01:08:04,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 124 transitions, 1407 flow. Second operand has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:04,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:04,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-08 01:08:04,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:06,900 INFO L124 PetriNetUnfolderBase]: 693/1490 cut-off events. [2025-02-08 01:08:06,900 INFO L125 PetriNetUnfolderBase]: For 11225/11235 co-relation queries the response was YES. [2025-02-08 01:08:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7379 conditions, 1490 events. 693/1490 cut-off events. For 11225/11235 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8643 event pairs, 28 based on Foata normal form. 13/1501 useless extension candidates. Maximal degree in co-relation 7222. Up to 307 conditions per place. [2025-02-08 01:08:06,912 INFO L140 encePairwiseOnDemand]: 31/48 looper letters, 118 selfloop transitions, 104 changer transitions 28/256 dead transitions. [2025-02-08 01:08:06,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 256 transitions, 3167 flow [2025-02-08 01:08:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 01:08:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 01:08:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 325 transitions. [2025-02-08 01:08:06,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32242063492063494 [2025-02-08 01:08:06,914 INFO L175 Difference]: Start difference. First operand has 153 places, 124 transitions, 1407 flow. Second operand 21 states and 325 transitions. [2025-02-08 01:08:06,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 256 transitions, 3167 flow [2025-02-08 01:08:06,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 256 transitions, 2813 flow, removed 75 selfloop flow, removed 14 redundant places. [2025-02-08 01:08:06,945 INFO L231 Difference]: Finished difference. Result has 160 places, 162 transitions, 1931 flow [2025-02-08 01:08:06,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1931, PETRI_PLACES=160, PETRI_TRANSITIONS=162} [2025-02-08 01:08:06,946 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 114 predicate places. [2025-02-08 01:08:06,946 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 162 transitions, 1931 flow [2025-02-08 01:08:06,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.277777777777779) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:06,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:06,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:06,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:08:06,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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-02-08 01:08:06,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash -877353299, now seen corresponding path program 4 times [2025-02-08 01:08:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:06,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787358944] [2025-02-08 01:08:06,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:08:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:06,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:08:07,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:07,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:08:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787358944] [2025-02-08 01:08:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787358944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:08:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778077978] [2025-02-08 01:08:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:08,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:08:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:08,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:08:08,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:08:08,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-02-08 01:08:08,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 162 transitions, 1931 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:08,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:08,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-02-08 01:08:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:09,537 INFO L124 PetriNetUnfolderBase]: 702/1637 cut-off events. [2025-02-08 01:08:09,537 INFO L125 PetriNetUnfolderBase]: For 12133/12143 co-relation queries the response was YES. [2025-02-08 01:08:09,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8190 conditions, 1637 events. 702/1637 cut-off events. For 12133/12143 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10583 event pairs, 50 based on Foata normal form. 12/1645 useless extension candidates. Maximal degree in co-relation 8038. Up to 427 conditions per place. [2025-02-08 01:08:09,553 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 154 selfloop transitions, 96 changer transitions 23/290 dead transitions. [2025-02-08 01:08:09,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 290 transitions, 3753 flow [2025-02-08 01:08:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 01:08:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 01:08:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 389 transitions. [2025-02-08 01:08:09,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40520833333333334 [2025-02-08 01:08:09,555 INFO L175 Difference]: Start difference. First operand has 160 places, 162 transitions, 1931 flow. Second operand 20 states and 389 transitions. [2025-02-08 01:08:09,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 290 transitions, 3753 flow [2025-02-08 01:08:09,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 290 transitions, 3631 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-02-08 01:08:09,594 INFO L231 Difference]: Finished difference. Result has 181 places, 194 transitions, 2593 flow [2025-02-08 01:08:09,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2593, PETRI_PLACES=181, PETRI_TRANSITIONS=194} [2025-02-08 01:08:09,595 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 135 predicate places. [2025-02-08 01:08:09,595 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 194 transitions, 2593 flow [2025-02-08 01:08:09,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:09,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:09,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:08:09,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-02-08 01:08:09,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1819143283, now seen corresponding path program 4 times [2025-02-08 01:08:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573617154] [2025-02-08 01:08:09,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:08:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:09,631 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:08:09,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:09,693 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:08:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:10,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573617154] [2025-02-08 01:08:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573617154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:10,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:08:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767547760] [2025-02-08 01:08:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:08:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:10,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:08:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:08:11,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-02-08 01:08:11,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 194 transitions, 2593 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:11,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:11,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-02-08 01:08:11,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:12,502 INFO L124 PetriNetUnfolderBase]: 837/1976 cut-off events. [2025-02-08 01:08:12,502 INFO L125 PetriNetUnfolderBase]: For 17940/17964 co-relation queries the response was YES. [2025-02-08 01:08:12,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10760 conditions, 1976 events. 837/1976 cut-off events. For 17940/17964 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13544 event pairs, 39 based on Foata normal form. 17/1991 useless extension candidates. Maximal degree in co-relation 10594. Up to 377 conditions per place. [2025-02-08 01:08:12,520 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 157 selfloop transitions, 142 changer transitions 33/349 dead transitions. [2025-02-08 01:08:12,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 349 transitions, 5059 flow [2025-02-08 01:08:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 01:08:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 01:08:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 435 transitions. [2025-02-08 01:08:12,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39402173913043476 [2025-02-08 01:08:12,522 INFO L175 Difference]: Start difference. First operand has 181 places, 194 transitions, 2593 flow. Second operand 23 states and 435 transitions. [2025-02-08 01:08:12,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 349 transitions, 5059 flow [2025-02-08 01:08:12,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 349 transitions, 4810 flow, removed 40 selfloop flow, removed 10 redundant places. [2025-02-08 01:08:12,584 INFO L231 Difference]: Finished difference. Result has 206 places, 249 transitions, 3769 flow [2025-02-08 01:08:12,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3769, PETRI_PLACES=206, PETRI_TRANSITIONS=249} [2025-02-08 01:08:12,585 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 160 predicate places. [2025-02-08 01:08:12,585 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 249 transitions, 3769 flow [2025-02-08 01:08:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:12,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:12,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:08:12,586 INFO L396 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-02-08 01:08:12,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1837336611, now seen corresponding path program 5 times [2025-02-08 01:08:12,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:12,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692463840] [2025-02-08 01:08:12,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:08:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:12,621 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:12,666 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:12,666 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:08:12,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692463840] [2025-02-08 01:08:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692463840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:08:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107819318] [2025-02-08 01:08:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:14,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:08:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:14,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:08:14,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:08:14,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:08:14,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 249 transitions, 3769 flow. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:14,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:14,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:08:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:15,687 INFO L124 PetriNetUnfolderBase]: 1027/2352 cut-off events. [2025-02-08 01:08:15,688 INFO L125 PetriNetUnfolderBase]: For 22890/22904 co-relation queries the response was YES. [2025-02-08 01:08:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13247 conditions, 2352 events. 1027/2352 cut-off events. For 22890/22904 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16573 event pairs, 55 based on Foata normal form. 27/2377 useless extension candidates. Maximal degree in co-relation 13070. Up to 525 conditions per place. [2025-02-08 01:08:15,709 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 170 selfloop transitions, 145 changer transitions 65/390 dead transitions. [2025-02-08 01:08:15,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 390 transitions, 6148 flow [2025-02-08 01:08:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 01:08:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 01:08:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 379 transitions. [2025-02-08 01:08:15,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3759920634920635 [2025-02-08 01:08:15,711 INFO L175 Difference]: Start difference. First operand has 206 places, 249 transitions, 3769 flow. Second operand 21 states and 379 transitions. [2025-02-08 01:08:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 390 transitions, 6148 flow [2025-02-08 01:08:15,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 390 transitions, 5999 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-02-08 01:08:15,822 INFO L231 Difference]: Finished difference. Result has 227 places, 270 transitions, 4364 flow [2025-02-08 01:08:15,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3687, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4364, PETRI_PLACES=227, PETRI_TRANSITIONS=270} [2025-02-08 01:08:15,823 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 181 predicate places. [2025-02-08 01:08:15,824 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 270 transitions, 4364 flow [2025-02-08 01:08:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:15,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:15,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:15,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:08:15,825 INFO L396 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-02-08 01:08:15,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1984438645, now seen corresponding path program 5 times [2025-02-08 01:08:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876689309] [2025-02-08 01:08:15,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:08:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:15,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:15,913 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:15,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:08:15,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876689309] [2025-02-08 01:08:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876689309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:08:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601611662] [2025-02-08 01:08:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:17,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:08:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:17,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:08:17,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:08:17,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:08:17,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 270 transitions, 4364 flow. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:17,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:17,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:08:17,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:18,440 INFO L124 PetriNetUnfolderBase]: 1074/2469 cut-off events. [2025-02-08 01:08:18,440 INFO L125 PetriNetUnfolderBase]: For 28130/28138 co-relation queries the response was YES. [2025-02-08 01:08:18,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 2469 events. 1074/2469 cut-off events. For 28130/28138 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 17645 event pairs, 68 based on Foata normal form. 48/2507 useless extension candidates. Maximal degree in co-relation 14815. Up to 485 conditions per place. [2025-02-08 01:08:18,465 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 160 selfloop transitions, 137 changer transitions 89/407 dead transitions. [2025-02-08 01:08:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 407 transitions, 6913 flow [2025-02-08 01:08:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 01:08:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 01:08:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 370 transitions. [2025-02-08 01:08:18,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-02-08 01:08:18,468 INFO L175 Difference]: Start difference. First operand has 227 places, 270 transitions, 4364 flow. Second operand 20 states and 370 transitions. [2025-02-08 01:08:18,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 407 transitions, 6913 flow [2025-02-08 01:08:18,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 407 transitions, 6563 flow, removed 34 selfloop flow, removed 19 redundant places. [2025-02-08 01:08:18,613 INFO L231 Difference]: Finished difference. Result has 224 places, 251 transitions, 4093 flow [2025-02-08 01:08:18,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4126, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4093, PETRI_PLACES=224, PETRI_TRANSITIONS=251} [2025-02-08 01:08:18,614 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 178 predicate places. [2025-02-08 01:08:18,616 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 251 transitions, 4093 flow [2025-02-08 01:08:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:18,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:18,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:18,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:08:18,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-02-08 01:08:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1441839245, now seen corresponding path program 6 times [2025-02-08 01:08:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893850626] [2025-02-08 01:08:18,617 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:08:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:18,650 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:18,709 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:18,709 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:08:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:22,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:22,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893850626] [2025-02-08 01:08:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893850626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 01:08:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279137104] [2025-02-08 01:08:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:08:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:22,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:08:22,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:08:22,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-08 01:08:22,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 251 transitions, 4093 flow. Second operand has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:22,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:22,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-08 01:08:22,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:24,860 INFO L124 PetriNetUnfolderBase]: 1045/2346 cut-off events. [2025-02-08 01:08:24,860 INFO L125 PetriNetUnfolderBase]: For 27637/27643 co-relation queries the response was YES. [2025-02-08 01:08:24,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14313 conditions, 2346 events. 1045/2346 cut-off events. For 27637/27643 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16008 event pairs, 145 based on Foata normal form. 28/2368 useless extension candidates. Maximal degree in co-relation 14124. Up to 991 conditions per place. [2025-02-08 01:08:24,881 INFO L140 encePairwiseOnDemand]: 30/48 looper letters, 184 selfloop transitions, 109 changer transitions 60/369 dead transitions. [2025-02-08 01:08:24,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 369 transitions, 6186 flow [2025-02-08 01:08:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:08:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:08:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 328 transitions. [2025-02-08 01:08:24,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2025-02-08 01:08:24,884 INFO L175 Difference]: Start difference. First operand has 224 places, 251 transitions, 4093 flow. Second operand 22 states and 328 transitions. [2025-02-08 01:08:24,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 369 transitions, 6186 flow [2025-02-08 01:08:24,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 369 transitions, 5824 flow, removed 15 selfloop flow, removed 18 redundant places. [2025-02-08 01:08:24,967 INFO L231 Difference]: Finished difference. Result has 237 places, 253 transitions, 4257 flow [2025-02-08 01:08:24,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3814, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4257, PETRI_PLACES=237, PETRI_TRANSITIONS=253} [2025-02-08 01:08:24,968 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 191 predicate places. [2025-02-08 01:08:24,968 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 253 transitions, 4257 flow [2025-02-08 01:08:24,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.352941176470589) internal successors, (176), 17 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:24,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:24,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:24,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:08:24,968 INFO L396 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-02-08 01:08:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1600770003, now seen corresponding path program 7 times [2025-02-08 01:08:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016452923] [2025-02-08 01:08:24,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:08:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:26,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-02-08 01:08:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016452923] [2025-02-08 01:08:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016452923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 01:08:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472320218] [2025-02-08 01:08:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:08:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:08:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:08:26,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-02-08 01:08:26,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 253 transitions, 4257 flow. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:26,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:26,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-02-08 01:08:26,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:27,429 INFO L124 PetriNetUnfolderBase]: 954/2221 cut-off events. [2025-02-08 01:08:27,429 INFO L125 PetriNetUnfolderBase]: For 28715/28721 co-relation queries the response was YES. [2025-02-08 01:08:27,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13903 conditions, 2221 events. 954/2221 cut-off events. For 28715/28721 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15559 event pairs, 142 based on Foata normal form. 16/2227 useless extension candidates. Maximal degree in co-relation 13706. Up to 880 conditions per place. [2025-02-08 01:08:27,446 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 195 selfloop transitions, 98 changer transitions 28/343 dead transitions. [2025-02-08 01:08:27,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 343 transitions, 6008 flow [2025-02-08 01:08:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:08:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-08 01:08:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 270 transitions. [2025-02-08 01:08:27,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-02-08 01:08:27,448 INFO L175 Difference]: Start difference. First operand has 237 places, 253 transitions, 4257 flow. Second operand 15 states and 270 transitions. [2025-02-08 01:08:27,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 343 transitions, 6008 flow [2025-02-08 01:08:27,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 343 transitions, 5853 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-02-08 01:08:27,571 INFO L231 Difference]: Finished difference. Result has 246 places, 264 transitions, 4588 flow [2025-02-08 01:08:27,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4127, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4588, PETRI_PLACES=246, PETRI_TRANSITIONS=264} [2025-02-08 01:08:27,572 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 200 predicate places. [2025-02-08 01:08:27,572 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 264 transitions, 4588 flow [2025-02-08 01:08:27,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:27,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:27,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:27,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:08:27,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-02-08 01:08:27,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1078563121, now seen corresponding path program 6 times [2025-02-08 01:08:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562266628] [2025-02-08 01:08:27,573 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:08:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:27,605 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:08:27,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:08:27,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:08:27,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562266628] [2025-02-08 01:08:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562266628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:29,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 01:08:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585063117] [2025-02-08 01:08:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:08:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:08:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:08:30,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-08 01:08:30,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 264 transitions, 4588 flow. Second operand has 17 states, 17 states have (on average 11.352941176470589) internal successors, (193), 17 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:30,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:30,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-08 01:08:30,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:32,309 INFO L124 PetriNetUnfolderBase]: 911/2040 cut-off events. [2025-02-08 01:08:32,309 INFO L125 PetriNetUnfolderBase]: For 27108/27126 co-relation queries the response was YES. [2025-02-08 01:08:32,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13118 conditions, 2040 events. 911/2040 cut-off events. For 27108/27126 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13487 event pairs, 31 based on Foata normal form. 17/2047 useless extension candidates. Maximal degree in co-relation 12904. Up to 533 conditions per place. [2025-02-08 01:08:32,326 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 129 selfloop transitions, 165 changer transitions 42/346 dead transitions. [2025-02-08 01:08:32,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 346 transitions, 6012 flow [2025-02-08 01:08:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 01:08:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 01:08:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 331 transitions. [2025-02-08 01:08:32,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32837301587301587 [2025-02-08 01:08:32,328 INFO L175 Difference]: Start difference. First operand has 246 places, 264 transitions, 4588 flow. Second operand 21 states and 331 transitions. [2025-02-08 01:08:32,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 346 transitions, 6012 flow