./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:20:57,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:20:57,470 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 04:20:57,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:20:57,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:20:57,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:20:57,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:20:57,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:20:57,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:20:57,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:20:57,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:20:57,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:20:57,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:20:57,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:20:57,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:20:57,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:20:57,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:20:57,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:20:57,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:20:57,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:20:57,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:20:57,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:20:57,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:20:57,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:20:57,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:20:57,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:20:57,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:20:57,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:20:57,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:20:57,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:20:57,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:20:57,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:20:57,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:20:57,545 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cf9a63e6b69549a73ec0cdf90051f21ab19a39a485979f4709a706d3ba6e298 [2024-11-28 04:20:58,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:20:58,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:20:58,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:20:58,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:20:58,026 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:20:58,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-28 04:21:01,974 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/data/672dfd763/1601a3a671da4c389ee444ea5d970ff8/FLAGc8e0e4472 [2024-11-28 04:21:03,062 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:21:03,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-28 04:21:03,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/data/672dfd763/1601a3a671da4c389ee444ea5d970ff8/FLAGc8e0e4472 [2024-11-28 04:21:03,194 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/data/672dfd763/1601a3a671da4c389ee444ea5d970ff8 [2024-11-28 04:21:03,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:21:03,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:21:03,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:21:03,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:21:03,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:21:03,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:21:03" (1/1) ... [2024-11-28 04:21:03,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6190abac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:03, skipping insertion in model container [2024-11-28 04:21:03,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:21:03" (1/1) ... [2024-11-28 04:21:03,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:21:11,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:21:11,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:21:11,559 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] [2024-11-28 04:21:11,562 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] [2024-11-28 04:21:11,564 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] [2024-11-28 04:21:11,565 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] [2024-11-28 04:21:11,749 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2024-11-28 04:21:11,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:21:12,520 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:21:12,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12 WrapperNode [2024-11-28 04:21:12,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:21:12,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:21:12,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:21:12,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:21:12,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,745 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2024-11-28 04:21:12,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:21:12,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:21:12,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:21:12,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:21:12,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:21:12,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:21:12,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:21:12,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:21:12,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (1/1) ... [2024-11-28 04:21:12,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:21:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:21:12,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:21:12,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:21:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 04:21:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:21:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-11-28 04:21:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-11-28 04:21:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:21:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:21:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:21:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 04:21:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2024-11-28 04:21:12,978 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2024-11-28 04:21:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 04:21:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 04:21:12,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 04:21:12,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 04:21:12,982 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 04:21:13,828 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:21:13,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:21:15,195 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 04:21:15,195 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:21:15,313 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:21:15,313 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 04:21:15,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:21:15 BoogieIcfgContainer [2024-11-28 04:21:15,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:21:15,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:21:15,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:21:15,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:21:15,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:21:03" (1/3) ... [2024-11-28 04:21:15,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:21:15, skipping insertion in model container [2024-11-28 04:21:15,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:21:12" (2/3) ... [2024-11-28 04:21:15,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e60595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:21:15, skipping insertion in model container [2024-11-28 04:21:15,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:21:15" (3/3) ... [2024-11-28 04:21:15,339 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-28 04:21:15,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:21:15,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i that has 3 procedures, 575 locations, 1 initial locations, 1 loop locations, and 41 error locations. [2024-11-28 04:21:15,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 04:21:15,650 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 04:21:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 581 places, 587 transitions, 1188 flow [2024-11-28 04:21:16,195 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2024-11-28 04:21:16,200 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 04:21:16,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 585 events. 13/585 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 579 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 516. Up to 4 conditions per place. [2024-11-28 04:21:16,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 581 places, 587 transitions, 1188 flow [2024-11-28 04:21:16,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 581 transitions, 1171 flow [2024-11-28 04:21:16,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:21:16,284 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;@23b9561a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:21:16,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-28 04:21:16,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 04:21:16,334 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-11-28 04:21:16,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 04:21:16,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:16,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:16,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1868452534, now seen corresponding path program 1 times [2024-11-28 04:21:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032388719] [2024-11-28 04:21:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:17,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:17,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032388719] [2024-11-28 04:21:17,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032388719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:17,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561821933] [2024-11-28 04:21:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:17,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:17,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:17,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:17,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:17,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:17,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:17,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:17,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:17,763 INFO L124 PetriNetUnfolderBase]: 13/613 cut-off events. [2024-11-28 04:21:17,763 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-28 04:21:17,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 613 events. 13/613 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 817 event pairs, 2 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 515. Up to 13 conditions per place. [2024-11-28 04:21:17,776 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 8 selfloop transitions, 2 changer transitions 1/571 dead transitions. [2024-11-28 04:21:17,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 571 transitions, 1171 flow [2024-11-28 04:21:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2024-11-28 04:21:17,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744463373083475 [2024-11-28 04:21:17,816 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1716 transitions. [2024-11-28 04:21:17,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 571 transitions, 1171 flow [2024-11-28 04:21:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 571 transitions, 1166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 04:21:17,858 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1148 flow [2024-11-28 04:21:17,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=568, PETRI_TRANSITIONS=570} [2024-11-28 04:21:17,868 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -7 predicate places. [2024-11-28 04:21:17,868 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1148 flow [2024-11-28 04:21:17,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:17,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:17,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:17,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:21:17,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:17,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 383396254, now seen corresponding path program 1 times [2024-11-28 04:21:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826164969] [2024-11-28 04:21:17,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826164969] [2024-11-28 04:21:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826164969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282067880] [2024-11-28 04:21:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:18,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:18,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:18,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:18,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:18,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:18,364 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2024-11-28 04:21:18,364 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 611 events. 13/611 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 815 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 538. Up to 13 conditions per place. [2024-11-28 04:21:18,370 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2024-11-28 04:21:18,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 569 transitions, 1166 flow [2024-11-28 04:21:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:18,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:18,377 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1148 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:18,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 569 transitions, 1166 flow [2024-11-28 04:21:18,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:18,392 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1146 flow [2024-11-28 04:21:18,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1146, PETRI_PLACES=566, PETRI_TRANSITIONS=569} [2024-11-28 04:21:18,394 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -9 predicate places. [2024-11-28 04:21:18,394 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1146 flow [2024-11-28 04:21:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:18,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:18,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:21:18,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1627991755, now seen corresponding path program 1 times [2024-11-28 04:21:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849810571] [2024-11-28 04:21:18,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849810571] [2024-11-28 04:21:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849810571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894348506] [2024-11-28 04:21:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:18,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:18,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:18,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:18,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 569 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:18,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:18,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:18,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:18,802 INFO L124 PetriNetUnfolderBase]: 13/610 cut-off events. [2024-11-28 04:21:18,803 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 610 events. 13/610 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 815 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 530. Up to 13 conditions per place. [2024-11-28 04:21:18,810 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2024-11-28 04:21:18,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2024-11-28 04:21:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:18,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:18,819 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1146 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2024-11-28 04:21:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:18,830 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2024-11-28 04:21:18,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=565, PETRI_TRANSITIONS=568} [2024-11-28 04:21:18,832 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -10 predicate places. [2024-11-28 04:21:18,832 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2024-11-28 04:21:18,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:18,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:18,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:18,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:21:18,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 997935529, now seen corresponding path program 1 times [2024-11-28 04:21:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187372414] [2024-11-28 04:21:18,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187372414] [2024-11-28 04:21:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187372414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598181300] [2024-11-28 04:21:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:18,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:18,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:19,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-28 04:21:19,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 568 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:19,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:19,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-28 04:21:19,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:19,366 INFO L124 PetriNetUnfolderBase]: 29/1066 cut-off events. [2024-11-28 04:21:19,366 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:21:19,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 1066 events. 29/1066 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2994 event pairs, 5 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 988. Up to 20 conditions per place. [2024-11-28 04:21:19,373 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-11-28 04:21:19,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2024-11-28 04:21:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-28 04:21:19,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-28 04:21:19,381 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1707 transitions. [2024-11-28 04:21:19,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2024-11-28 04:21:19,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:19,396 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2024-11-28 04:21:19,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2024-11-28 04:21:19,401 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -11 predicate places. [2024-11-28 04:21:19,401 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2024-11-28 04:21:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:19,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:19,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:19,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:21:19,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:19,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1852725899, now seen corresponding path program 1 times [2024-11-28 04:21:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:19,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361102986] [2024-11-28 04:21:19,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:19,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361102986] [2024-11-28 04:21:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361102986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554583103] [2024-11-28 04:21:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:19,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:19,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:19,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:19,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:19,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:19,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:19,789 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2024-11-28 04:21:19,789 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:19,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 608 events. 13/608 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 514. Up to 13 conditions per place. [2024-11-28 04:21:19,793 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2024-11-28 04:21:19,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2024-11-28 04:21:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:19,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:19,802 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:19,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2024-11-28 04:21:19,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:19,815 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2024-11-28 04:21:19,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=563, PETRI_TRANSITIONS=566} [2024-11-28 04:21:19,817 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -12 predicate places. [2024-11-28 04:21:19,819 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2024-11-28 04:21:19,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:19,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:19,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:19,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:21:19,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:19,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1600199409, now seen corresponding path program 1 times [2024-11-28 04:21:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:19,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949738502] [2024-11-28 04:21:19,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:19,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:19,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949738502] [2024-11-28 04:21:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949738502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:19,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:19,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964222943] [2024-11-28 04:21:19,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:19,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:19,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:19,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:20,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-28 04:21:20,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 566 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:20,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:20,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-28 04:21:20,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:20,156 INFO L124 PetriNetUnfolderBase]: 14/627 cut-off events. [2024-11-28 04:21:20,156 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-28 04:21:20,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 627 events. 14/627 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 905 event pairs, 3 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 529. Up to 16 conditions per place. [2024-11-28 04:21:20,161 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2024-11-28 04:21:20,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1160 flow [2024-11-28 04:21:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-28 04:21:20,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-28 04:21:20,167 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1707 transitions. [2024-11-28 04:21:20,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1160 flow [2024-11-28 04:21:20,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:20,178 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2024-11-28 04:21:20,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1138, PETRI_PLACES=562, PETRI_TRANSITIONS=565} [2024-11-28 04:21:20,181 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -13 predicate places. [2024-11-28 04:21:20,181 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2024-11-28 04:21:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:20,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:20,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:21:20,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -948262792, now seen corresponding path program 1 times [2024-11-28 04:21:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904403551] [2024-11-28 04:21:20,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904403551] [2024-11-28 04:21:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904403551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:20,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300327056] [2024-11-28 04:21:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:20,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:20,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:20,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:20,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:20,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:20,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 565 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:20,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:20,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:20,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:20,523 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2024-11-28 04:21:20,523 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:20,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 606 events. 13/606 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 808 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 498. Up to 13 conditions per place. [2024-11-28 04:21:20,527 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-11-28 04:21:20,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2024-11-28 04:21:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:20,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:20,534 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:20,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2024-11-28 04:21:20,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:20,549 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2024-11-28 04:21:20,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=561, PETRI_TRANSITIONS=564} [2024-11-28 04:21:20,551 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -14 predicate places. [2024-11-28 04:21:20,552 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2024-11-28 04:21:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:20,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:20,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:21:20,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1755385402, now seen corresponding path program 1 times [2024-11-28 04:21:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:20,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454481461] [2024-11-28 04:21:20,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454481461] [2024-11-28 04:21:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454481461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709405200] [2024-11-28 04:21:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:20,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:20,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:20,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:20,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:20,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:20,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:20,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:20,970 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2024-11-28 04:21:20,971 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:20,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 605 events. 13/605 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 817 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 490. Up to 13 conditions per place. [2024-11-28 04:21:20,976 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-28 04:21:20,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2024-11-28 04:21:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:20,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:20,987 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2024-11-28 04:21:20,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:21,003 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2024-11-28 04:21:21,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2024-11-28 04:21:21,005 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-11-28 04:21:21,007 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2024-11-28 04:21:21,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:21,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:21,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:21:21,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 703271396, now seen corresponding path program 1 times [2024-11-28 04:21:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298263209] [2024-11-28 04:21:21,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298263209] [2024-11-28 04:21:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298263209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:21,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725948963] [2024-11-28 04:21:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:21,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:21,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:21,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:21,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:21,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:21,416 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2024-11-28 04:21:21,416 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 604 events. 13/604 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 482. Up to 13 conditions per place. [2024-11-28 04:21:21,421 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-11-28 04:21:21,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2024-11-28 04:21:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:21,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:21,428 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:21,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2024-11-28 04:21:21,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:21,443 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2024-11-28 04:21:21,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=559, PETRI_TRANSITIONS=562} [2024-11-28 04:21:21,447 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -16 predicate places. [2024-11-28 04:21:21,447 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2024-11-28 04:21:21,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:21,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:21,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:21:21,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:21,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1856580635, now seen corresponding path program 1 times [2024-11-28 04:21:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:21,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711043255] [2024-11-28 04:21:21,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711043255] [2024-11-28 04:21:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711043255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474634107] [2024-11-28 04:21:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:21,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:21,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:21,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:21,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:21,878 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2024-11-28 04:21:21,878 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:21,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 603 events. 13/603 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 474. Up to 13 conditions per place. [2024-11-28 04:21:21,882 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2024-11-28 04:21:21,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2024-11-28 04:21:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:21,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:21,888 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:21,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2024-11-28 04:21:21,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:21,899 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2024-11-28 04:21:21,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=558, PETRI_TRANSITIONS=561} [2024-11-28 04:21:21,901 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -17 predicate places. [2024-11-28 04:21:21,901 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2024-11-28 04:21:21,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:21,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:21,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:21,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:21:21,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 556897494, now seen corresponding path program 1 times [2024-11-28 04:21:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211859601] [2024-11-28 04:21:21,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211859601] [2024-11-28 04:21:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211859601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595040699] [2024-11-28 04:21:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:22,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:22,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:22,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:22,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:22,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:22,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:22,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:22,213 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2024-11-28 04:21:22,213 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:22,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 602 events. 13/602 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 813 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 466. Up to 13 conditions per place. [2024-11-28 04:21:22,217 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-11-28 04:21:22,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2024-11-28 04:21:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:22,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:22,223 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2024-11-28 04:21:22,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:22,235 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2024-11-28 04:21:22,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=557, PETRI_TRANSITIONS=560} [2024-11-28 04:21:22,237 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -18 predicate places. [2024-11-28 04:21:22,237 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2024-11-28 04:21:22,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:22,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:22,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:22,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:21:22,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:22,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash -866413354, now seen corresponding path program 1 times [2024-11-28 04:21:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658607480] [2024-11-28 04:21:22,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658607480] [2024-11-28 04:21:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658607480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604497749] [2024-11-28 04:21:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:22,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:22,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-28 04:21:22,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:22,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:22,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-28 04:21:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:22,677 INFO L124 PetriNetUnfolderBase]: 29/1049 cut-off events. [2024-11-28 04:21:22,677 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:21:22,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 1049 events. 29/1049 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2972 event pairs, 5 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 915. Up to 20 conditions per place. [2024-11-28 04:21:22,683 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-28 04:21:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1148 flow [2024-11-28 04:21:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-28 04:21:22,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-28 04:21:22,688 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1707 transitions. [2024-11-28 04:21:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1148 flow [2024-11-28 04:21:22,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:22,699 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2024-11-28 04:21:22,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=556, PETRI_TRANSITIONS=559} [2024-11-28 04:21:22,701 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-11-28 04:21:22,701 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2024-11-28 04:21:22,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 566.3333333333334) internal successors, (1699), 3 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:22,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:22,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:22,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:21:22,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:22,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 408865890, now seen corresponding path program 1 times [2024-11-28 04:21:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439127095] [2024-11-28 04:21:22,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439127095] [2024-11-28 04:21:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439127095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523370075] [2024-11-28 04:21:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:22,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:22,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:22,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:22,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:22,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:22,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:22,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:22,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:23,032 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2024-11-28 04:21:23,032 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:23,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 600 events. 13/600 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 450. Up to 13 conditions per place. [2024-11-28 04:21:23,037 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-28 04:21:23,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2024-11-28 04:21:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:23,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:23,042 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:23,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2024-11-28 04:21:23,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:23,054 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2024-11-28 04:21:23,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2024-11-28 04:21:23,056 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -20 predicate places. [2024-11-28 04:21:23,056 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2024-11-28 04:21:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:23,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:23,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:21:23,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:23,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1745363436, now seen corresponding path program 1 times [2024-11-28 04:21:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:23,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156666682] [2024-11-28 04:21:23,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156666682] [2024-11-28 04:21:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156666682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623294851] [2024-11-28 04:21:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:23,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:23,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:23,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:23,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:23,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:23,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:23,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:23,378 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2024-11-28 04:21:23,378 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:23,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 599 events. 13/599 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 442. Up to 13 conditions per place. [2024-11-28 04:21:23,382 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-11-28 04:21:23,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2024-11-28 04:21:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:23,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:23,388 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:23,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2024-11-28 04:21:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:23,399 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2024-11-28 04:21:23,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2024-11-28 04:21:23,400 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -21 predicate places. [2024-11-28 04:21:23,401 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2024-11-28 04:21:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:23,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:21:23,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash -392305167, now seen corresponding path program 1 times [2024-11-28 04:21:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825334855] [2024-11-28 04:21:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825334855] [2024-11-28 04:21:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825334855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007532725] [2024-11-28 04:21:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:23,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:23,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:23,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:23,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:23,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:23,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:23,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:23,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:23,717 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2024-11-28 04:21:23,717 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:23,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 598 events. 13/598 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 810 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 434. Up to 13 conditions per place. [2024-11-28 04:21:23,722 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-28 04:21:23,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2024-11-28 04:21:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:23,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:23,728 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:23,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2024-11-28 04:21:23,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:23,741 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2024-11-28 04:21:23,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2024-11-28 04:21:23,742 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -22 predicate places. [2024-11-28 04:21:23,743 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2024-11-28 04:21:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:23,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:23,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:21:23,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:23,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1088648328, now seen corresponding path program 1 times [2024-11-28 04:21:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385024828] [2024-11-28 04:21:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385024828] [2024-11-28 04:21:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385024828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:24,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:24,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504569090] [2024-11-28 04:21:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:24,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:24,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:24,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:24,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:24,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:24,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:24,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:24,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:24,260 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2024-11-28 04:21:24,261 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:24,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 597 events. 13/597 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 809 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 426. Up to 13 conditions per place. [2024-11-28 04:21:24,265 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2024-11-28 04:21:24,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2024-11-28 04:21:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-28 04:21:24,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-28 04:21:24,272 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1709 transitions. [2024-11-28 04:21:24,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2024-11-28 04:21:24,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:24,284 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2024-11-28 04:21:24,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=552, PETRI_TRANSITIONS=555} [2024-11-28 04:21:24,286 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -23 predicate places. [2024-11-28 04:21:24,286 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2024-11-28 04:21:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.3333333333334) internal successors, (1702), 3 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:24,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:24,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:24,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:21:24,289 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:24,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1648074247, now seen corresponding path program 1 times [2024-11-28 04:21:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913136562] [2024-11-28 04:21:24,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913136562] [2024-11-28 04:21:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913136562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:24,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21374020] [2024-11-28 04:21:24,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:24,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:24,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:24,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 587 [2024-11-28 04:21:24,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 555 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:24,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:24,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 587 [2024-11-28 04:21:24,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:24,704 INFO L124 PetriNetUnfolderBase]: 18/662 cut-off events. [2024-11-28 04:21:24,704 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:24,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 662 events. 18/662 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1142 event pairs, 5 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 494. Up to 21 conditions per place. [2024-11-28 04:21:24,711 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 10 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2024-11-28 04:21:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1140 flow [2024-11-28 04:21:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-11-28 04:21:24,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-11-28 04:21:24,717 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1705 transitions. [2024-11-28 04:21:24,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1140 flow [2024-11-28 04:21:24,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:24,730 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2024-11-28 04:21:24,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2024-11-28 04:21:24,731 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -24 predicate places. [2024-11-28 04:21:24,731 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2024-11-28 04:21:24,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.3333333333334) internal successors, (1696), 3 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:24,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:24,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:24,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:21:24,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2104513640, now seen corresponding path program 1 times [2024-11-28 04:21:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817414372] [2024-11-28 04:21:24,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:24,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817414372] [2024-11-28 04:21:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817414372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128332837] [2024-11-28 04:21:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:24,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:24,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:24,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:24,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-28 04:21:24,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:24,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:24,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-28 04:21:24,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:25,202 INFO L124 PetriNetUnfolderBase]: 34/1084 cut-off events. [2024-11-28 04:21:25,202 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 04:21:25,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1084 events. 34/1084 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3251 event pairs, 8 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 915. Up to 25 conditions per place. [2024-11-28 04:21:25,210 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-11-28 04:21:25,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2024-11-28 04:21:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2024-11-28 04:21:25,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710391822827938 [2024-11-28 04:21:25,215 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1710 transitions. [2024-11-28 04:21:25,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2024-11-28 04:21:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:25,227 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1110 flow [2024-11-28 04:21:25,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=549, PETRI_TRANSITIONS=552} [2024-11-28 04:21:25,229 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -26 predicate places. [2024-11-28 04:21:25,229 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1110 flow [2024-11-28 04:21:25,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 567.0) internal successors, (1701), 3 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:25,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:25,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:25,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:21:25,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1100205178, now seen corresponding path program 1 times [2024-11-28 04:21:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122729704] [2024-11-28 04:21:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122729704] [2024-11-28 04:21:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122729704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:21:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319980905] [2024-11-28 04:21:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:21:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:29,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:21:29,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:21:30,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 587 [2024-11-28 04:21:30,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 552 transitions, 1110 flow. Second operand has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 587 [2024-11-28 04:21:30,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:30,893 INFO L124 PetriNetUnfolderBase]: 126/1121 cut-off events. [2024-11-28 04:21:30,893 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-28 04:21:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1121 events. 126/1121 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5256 event pairs, 98 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1233. Up to 242 conditions per place. [2024-11-28 04:21:30,903 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 42 selfloop transitions, 9 changer transitions 0/551 dead transitions. [2024-11-28 04:21:30,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 551 transitions, 1210 flow [2024-11-28 04:21:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:21:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 04:21:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5302 transitions. [2024-11-28 04:21:30,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903236797274276 [2024-11-28 04:21:30,921 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1110 flow. Second operand 10 states and 5302 transitions. [2024-11-28 04:21:30,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 551 transitions, 1210 flow [2024-11-28 04:21:30,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 551 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:30,934 INFO L231 Difference]: Finished difference. Result has 556 places, 551 transitions, 1125 flow [2024-11-28 04:21:30,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1125, PETRI_PLACES=556, PETRI_TRANSITIONS=551} [2024-11-28 04:21:30,935 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-11-28 04:21:30,935 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 551 transitions, 1125 flow [2024-11-28 04:21:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 526.3) internal successors, (5263), 10 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:30,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:30,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:21:30,942 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1189561870, now seen corresponding path program 1 times [2024-11-28 04:21:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516072219] [2024-11-28 04:21:30,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516072219] [2024-11-28 04:21:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516072219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395809213] [2024-11-28 04:21:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:31,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:31,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:31,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-28 04:21:31,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 551 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:31,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:31,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-28 04:21:31,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:31,422 INFO L124 PetriNetUnfolderBase]: 22/678 cut-off events. [2024-11-28 04:21:31,423 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-28 04:21:31,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 678 events. 22/678 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1290 event pairs, 9 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 521. Up to 31 conditions per place. [2024-11-28 04:21:31,428 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-28 04:21:31,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 550 transitions, 1151 flow [2024-11-28 04:21:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2024-11-28 04:21:31,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659284497444633 [2024-11-28 04:21:31,434 INFO L175 Difference]: Start difference. First operand has 556 places, 551 transitions, 1125 flow. Second operand 3 states and 1701 transitions. [2024-11-28 04:21:31,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 550 transitions, 1151 flow [2024-11-28 04:21:31,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1133 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-28 04:21:31,446 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1109 flow [2024-11-28 04:21:31,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=548, PETRI_TRANSITIONS=550} [2024-11-28 04:21:31,448 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -27 predicate places. [2024-11-28 04:21:31,448 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1109 flow [2024-11-28 04:21:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:31,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:31,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:21:31,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:31,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1481215302, now seen corresponding path program 1 times [2024-11-28 04:21:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:31,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488155750] [2024-11-28 04:21:31,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:21:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488155750] [2024-11-28 04:21:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488155750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221085957] [2024-11-28 04:21:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:31,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:31,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:31,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:31,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 587 [2024-11-28 04:21:31,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 550 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:31,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:31,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 587 [2024-11-28 04:21:31,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:31,950 INFO L124 PetriNetUnfolderBase]: 45/1044 cut-off events. [2024-11-28 04:21:31,950 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-28 04:21:31,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1044 events. 45/1044 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3609 event pairs, 20 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 905. Up to 53 conditions per place. [2024-11-28 04:21:31,957 INFO L140 encePairwiseOnDemand]: 582/587 looper letters, 13 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2024-11-28 04:21:31,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 546 transitions, 1129 flow [2024-11-28 04:21:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2024-11-28 04:21:31,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642248722316865 [2024-11-28 04:21:31,963 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1109 flow. Second operand 3 states and 1698 transitions. [2024-11-28 04:21:31,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 546 transitions, 1129 flow [2024-11-28 04:21:31,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 546 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:32,015 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1099 flow [2024-11-28 04:21:32,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=546} [2024-11-28 04:21:32,017 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-28 04:21:32,017 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1099 flow [2024-11-28 04:21:32,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:32,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:32,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:21:32,018 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1892750420, now seen corresponding path program 1 times [2024-11-28 04:21:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858952939] [2024-11-28 04:21:32,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858952939] [2024-11-28 04:21:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858952939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:32,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:32,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511265280] [2024-11-28 04:21:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:32,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:32,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:32,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:32,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 587 [2024-11-28 04:21:32,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 546 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:32,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:32,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 587 [2024-11-28 04:21:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:32,411 INFO L124 PetriNetUnfolderBase]: 13/587 cut-off events. [2024-11-28 04:21:32,411 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:32,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 587 events. 13/587 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 789 event pairs, 2 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 400. Up to 11 conditions per place. [2024-11-28 04:21:32,420 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 6 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2024-11-28 04:21:32,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1111 flow [2024-11-28 04:21:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1718 transitions. [2024-11-28 04:21:32,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755820556501987 [2024-11-28 04:21:32,426 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1099 flow. Second operand 3 states and 1718 transitions. [2024-11-28 04:21:32,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1111 flow [2024-11-28 04:21:32,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 545 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:32,438 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1098 flow [2024-11-28 04:21:32,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1098, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2024-11-28 04:21:32,440 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-28 04:21:32,440 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1098 flow [2024-11-28 04:21:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:32,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:32,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:32,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 04:21:32,442 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1377557941, now seen corresponding path program 1 times [2024-11-28 04:21:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539692534] [2024-11-28 04:21:32,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539692534] [2024-11-28 04:21:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539692534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099608171] [2024-11-28 04:21:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:32,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:32,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:32,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:32,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-28 04:21:32,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1098 flow. Second operand has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:32,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:32,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-28 04:21:32,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:32,880 INFO L124 PetriNetUnfolderBase]: 23/714 cut-off events. [2024-11-28 04:21:32,880 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-28 04:21:32,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 714 events. 23/714 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1595 event pairs, 8 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 552. Up to 30 conditions per place. [2024-11-28 04:21:32,886 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 13 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-11-28 04:21:32,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 544 transitions, 1126 flow [2024-11-28 04:21:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2024-11-28 04:21:32,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966496308915389 [2024-11-28 04:21:32,893 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1098 flow. Second operand 3 states and 1702 transitions. [2024-11-28 04:21:32,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 544 transitions, 1126 flow [2024-11-28 04:21:32,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 544 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:32,905 INFO L231 Difference]: Finished difference. Result has 544 places, 544 transitions, 1099 flow [2024-11-28 04:21:32,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=544, PETRI_TRANSITIONS=544} [2024-11-28 04:21:32,906 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-28 04:21:32,907 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 544 transitions, 1099 flow [2024-11-28 04:21:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.3333333333334) internal successors, (1690), 3 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:32,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:32,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 04:21:32,908 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:32,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:32,910 INFO L85 PathProgramCache]: Analyzing trace with hash 20257327, now seen corresponding path program 1 times [2024-11-28 04:21:32,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262516668] [2024-11-28 04:21:32,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262516668] [2024-11-28 04:21:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262516668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:33,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029636225] [2024-11-28 04:21:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:33,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:33,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:33,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:33,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-28 04:21:33,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 544 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:33,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:33,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-28 04:21:33,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:33,444 INFO L124 PetriNetUnfolderBase]: 44/1078 cut-off events. [2024-11-28 04:21:33,444 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-28 04:21:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 1078 events. 44/1078 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3643 event pairs, 2 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 983. Up to 43 conditions per place. [2024-11-28 04:21:33,453 INFO L140 encePairwiseOnDemand]: 581/587 looper letters, 16 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2024-11-28 04:21:33,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 547 transitions, 1147 flow [2024-11-28 04:21:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2024-11-28 04:21:33,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699034639409426 [2024-11-28 04:21:33,459 INFO L175 Difference]: Start difference. First operand has 544 places, 544 transitions, 1099 flow. Second operand 3 states and 1708 transitions. [2024-11-28 04:21:33,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 547 transitions, 1147 flow [2024-11-28 04:21:33,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 547 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:21:33,474 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1102 flow [2024-11-28 04:21:33,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=542, PETRI_TRANSITIONS=542} [2024-11-28 04:21:33,476 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-11-28 04:21:33,476 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1102 flow [2024-11-28 04:21:33,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:33,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:33,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:33,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 04:21:33,478 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:33,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash -481240162, now seen corresponding path program 1 times [2024-11-28 04:21:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:33,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16842302] [2024-11-28 04:21:33,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16842302] [2024-11-28 04:21:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16842302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:33,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:33,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7224767] [2024-11-28 04:21:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:33,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:33,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:33,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:33,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-28 04:21:33,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 542 transitions, 1102 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:33,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:33,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-28 04:21:33,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:34,197 INFO L124 PetriNetUnfolderBase]: 49/1463 cut-off events. [2024-11-28 04:21:34,197 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-28 04:21:34,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1463 events. 49/1463 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6309 event pairs, 10 based on Foata normal form. 0/1386 useless extension candidates. Maximal degree in co-relation 1338. Up to 38 conditions per place. [2024-11-28 04:21:34,209 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2024-11-28 04:21:34,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 544 transitions, 1130 flow [2024-11-28 04:21:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-11-28 04:21:34,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-11-28 04:21:34,217 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1102 flow. Second operand 3 states and 1719 transitions. [2024-11-28 04:21:34,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 544 transitions, 1130 flow [2024-11-28 04:21:34,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:34,231 INFO L231 Difference]: Finished difference. Result has 542 places, 541 transitions, 1099 flow [2024-11-28 04:21:34,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=542, PETRI_TRANSITIONS=541} [2024-11-28 04:21:34,233 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-11-28 04:21:34,233 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 541 transitions, 1099 flow [2024-11-28 04:21:34,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:34,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:34,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:34,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:21:34,235 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:34,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1707080083, now seen corresponding path program 1 times [2024-11-28 04:21:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782100855] [2024-11-28 04:21:34,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:34,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:34,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782100855] [2024-11-28 04:21:34,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782100855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:34,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412828522] [2024-11-28 04:21:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:34,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:34,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:34,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:34,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 587 [2024-11-28 04:21:34,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 541 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:34,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:34,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 587 [2024-11-28 04:21:34,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:34,700 INFO L124 PetriNetUnfolderBase]: 30/861 cut-off events. [2024-11-28 04:21:34,700 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-11-28 04:21:34,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 861 events. 30/861 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2464 event pairs, 10 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 728. Up to 44 conditions per place. [2024-11-28 04:21:34,707 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2024-11-28 04:21:34,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 541 transitions, 1131 flow [2024-11-28 04:21:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-11-28 04:21:34,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-11-28 04:21:34,714 INFO L175 Difference]: Start difference. First operand has 542 places, 541 transitions, 1099 flow. Second operand 3 states and 1705 transitions. [2024-11-28 04:21:34,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 541 transitions, 1131 flow [2024-11-28 04:21:34,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 541 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:34,726 INFO L231 Difference]: Finished difference. Result has 543 places, 541 transitions, 1106 flow [2024-11-28 04:21:34,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=543, PETRI_TRANSITIONS=541} [2024-11-28 04:21:34,727 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-28 04:21:34,727 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 541 transitions, 1106 flow [2024-11-28 04:21:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 565.0) internal successors, (1695), 3 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:34,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:34,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 04:21:34,729 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1384715168, now seen corresponding path program 1 times [2024-11-28 04:21:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:34,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392532907] [2024-11-28 04:21:34,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392532907] [2024-11-28 04:21:34,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392532907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:34,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:34,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178829963] [2024-11-28 04:21:34,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:34,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:34,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:34,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:34,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-28 04:21:34,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 541 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:34,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:34,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-28 04:21:34,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:35,342 INFO L124 PetriNetUnfolderBase]: 49/1445 cut-off events. [2024-11-28 04:21:35,342 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-28 04:21:35,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1445 events. 49/1445 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6225 event pairs, 10 based on Foata normal form. 0/1377 useless extension candidates. Maximal degree in co-relation 1517. Up to 38 conditions per place. [2024-11-28 04:21:35,354 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2024-11-28 04:21:35,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1134 flow [2024-11-28 04:21:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-11-28 04:21:35,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-11-28 04:21:35,360 INFO L175 Difference]: Start difference. First operand has 543 places, 541 transitions, 1106 flow. Second operand 3 states and 1719 transitions. [2024-11-28 04:21:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1134 flow [2024-11-28 04:21:35,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:35,372 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1104 flow [2024-11-28 04:21:35,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=543, PETRI_TRANSITIONS=540} [2024-11-28 04:21:35,374 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-28 04:21:35,374 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1104 flow [2024-11-28 04:21:35,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:35,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:35,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 04:21:35,376 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting whoop_wrapper_nvram_unlocked_ioctlErr0ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:35,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 424076854, now seen corresponding path program 1 times [2024-11-28 04:21:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117032927] [2024-11-28 04:21:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117032927] [2024-11-28 04:21:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117032927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:21:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727604365] [2024-11-28 04:21:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:21:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:35,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:21:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:21:35,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-28 04:21:35,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 540 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:35,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:35,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-28 04:21:35,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:35,778 INFO L124 PetriNetUnfolderBase]: 23/800 cut-off events. [2024-11-28 04:21:35,778 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2024-11-28 04:21:35,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 800 events. 23/800 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2073 event pairs, 0 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 648. Up to 24 conditions per place. [2024-11-28 04:21:35,784 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 7 selfloop transitions, 1 changer transitions 1/540 dead transitions. [2024-11-28 04:21:35,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 540 transitions, 1123 flow [2024-11-28 04:21:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:21:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:21:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2024-11-28 04:21:35,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750141964792731 [2024-11-28 04:21:35,790 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1104 flow. Second operand 3 states and 1717 transitions. [2024-11-28 04:21:35,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 540 transitions, 1123 flow [2024-11-28 04:21:35,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:35,807 INFO L231 Difference]: Finished difference. Result has 543 places, 539 transitions, 1103 flow [2024-11-28 04:21:35,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=543, PETRI_TRANSITIONS=539} [2024-11-28 04:21:35,809 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-28 04:21:35,809 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 539 transitions, 1103 flow [2024-11-28 04:21:35,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.6666666666666) internal successors, (1712), 3 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:35,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:35,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:21:35,811 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:35,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1493992376, now seen corresponding path program 1 times [2024-11-28 04:21:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:35,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997542688] [2024-11-28 04:21:35,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997542688] [2024-11-28 04:21:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997542688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:21:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632657869] [2024-11-28 04:21:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:21:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:39,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:21:39,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:21:40,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 587 [2024-11-28 04:21:40,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 539 transitions, 1103 flow. Second operand has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:40,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:21:40,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 587 [2024-11-28 04:21:40,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:21:41,465 INFO L124 PetriNetUnfolderBase]: 303/2861 cut-off events. [2024-11-28 04:21:41,465 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-28 04:21:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 2861 events. 303/2861 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 22091 event pairs, 47 based on Foata normal form. 0/2715 useless extension candidates. Maximal degree in co-relation 3322. Up to 323 conditions per place. [2024-11-28 04:21:41,488 INFO L140 encePairwiseOnDemand]: 553/587 looper letters, 67 selfloop transitions, 45 changer transitions 6/597 dead transitions. [2024-11-28 04:21:41,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 597 transitions, 1461 flow [2024-11-28 04:21:41,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:21:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 04:21:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5346 transitions. [2024-11-28 04:21:41,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107325383304941 [2024-11-28 04:21:41,506 INFO L175 Difference]: Start difference. First operand has 543 places, 539 transitions, 1103 flow. Second operand 10 states and 5346 transitions. [2024-11-28 04:21:41,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 597 transitions, 1461 flow [2024-11-28 04:21:41,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 597 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:21:41,519 INFO L231 Difference]: Finished difference. Result has 560 places, 576 transitions, 1419 flow [2024-11-28 04:21:41,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=560, PETRI_TRANSITIONS=576} [2024-11-28 04:21:41,522 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-11-28 04:21:41,522 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 576 transitions, 1419 flow [2024-11-28 04:21:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 525.0) internal successors, (5250), 10 states have internal predecessors, (5250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:41,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:21:41,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:21:41,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:21:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1075568129, now seen corresponding path program 1 times [2024-11-28 04:21:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134887009] [2024-11-28 04:21:41,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:21:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:54,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134887009] [2024-11-28 04:21:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134887009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-28 04:21:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490060915] [2024-11-28 04:21:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:21:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:54,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:21:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:22:03,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-28 04:22:03,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 576 transitions, 1419 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:03,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:22:03,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-28 04:22:03,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:22:11,579 INFO L124 PetriNetUnfolderBase]: 1164/5780 cut-off events. [2024-11-28 04:22:11,580 INFO L125 PetriNetUnfolderBase]: For 977/1069 co-relation queries the response was YES. [2024-11-28 04:22:11,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 5780 events. 1164/5780 cut-off events. For 977/1069 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 50750 event pairs, 72 based on Foata normal form. 24/5558 useless extension candidates. Maximal degree in co-relation 9609. Up to 980 conditions per place. [2024-11-28 04:22:11,620 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 276 selfloop transitions, 115 changer transitions 6/833 dead transitions. [2024-11-28 04:22:11,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 833 transitions, 3373 flow [2024-11-28 04:22:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-28 04:22:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-28 04:22:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16995 transitions. [2024-11-28 04:22:11,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272085665612071 [2024-11-28 04:22:11,640 INFO L175 Difference]: Start difference. First operand has 560 places, 576 transitions, 1419 flow. Second operand 35 states and 16995 transitions. [2024-11-28 04:22:11,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 833 transitions, 3373 flow [2024-11-28 04:22:11,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 833 transitions, 3373 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:22:11,671 INFO L231 Difference]: Finished difference. Result has 601 places, 654 transitions, 2295 flow [2024-11-28 04:22:11,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2295, PETRI_PLACES=601, PETRI_TRANSITIONS=654} [2024-11-28 04:22:11,673 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 26 predicate places. [2024-11-28 04:22:11,674 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 654 transitions, 2295 flow [2024-11-28 04:22:11,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:11,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:22:11,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:11,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 04:22:11,681 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:22:11,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2110446327, now seen corresponding path program 2 times [2024-11-28 04:22:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:11,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683531572] [2024-11-28 04:22:11,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:22:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:11,801 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:22:11,801 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:22:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:22:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683531572] [2024-11-28 04:22:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683531572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-28 04:22:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93552334] [2024-11-28 04:22:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:20,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:22:20,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:20,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:22:20,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:22:30,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-28 04:22:30,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 654 transitions, 2295 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:30,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:22:30,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-28 04:22:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:22:37,900 INFO L124 PetriNetUnfolderBase]: 1742/7824 cut-off events. [2024-11-28 04:22:37,901 INFO L125 PetriNetUnfolderBase]: For 6329/6711 co-relation queries the response was YES. [2024-11-28 04:22:37,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 7824 events. 1742/7824 cut-off events. For 6329/6711 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 72044 event pairs, 98 based on Foata normal form. 90/7610 useless extension candidates. Maximal degree in co-relation 16991. Up to 1249 conditions per place. [2024-11-28 04:22:37,973 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 377 selfloop transitions, 176 changer transitions 0/989 dead transitions. [2024-11-28 04:22:37,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 989 transitions, 5478 flow [2024-11-28 04:22:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:22:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-28 04:22:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17517 transitions. [2024-11-28 04:22:37,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289324247586598 [2024-11-28 04:22:37,994 INFO L175 Difference]: Start difference. First operand has 601 places, 654 transitions, 2295 flow. Second operand 36 states and 17517 transitions. [2024-11-28 04:22:37,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 989 transitions, 5478 flow [2024-11-28 04:22:38,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 989 transitions, 5441 flow, removed 0 selfloop flow, removed 19 redundant places. [2024-11-28 04:22:38,072 INFO L231 Difference]: Finished difference. Result has 632 places, 764 transitions, 3885 flow [2024-11-28 04:22:38,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3885, PETRI_PLACES=632, PETRI_TRANSITIONS=764} [2024-11-28 04:22:38,074 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 57 predicate places. [2024-11-28 04:22:38,075 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 764 transitions, 3885 flow [2024-11-28 04:22:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:38,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:22:38,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:22:38,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 04:22:38,080 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:22:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:22:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 188933319, now seen corresponding path program 3 times [2024-11-28 04:22:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:22:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701509248] [2024-11-28 04:22:38,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:22:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:22:38,209 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 04:22:38,209 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:22:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:22:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:22:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701509248] [2024-11-28 04:22:45,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701509248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:22:45,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:22:45,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-28 04:22:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964683053] [2024-11-28 04:22:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:22:45,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:22:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:22:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:22:45,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:22:55,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-28 04:22:55,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 764 transitions, 3885 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:22:55,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:22:55,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-28 04:22:55,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:23:02,536 INFO L124 PetriNetUnfolderBase]: 2017/9329 cut-off events. [2024-11-28 04:23:02,537 INFO L125 PetriNetUnfolderBase]: For 18117/18681 co-relation queries the response was YES. [2024-11-28 04:23:02,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23812 conditions, 9329 events. 2017/9329 cut-off events. For 18117/18681 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 90155 event pairs, 151 based on Foata normal form. 178/9125 useless extension candidates. Maximal degree in co-relation 23478. Up to 1074 conditions per place. [2024-11-28 04:23:02,623 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 405 selfloop transitions, 234 changer transitions 0/1075 dead transitions. [2024-11-28 04:23:02,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 1075 transitions, 7649 flow [2024-11-28 04:23:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:23:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-28 04:23:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17505 transitions. [2024-11-28 04:23:02,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283645655877342 [2024-11-28 04:23:02,642 INFO L175 Difference]: Start difference. First operand has 632 places, 764 transitions, 3885 flow. Second operand 36 states and 17505 transitions. [2024-11-28 04:23:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 1075 transitions, 7649 flow [2024-11-28 04:23:02,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 1075 transitions, 7484 flow, removed 46 selfloop flow, removed 20 redundant places. [2024-11-28 04:23:02,794 INFO L231 Difference]: Finished difference. Result has 663 places, 865 transitions, 5839 flow [2024-11-28 04:23:02,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=3724, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=5839, PETRI_PLACES=663, PETRI_TRANSITIONS=865} [2024-11-28 04:23:02,796 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 88 predicate places. [2024-11-28 04:23:02,796 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 865 transitions, 5839 flow [2024-11-28 04:23:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:23:02,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:23:02,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:02,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 04:23:02,800 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:23:02,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1346421843, now seen corresponding path program 4 times [2024-11-28 04:23:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90911803] [2024-11-28 04:23:02,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:23:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:03,018 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:23:03,019 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:23:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:23:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90911803] [2024-11-28 04:23:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90911803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:23:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:23:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-28 04:23:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798077695] [2024-11-28 04:23:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:23:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 04:23:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:14,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 04:23:14,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:23:20,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 587 [2024-11-28 04:23:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 865 transitions, 5839 flow. Second operand has 27 states, 27 states have (on average 494.037037037037) internal successors, (13339), 27 states have internal predecessors, (13339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:23:20,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:23:20,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 587 [2024-11-28 04:23:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:23:28,011 INFO L124 PetriNetUnfolderBase]: 2335/10820 cut-off events. [2024-11-28 04:23:28,012 INFO L125 PetriNetUnfolderBase]: For 37637/38256 co-relation queries the response was YES. [2024-11-28 04:23:28,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31586 conditions, 10820 events. 2335/10820 cut-off events. For 37637/38256 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 109036 event pairs, 126 based on Foata normal form. 349/10707 useless extension candidates. Maximal degree in co-relation 31236. Up to 1580 conditions per place. [2024-11-28 04:23:28,148 INFO L140 encePairwiseOnDemand]: 530/587 looper letters, 444 selfloop transitions, 323 changer transitions 0/1217 dead transitions. [2024-11-28 04:23:28,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 1217 transitions, 11164 flow [2024-11-28 04:23:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-28 04:23:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-28 04:23:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 16517 transitions. [2024-11-28 04:23:28,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526663569253007 [2024-11-28 04:23:28,166 INFO L175 Difference]: Start difference. First operand has 663 places, 865 transitions, 5839 flow. Second operand 33 states and 16517 transitions. [2024-11-28 04:23:28,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 1217 transitions, 11164 flow [2024-11-28 04:23:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 1217 transitions, 10867 flow, removed 130 selfloop flow, removed 19 redundant places. [2024-11-28 04:23:28,845 INFO L231 Difference]: Finished difference. Result has 696 places, 1000 transitions, 8608 flow [2024-11-28 04:23:28,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=5594, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=8608, PETRI_PLACES=696, PETRI_TRANSITIONS=1000} [2024-11-28 04:23:28,847 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 121 predicate places. [2024-11-28 04:23:28,847 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 1000 transitions, 8608 flow [2024-11-28 04:23:28,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 494.037037037037) internal successors, (13339), 27 states have internal predecessors, (13339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:23:28,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:23:28,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:28,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 04:23:28,851 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:23:28,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1462804941, now seen corresponding path program 5 times [2024-11-28 04:23:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567179871] [2024-11-28 04:23:28,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:23:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:28,972 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:23:28,972 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:23:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:23:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:23:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567179871] [2024-11-28 04:23:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567179871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:23:36,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:23:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-28 04:23:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219329019] [2024-11-28 04:23:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:23:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-28 04:23:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:23:36,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-28 04:23:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 04:23:44,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-28 04:23:44,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 1000 transitions, 8608 flow. Second operand has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:23:44,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:23:44,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-28 04:23:44,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:23:53,950 INFO L124 PetriNetUnfolderBase]: 2433/11336 cut-off events. [2024-11-28 04:23:53,951 INFO L125 PetriNetUnfolderBase]: For 66624/67609 co-relation queries the response was YES. [2024-11-28 04:23:54,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37800 conditions, 11336 events. 2433/11336 cut-off events. For 66624/67609 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 116270 event pairs, 156 based on Foata normal form. 184/11018 useless extension candidates. Maximal degree in co-relation 37415. Up to 1734 conditions per place. [2024-11-28 04:23:54,082 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 658 selfloop transitions, 256 changer transitions 0/1353 dead transitions. [2024-11-28 04:23:54,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 1353 transitions, 14354 flow [2024-11-28 04:23:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-28 04:23:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-28 04:23:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17539 transitions. [2024-11-28 04:23:54,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299734999053568 [2024-11-28 04:23:54,113 INFO L175 Difference]: Start difference. First operand has 696 places, 1000 transitions, 8608 flow. Second operand 36 states and 17539 transitions. [2024-11-28 04:23:54,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 1353 transitions, 14354 flow [2024-11-28 04:23:54,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 1353 transitions, 14260 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-28 04:23:54,530 INFO L231 Difference]: Finished difference. Result has 733 places, 1074 transitions, 10831 flow [2024-11-28 04:23:54,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=8521, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=10831, PETRI_PLACES=733, PETRI_TRANSITIONS=1074} [2024-11-28 04:23:54,532 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 158 predicate places. [2024-11-28 04:23:54,532 INFO L471 AbstractCegarLoop]: Abstraction has has 733 places, 1074 transitions, 10831 flow [2024-11-28 04:23:54,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 480.25714285714287) internal successors, (16809), 35 states have internal predecessors, (16809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:23:54,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:23:54,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:23:54,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 04:23:54,535 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting whoop_wrapper_read_nvramErr4ASSERT_VIOLATIONDATA_RACE === [whoop_wrapper_read_nvramErr0ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr1ASSERT_VIOLATIONDATA_RACE, whoop_wrapper_read_nvramErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-28 04:23:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:23:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1260468431, now seen corresponding path program 6 times [2024-11-28 04:23:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:23:54,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51730549] [2024-11-28 04:23:54,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:23:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:23:54,652 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-28 04:23:54,652 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:24:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:24:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:24:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51730549] [2024-11-28 04:24:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51730549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:24:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805160240] [2024-11-28 04:24:05,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:24:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:24:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:24:05,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:24:05,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a39da462-4682-4d93-a773-96c56539e6ad/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:24:06,251 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-28 04:24:06,252 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:24:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-28 04:24:06,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:24:06,848 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:06,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:06,963 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:24:06,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 04:24:07,156 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,256 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,354 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,449 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,538 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,620 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:24:07,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 04:24:07,786 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,876 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:07,968 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:07,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:08,055 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:08,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:08,141 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:24:08,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 04:24:08,305 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:08,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:08,398 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:08,486 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 04:24:08,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 04:24:08,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:08,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:24:10,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:24:10,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:24:10,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 04:24:10,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-28 04:24:10,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-28 04:24:10,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-11-28 04:24:10,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-11-28 04:24:10,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-11-28 04:24:11,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 103 [2024-11-28 04:24:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:24:11,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:24:16,495 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse6 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse6) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse6) .cse5 .cse6)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1581)) (= 0 (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1581)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))))) is different from false [2024-11-28 04:24:20,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1))) (not (= v_ArrVal_1581 (let ((.cse3 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse3) .cse6 .cse3)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse7) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse7) .cse6 .cse7)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse8 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse8) .cse6 .cse8)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse9) .cse6 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse10) .cse6 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse11) .cse6 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse12) .cse6 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse14) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse14) .cse6 .cse14)))))))))) is different from false [2024-11-28 04:24:25,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse13 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse9) .cse5 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse12) .cse5 .cse12)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse14) .cse5 .cse14)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse15) .cse5 .cse15)))))))))) is different from false [2024-11-28 04:24:32,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15 0) .cse13 0) .cse7 0)))) (let ((.cse1 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse2 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse4 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse3 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7)) (not (= (let ((.cse8 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse8) .cse6 .cse8)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse9) .cse6 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse11) .cse6 .cse11)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (let ((.cse12 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse12) .cse6 .cse12)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse14) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse14) .cse6 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0) (not (= (let ((.cse16 (select v_ArrVal_1581 .cse5))) (store (store (store (store .cse1 .cse2 .cse16) .cse4 (select v_ArrVal_1581 .cse4)) .cse5 .cse16) .cse6 .cse16)) v_ArrVal_1581)))))))) is different from false [2024-11-28 04:24:37,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14 0) .cse1 0) .cse10 0) .cse11 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1581 (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse8 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse8) .cse7 .cse8)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse13 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse13) .cse7 .cse13)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse16 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse16) .cse7 .cse16)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse17) .cse7 .cse17)))))))))) is different from false [2024-11-28 04:24:41,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse8 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse15 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse9 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse6 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse12 0) .cse8 0) .cse15 0) .cse9 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse3 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse2 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse7 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse7) .cse5 .cse7)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse10) .cse5 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse11 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse11) .cse5 .cse11)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= v_ArrVal_1581 (let ((.cse13 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse13) .cse5 .cse13)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse14) .cse5 .cse14)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse17) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse17) .cse5 .cse17)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= v_ArrVal_1581 (let ((.cse18 (select v_ArrVal_1581 .cse4))) (store (store (store (store .cse0 .cse1 .cse18) .cse3 (select v_ArrVal_1581 .cse3)) .cse4 .cse18) .cse5 .cse18)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))))))) is different from false [2024-11-28 04:24:47,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse8 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse18 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse13 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse8 0) .cse18 0) .cse1 0) .cse11 0) .cse13 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1581 (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1581 (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= v_ArrVal_1581 (let ((.cse10 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse10) .cse7 .cse10)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1581 (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= v_ArrVal_1581 (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1581 (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1581 (let ((.cse17 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse17) .cse7 .cse17)))))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse18) 0) (not (= v_ArrVal_1581 (let ((.cse19 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse19) .cse7 .cse19)))))))))) is different from false [2024-11-28 04:24:52,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse1 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse16 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse13 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse11 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse20 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse1 0) .cse16 0) .cse17 0) .cse13 0) .cse11 0) .cse20 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset| 4)) (.cse5 (+ 5 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|)) (.cse6 (+ 6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.offset|))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse10) .cse7 .cse10)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse12 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse12) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse12) .cse7 .cse12)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse15) .cse7 .cse15)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse18) .cse7 .cse18)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (not (= (let ((.cse19 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse19) .cse7 .cse19)) v_ArrVal_1581)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-11-28 04:24:58,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse19 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse8 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse12 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse15 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (let ((.cse0 (store |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base| (store (store (store (store (store (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 0) .cse19 0) .cse1 0) .cse8 0) .cse12 0) .cse15 0) .cse17 0)))) (let ((.cse2 (select .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base|)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 4)) (.cse5 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 5)) (.cse7 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset|)) (.cse6 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 6))) (and (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= (let ((.cse9 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse9) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse9) .cse7 .cse9)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= (let ((.cse11 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse11) .cse7 .cse11)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= (let ((.cse13 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse13) .cse7 .cse13)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse14 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse14) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse14) .cse7 .cse14)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15)) (not (= (let ((.cse16 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse16) .cse7 .cse16)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse18) .cse7 .cse18)) v_ArrVal_1581)))) (forall ((v_ArrVal_1581 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1581) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse19)) (not (= (let ((.cse20 (select v_ArrVal_1581 .cse6))) (store (store (store (store .cse2 .cse3 .cse20) .cse5 (select v_ArrVal_1581 .cse5)) .cse6 .cse20) .cse7 .cse20)) v_ArrVal_1581)))))))) is different from false [2024-11-28 04:24:58,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:24:58,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-11-28 04:24:58,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:58,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-11-28 04:24:58,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:24:58,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 290 [2024-11-28 04:24:59,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:24:59,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-11-28 04:24:59,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:24:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-11-28 04:24:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 2236 treesize of output 2174 [2024-11-28 04:24:59,787 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-28 04:24:59,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-11-28 04:25:00,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:25:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 133 [2024-11-28 04:25:00,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:25:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 130 [2024-11-28 04:25:00,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:25:00,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:25:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 154 [2024-11-28 04:25:00,506 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-28 04:25:00,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-11-28 04:25:00,562 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-28 04:25:00,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1 [2024-11-28 04:25:00,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:25:00,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 131 [2024-11-28 04:25:01,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:25:01,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2024-11-28 04:25:01,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:25:01,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:25:01,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:25:01,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2024-11-28 04:25:01,215 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-28 04:25:01,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 1