./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/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_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-24 02:00:49,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 02:00:49,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-24 02:00:49,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 02:00:49,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 02:00:49,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 02:00:49,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 02:00:49,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 02:00:49,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 02:00:49,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 02:00:49,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 02:00:49,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 02:00:49,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 02:00:49,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 02:00:49,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 02:00:49,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:00:49,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:00:49,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 02:00:49,401 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 02:00:49,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 02:00:49,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 02:00:49,404 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_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC 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-24 02:00:49,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 02:00:49,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 02:00:49,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 02:00:49,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 02:00:49,819 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 02:00:49,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-24 02:00:53,045 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/data/f47c197cc/25a2dee29d194bf3989a1593db673047/FLAG36f484ba7 [2024-11-24 02:00:53,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 02:00:53,900 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/sv-benchmarks/c/pthread-driver-races/char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-24 02:00:53,971 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/data/f47c197cc/25a2dee29d194bf3989a1593db673047/FLAG36f484ba7 [2024-11-24 02:00:53,999 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/data/f47c197cc/25a2dee29d194bf3989a1593db673047 [2024-11-24 02:00:54,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 02:00:54,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 02:00:54,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 02:00:54,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 02:00:54,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 02:00:54,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:00:54" (1/1) ... [2024-11-24 02:00:54,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a2271a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:00:54, skipping insertion in model container [2024-11-24 02:00:54,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:00:54" (1/1) ... [2024-11-24 02:00:54,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 02:01:00,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:01:00,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 02:01:00,692 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-24 02:01:00,694 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-24 02:01:00,753 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-24 02:01:00,753 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-24 02:01:00,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: asm volatile("ud2"); [5817] [2024-11-24 02:01:00,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:01:01,748 INFO L204 MainTranslator]: Completed translation [2024-11-24 02:01:01,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01 WrapperNode [2024-11-24 02:01:01,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 02:01:01,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 02:01:01,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 02:01:01,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 02:01:01,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:01,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,044 INFO L138 Inliner]: procedures = 1354, calls = 1464, calls flagged for inlining = 353, calls inlined = 20, statements flattened = 523 [2024-11-24 02:01:02,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 02:01:02,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 02:01:02,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 02:01:02,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 02:01:02,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 02:01:02,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 02:01:02,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 02:01:02,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 02:01:02,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (1/1) ... [2024-11-24 02:01:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:01:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:01:02,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 02:01:02,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 02:01:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 02:01:02,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 02:01:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-11-24 02:01:02,240 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_nvram_unlocked_ioctl [2024-11-24 02:01:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 02:01:02,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 02:01:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 02:01:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 02:01:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure whoop_wrapper_read_nvram [2024-11-24 02:01:02,241 INFO L138 BoogieDeclarations]: Found implementation of procedure whoop_wrapper_read_nvram [2024-11-24 02:01:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 02:01:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 02:01:02,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-24 02:01:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 02:01:02,243 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 02:01:02,888 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 02:01:02,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 02:01:04,039 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 02:01:04,039 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 02:01:04,195 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 02:01:04,195 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 02:01:04,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:01:04 BoogieIcfgContainer [2024-11-24 02:01:04,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 02:01:04,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 02:01:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 02:01:04,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 02:01:04,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:00:54" (1/3) ... [2024-11-24 02:01:04,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7cc906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:01:04, skipping insertion in model container [2024-11-24 02:01:04,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:01:01" (2/3) ... [2024-11-24 02:01:04,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7cc906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:01:04, skipping insertion in model container [2024-11-24 02:01:04,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:01:04" (3/3) ... [2024-11-24 02:01:04,214 INFO L128 eAbstractionObserver]: Analyzing ICFG char_generic_nvram_read_nvram_nvram_unlocked_ioctl.i [2024-11-24 02:01:04,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 02:01:04,236 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-24 02:01:04,236 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 02:01:04,509 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-24 02:01:04,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 581 places, 587 transitions, 1188 flow [2024-11-24 02:01:04,911 INFO L124 PetriNetUnfolderBase]: 13/585 cut-off events. [2024-11-24 02:01:04,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-24 02:01:04,928 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-24 02:01:04,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 581 places, 587 transitions, 1188 flow [2024-11-24 02:01:04,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 581 transitions, 1171 flow [2024-11-24 02:01:04,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:01:04,981 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;@267303c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:01:04,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-24 02:01:05,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 02:01:05,013 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-11-24 02:01:05,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 02:01:05,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:05,014 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-24 02:01:05,015 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-24 02:01:05,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1868452534, now seen corresponding path program 1 times [2024-11-24 02:01:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831419334] [2024-11-24 02:01:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:05,731 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-24 02:01:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831419334] [2024-11-24 02:01:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831419334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19386526] [2024-11-24 02:01:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:05,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:05,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:05,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:05,829 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-24 02:01:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:05,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:06,150 INFO L124 PetriNetUnfolderBase]: 13/613 cut-off events. [2024-11-24 02:01:06,150 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-24 02:01:06,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 613 events. 13/613 cut-off events. For 11/12 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-24 02:01:06,163 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 8 selfloop transitions, 2 changer transitions 1/571 dead transitions. [2024-11-24 02:01:06,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 571 transitions, 1171 flow [2024-11-24 02:01:06,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1716 transitions. [2024-11-24 02:01:06,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744463373083475 [2024-11-24 02:01:06,202 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1171 flow. Second operand 3 states and 1716 transitions. [2024-11-24 02:01:06,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 571 transitions, 1171 flow [2024-11-24 02:01:06,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 571 transitions, 1166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-24 02:01:06,237 INFO L231 Difference]: Finished difference. Result has 568 places, 570 transitions, 1148 flow [2024-11-24 02:01:06,243 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-24 02:01:06,250 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -7 predicate places. [2024-11-24 02:01:06,250 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 570 transitions, 1148 flow [2024-11-24 02:01:06,254 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-24 02:01:06,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:06,254 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-24 02:01:06,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 02:01:06,255 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-24 02:01:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 383396254, now seen corresponding path program 1 times [2024-11-24 02:01:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985930175] [2024-11-24 02:01:06,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:06,489 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-24 02:01:06,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:06,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985930175] [2024-11-24 02:01:06,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985930175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:06,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303023490] [2024-11-24 02:01:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:06,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:06,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:06,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:06,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:06,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:06,516 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-24 02:01:06,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:06,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:06,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:06,680 INFO L124 PetriNetUnfolderBase]: 13/611 cut-off events. [2024-11-24 02:01:06,680 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:06,683 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-24 02:01:06,686 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2024-11-24 02:01:06,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 569 transitions, 1166 flow [2024-11-24 02:01:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:06,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:06,691 INFO L175 Difference]: Start difference. First operand has 568 places, 570 transitions, 1148 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 569 transitions, 1166 flow [2024-11-24 02:01:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 569 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:06,705 INFO L231 Difference]: Finished difference. Result has 566 places, 569 transitions, 1146 flow [2024-11-24 02:01:06,706 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-24 02:01:06,706 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -9 predicate places. [2024-11-24 02:01:06,706 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 569 transitions, 1146 flow [2024-11-24 02:01:06,708 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-24 02:01:06,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:06,708 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-24 02:01:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 02:01:06,708 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-24 02:01:06,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1627991755, now seen corresponding path program 1 times [2024-11-24 02:01:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:06,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517264711] [2024-11-24 02:01:06,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:06,849 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-24 02:01:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517264711] [2024-11-24 02:01:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517264711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387415006] [2024-11-24 02:01:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:06,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:06,871 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-24 02:01:06,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:06,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:06,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:07,029 INFO L124 PetriNetUnfolderBase]: 13/610 cut-off events. [2024-11-24 02:01:07,030 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:07,032 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-24 02:01:07,035 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/568 dead transitions. [2024-11-24 02:01:07,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 568 transitions, 1164 flow [2024-11-24 02:01:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:07,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:07,041 INFO L175 Difference]: Start difference. First operand has 566 places, 569 transitions, 1146 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:07,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 568 transitions, 1164 flow [2024-11-24 02:01:07,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 568 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:07,051 INFO L231 Difference]: Finished difference. Result has 565 places, 568 transitions, 1144 flow [2024-11-24 02:01:07,052 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-24 02:01:07,053 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -10 predicate places. [2024-11-24 02:01:07,053 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 568 transitions, 1144 flow [2024-11-24 02:01:07,055 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-24 02:01:07,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:07,055 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-24 02:01:07,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 02:01:07,055 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-24 02:01:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 997935529, now seen corresponding path program 1 times [2024-11-24 02:01:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130420929] [2024-11-24 02:01:07,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:07,182 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-24 02:01:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130420929] [2024-11-24 02:01:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130420929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087158471] [2024-11-24 02:01:07,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:07,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:07,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:07,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-24 02:01:07,210 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-24 02:01:07,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:07,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-24 02:01:07,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:07,481 INFO L124 PetriNetUnfolderBase]: 29/1066 cut-off events. [2024-11-24 02:01:07,482 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-24 02:01:07,486 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-24 02:01:07,490 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2024-11-24 02:01:07,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 567 transitions, 1164 flow [2024-11-24 02:01:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-24 02:01:07,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-24 02:01:07,497 INFO L175 Difference]: Start difference. First operand has 565 places, 568 transitions, 1144 flow. Second operand 3 states and 1707 transitions. [2024-11-24 02:01:07,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 567 transitions, 1164 flow [2024-11-24 02:01:07,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 567 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:07,511 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1142 flow [2024-11-24 02:01:07,512 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-24 02:01:07,513 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -11 predicate places. [2024-11-24 02:01:07,513 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1142 flow [2024-11-24 02:01:07,514 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-24 02:01:07,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:07,514 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-24 02:01:07,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 02:01:07,515 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-24 02:01:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1852725899, now seen corresponding path program 1 times [2024-11-24 02:01:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394100532] [2024-11-24 02:01:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:07,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-24 02:01:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394100532] [2024-11-24 02:01:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394100532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781310459] [2024-11-24 02:01:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:07,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:07,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:07,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:07,672 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-24 02:01:07,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:07,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:07,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:07,793 INFO L124 PetriNetUnfolderBase]: 13/608 cut-off events. [2024-11-24 02:01:07,793 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:07,796 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-24 02:01:07,798 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/566 dead transitions. [2024-11-24 02:01:07,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 566 transitions, 1160 flow [2024-11-24 02:01:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:07,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:07,806 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1142 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:07,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 566 transitions, 1160 flow [2024-11-24 02:01:07,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 566 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:07,817 INFO L231 Difference]: Finished difference. Result has 563 places, 566 transitions, 1140 flow [2024-11-24 02:01:07,818 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-24 02:01:07,822 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -12 predicate places. [2024-11-24 02:01:07,822 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 566 transitions, 1140 flow [2024-11-24 02:01:07,823 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-24 02:01:07,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:07,826 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-24 02:01:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 02:01:07,826 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-24 02:01:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1600199409, now seen corresponding path program 1 times [2024-11-24 02:01:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505072216] [2024-11-24 02:01:07,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:07,970 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-24 02:01:07,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:07,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505072216] [2024-11-24 02:01:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505072216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:07,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382785512] [2024-11-24 02:01:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:07,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:08,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-24 02:01:08,005 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-24 02:01:08,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:08,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-24 02:01:08,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:08,136 INFO L124 PetriNetUnfolderBase]: 14/627 cut-off events. [2024-11-24 02:01:08,136 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-24 02:01:08,139 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-24 02:01:08,141 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/565 dead transitions. [2024-11-24 02:01:08,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 565 transitions, 1160 flow [2024-11-24 02:01:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-24 02:01:08,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-24 02:01:08,147 INFO L175 Difference]: Start difference. First operand has 563 places, 566 transitions, 1140 flow. Second operand 3 states and 1707 transitions. [2024-11-24 02:01:08,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 565 transitions, 1160 flow [2024-11-24 02:01:08,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 565 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:08,157 INFO L231 Difference]: Finished difference. Result has 562 places, 565 transitions, 1138 flow [2024-11-24 02:01:08,159 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-24 02:01:08,159 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -13 predicate places. [2024-11-24 02:01:08,160 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 565 transitions, 1138 flow [2024-11-24 02:01:08,161 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-24 02:01:08,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:08,161 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-24 02:01:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 02:01:08,162 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-24 02:01:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash -948262792, now seen corresponding path program 1 times [2024-11-24 02:01:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953854140] [2024-11-24 02:01:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:08,363 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-24 02:01:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953854140] [2024-11-24 02:01:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953854140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:08,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:08,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446369457] [2024-11-24 02:01:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:08,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:08,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:08,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:08,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:08,396 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-24 02:01:08,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:08,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:08,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:08,677 INFO L124 PetriNetUnfolderBase]: 13/606 cut-off events. [2024-11-24 02:01:08,678 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:08,684 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-24 02:01:08,686 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2024-11-24 02:01:08,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 564 transitions, 1156 flow [2024-11-24 02:01:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:08,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:08,692 INFO L175 Difference]: Start difference. First operand has 562 places, 565 transitions, 1138 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:08,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 564 transitions, 1156 flow [2024-11-24 02:01:08,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 564 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:08,702 INFO L231 Difference]: Finished difference. Result has 561 places, 564 transitions, 1136 flow [2024-11-24 02:01:08,703 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-24 02:01:08,704 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -14 predicate places. [2024-11-24 02:01:08,705 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 564 transitions, 1136 flow [2024-11-24 02:01:08,706 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-24 02:01:08,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:08,706 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-24 02:01:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 02:01:08,707 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-24 02:01:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1755385402, now seen corresponding path program 1 times [2024-11-24 02:01:08,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909080488] [2024-11-24 02:01:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:08,834 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-24 02:01:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909080488] [2024-11-24 02:01:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909080488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147782201] [2024-11-24 02:01:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:08,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:08,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:08,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:08,853 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-24 02:01:08,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:08,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:08,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:08,979 INFO L124 PetriNetUnfolderBase]: 13/605 cut-off events. [2024-11-24 02:01:08,979 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:08,982 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-24 02:01:08,984 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-24 02:01:08,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 563 transitions, 1154 flow [2024-11-24 02:01:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:08,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:08,990 INFO L175 Difference]: Start difference. First operand has 561 places, 564 transitions, 1136 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:08,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 563 transitions, 1154 flow [2024-11-24 02:01:08,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:09,001 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1134 flow [2024-11-24 02:01:09,002 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-24 02:01:09,004 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-11-24 02:01:09,004 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1134 flow [2024-11-24 02:01:09,005 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-24 02:01:09,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:09,005 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-24 02:01:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 02:01:09,005 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-24 02:01:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 703271396, now seen corresponding path program 1 times [2024-11-24 02:01:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728667419] [2024-11-24 02:01:09,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:09,160 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-24 02:01:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728667419] [2024-11-24 02:01:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728667419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:09,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:09,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88641281] [2024-11-24 02:01:09,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:09,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:09,180 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-24 02:01:09,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:09,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:09,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:09,340 INFO L124 PetriNetUnfolderBase]: 13/604 cut-off events. [2024-11-24 02:01:09,341 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:09,343 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-24 02:01:09,345 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-11-24 02:01:09,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1152 flow [2024-11-24 02:01:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:09,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:09,350 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1134 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1152 flow [2024-11-24 02:01:09,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 562 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:09,360 INFO L231 Difference]: Finished difference. Result has 559 places, 562 transitions, 1132 flow [2024-11-24 02:01:09,361 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-24 02:01:09,363 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -16 predicate places. [2024-11-24 02:01:09,363 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 562 transitions, 1132 flow [2024-11-24 02:01:09,364 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-24 02:01:09,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:09,364 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-24 02:01:09,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 02:01:09,365 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-24 02:01:09,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1856580635, now seen corresponding path program 1 times [2024-11-24 02:01:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499338543] [2024-11-24 02:01:09,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:09,519 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-24 02:01:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499338543] [2024-11-24 02:01:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499338543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:09,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:09,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131518776] [2024-11-24 02:01:09,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:09,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:09,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:09,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:09,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:09,540 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-24 02:01:09,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:09,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:09,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:09,673 INFO L124 PetriNetUnfolderBase]: 13/603 cut-off events. [2024-11-24 02:01:09,674 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:09,676 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-24 02:01:09,678 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2024-11-24 02:01:09,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 561 transitions, 1150 flow [2024-11-24 02:01:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:09,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:09,683 INFO L175 Difference]: Start difference. First operand has 559 places, 562 transitions, 1132 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:09,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 561 transitions, 1150 flow [2024-11-24 02:01:09,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 561 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:09,694 INFO L231 Difference]: Finished difference. Result has 558 places, 561 transitions, 1130 flow [2024-11-24 02:01:09,695 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-24 02:01:09,696 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -17 predicate places. [2024-11-24 02:01:09,696 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 561 transitions, 1130 flow [2024-11-24 02:01:09,698 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-24 02:01:09,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:09,698 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-24 02:01:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 02:01:09,698 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-24 02:01:09,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 556897494, now seen corresponding path program 1 times [2024-11-24 02:01:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220919472] [2024-11-24 02:01:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:09,839 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-24 02:01:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220919472] [2024-11-24 02:01:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220919472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:09,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:09,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734051430] [2024-11-24 02:01:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:09,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:09,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:09,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:09,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:09,864 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-24 02:01:09,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:09,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:09,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:10,024 INFO L124 PetriNetUnfolderBase]: 13/602 cut-off events. [2024-11-24 02:01:10,024 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:10,027 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-24 02:01:10,030 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-11-24 02:01:10,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 560 transitions, 1148 flow [2024-11-24 02:01:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:10,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:10,036 INFO L175 Difference]: Start difference. First operand has 558 places, 561 transitions, 1130 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:10,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 560 transitions, 1148 flow [2024-11-24 02:01:10,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 560 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:10,047 INFO L231 Difference]: Finished difference. Result has 557 places, 560 transitions, 1128 flow [2024-11-24 02:01:10,049 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-24 02:01:10,049 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -18 predicate places. [2024-11-24 02:01:10,049 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 560 transitions, 1128 flow [2024-11-24 02:01:10,051 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-24 02:01:10,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:10,051 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-24 02:01:10,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 02:01:10,051 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-24 02:01:10,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash -866413354, now seen corresponding path program 1 times [2024-11-24 02:01:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199528520] [2024-11-24 02:01:10,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:10,249 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-24 02:01:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199528520] [2024-11-24 02:01:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199528520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677983539] [2024-11-24 02:01:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:10,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:10,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 587 [2024-11-24 02:01:10,283 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-24 02:01:10,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:10,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 587 [2024-11-24 02:01:10,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:10,618 INFO L124 PetriNetUnfolderBase]: 29/1049 cut-off events. [2024-11-24 02:01:10,619 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-24 02:01:10,623 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-24 02:01:10,627 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-24 02:01:10,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 559 transitions, 1148 flow [2024-11-24 02:01:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1707 transitions. [2024-11-24 02:01:10,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969335604770017 [2024-11-24 02:01:10,633 INFO L175 Difference]: Start difference. First operand has 557 places, 560 transitions, 1128 flow. Second operand 3 states and 1707 transitions. [2024-11-24 02:01:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 559 transitions, 1148 flow [2024-11-24 02:01:10,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 559 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:10,648 INFO L231 Difference]: Finished difference. Result has 556 places, 559 transitions, 1126 flow [2024-11-24 02:01:10,649 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-24 02:01:10,650 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-11-24 02:01:10,650 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 559 transitions, 1126 flow [2024-11-24 02:01:10,652 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-24 02:01:10,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:10,652 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-24 02:01:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 02:01:10,652 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-24 02:01:10,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 408865890, now seen corresponding path program 1 times [2024-11-24 02:01:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304799792] [2024-11-24 02:01:10,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:10,801 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-24 02:01:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304799792] [2024-11-24 02:01:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304799792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668551329] [2024-11-24 02:01:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:10,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:10,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:10,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:10,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:10,821 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-24 02:01:10,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:10,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:10,961 INFO L124 PetriNetUnfolderBase]: 13/600 cut-off events. [2024-11-24 02:01:10,961 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:10,964 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-24 02:01:10,966 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2024-11-24 02:01:10,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 558 transitions, 1144 flow [2024-11-24 02:01:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:10,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:10,971 INFO L175 Difference]: Start difference. First operand has 556 places, 559 transitions, 1126 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:10,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 558 transitions, 1144 flow [2024-11-24 02:01:10,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:10,983 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1124 flow [2024-11-24 02:01:10,983 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-24 02:01:10,984 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -20 predicate places. [2024-11-24 02:01:10,984 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1124 flow [2024-11-24 02:01:10,986 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-24 02:01:10,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:10,986 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-24 02:01:10,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 02:01:10,986 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-24 02:01:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1745363436, now seen corresponding path program 1 times [2024-11-24 02:01:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:10,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220035740] [2024-11-24 02:01:10,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:10,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:11,167 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-24 02:01:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220035740] [2024-11-24 02:01:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220035740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848359910] [2024-11-24 02:01:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:11,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:11,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:11,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:11,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:11,202 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-24 02:01:11,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:11,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:11,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:11,392 INFO L124 PetriNetUnfolderBase]: 13/599 cut-off events. [2024-11-24 02:01:11,392 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:11,411 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-24 02:01:11,420 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-11-24 02:01:11,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 557 transitions, 1142 flow [2024-11-24 02:01:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:11,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:11,429 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1124 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:11,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 557 transitions, 1142 flow [2024-11-24 02:01:11,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 557 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:11,438 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1122 flow [2024-11-24 02:01:11,439 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-24 02:01:11,441 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -21 predicate places. [2024-11-24 02:01:11,442 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1122 flow [2024-11-24 02:01:11,443 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-24 02:01:11,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:11,443 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-24 02:01:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 02:01:11,444 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-24 02:01:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -392305167, now seen corresponding path program 1 times [2024-11-24 02:01:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163559047] [2024-11-24 02:01:11,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:11,667 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-24 02:01:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163559047] [2024-11-24 02:01:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163559047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715649596] [2024-11-24 02:01:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:11,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:11,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:11,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:11,687 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-24 02:01:11,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:11,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:11,814 INFO L124 PetriNetUnfolderBase]: 13/598 cut-off events. [2024-11-24 02:01:11,815 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:11,818 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-24 02:01:11,820 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-24 02:01:11,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 556 transitions, 1140 flow [2024-11-24 02:01:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:11,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:11,825 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1122 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 556 transitions, 1140 flow [2024-11-24 02:01:11,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:11,837 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1120 flow [2024-11-24 02:01:11,838 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-24 02:01:11,839 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -22 predicate places. [2024-11-24 02:01:11,839 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1120 flow [2024-11-24 02:01:11,841 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-24 02:01:11,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:11,841 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-24 02:01:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 02:01:11,842 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-24 02:01:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1088648328, now seen corresponding path program 1 times [2024-11-24 02:01:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:11,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295187572] [2024-11-24 02:01:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:12,056 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-24 02:01:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295187572] [2024-11-24 02:01:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295187572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580895418] [2024-11-24 02:01:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:12,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:12,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:12,084 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-24 02:01:12,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:12,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:12,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:12,221 INFO L124 PetriNetUnfolderBase]: 13/597 cut-off events. [2024-11-24 02:01:12,221 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:12,224 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-24 02:01:12,227 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 8 selfloop transitions, 2 changer transitions 0/555 dead transitions. [2024-11-24 02:01:12,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 555 transitions, 1138 flow [2024-11-24 02:01:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1709 transitions. [2024-11-24 02:01:12,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704713231118682 [2024-11-24 02:01:12,233 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1120 flow. Second operand 3 states and 1709 transitions. [2024-11-24 02:01:12,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 555 transitions, 1138 flow [2024-11-24 02:01:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 555 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:12,245 INFO L231 Difference]: Finished difference. Result has 552 places, 555 transitions, 1118 flow [2024-11-24 02:01:12,247 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-24 02:01:12,248 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -23 predicate places. [2024-11-24 02:01:12,248 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 555 transitions, 1118 flow [2024-11-24 02:01:12,250 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-24 02:01:12,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:12,250 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-24 02:01:12,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 02:01:12,250 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-24 02:01:12,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1648074247, now seen corresponding path program 1 times [2024-11-24 02:01:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123348984] [2024-11-24 02:01:12,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:12,395 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-24 02:01:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123348984] [2024-11-24 02:01:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123348984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:12,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890124024] [2024-11-24 02:01:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:12,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:12,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:12,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:12,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:12,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 587 [2024-11-24 02:01:12,430 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-24 02:01:12,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:12,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 587 [2024-11-24 02:01:12,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:12,576 INFO L124 PetriNetUnfolderBase]: 18/662 cut-off events. [2024-11-24 02:01:12,577 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:12,580 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-24 02:01:12,582 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 10 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2024-11-24 02:01:12,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 554 transitions, 1140 flow [2024-11-24 02:01:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-11-24 02:01:12,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-11-24 02:01:12,588 INFO L175 Difference]: Start difference. First operand has 552 places, 555 transitions, 1118 flow. Second operand 3 states and 1705 transitions. [2024-11-24 02:01:12,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 554 transitions, 1140 flow [2024-11-24 02:01:12,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 554 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:12,599 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1116 flow [2024-11-24 02:01:12,599 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-24 02:01:12,600 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -24 predicate places. [2024-11-24 02:01:12,600 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1116 flow [2024-11-24 02:01:12,602 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-24 02:01:12,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:12,602 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-24 02:01:12,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 02:01:12,602 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-24 02:01:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2104513640, now seen corresponding path program 1 times [2024-11-24 02:01:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891725010] [2024-11-24 02:01:12,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:12,763 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-24 02:01:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891725010] [2024-11-24 02:01:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891725010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158015511] [2024-11-24 02:01:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:12,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:12,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:12,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:12,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 587 [2024-11-24 02:01:12,786 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-24 02:01:12,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:12,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 587 [2024-11-24 02:01:12,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:13,020 INFO L124 PetriNetUnfolderBase]: 34/1084 cut-off events. [2024-11-24 02:01:13,021 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-24 02:01:13,024 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-24 02:01:13,027 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 9 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-11-24 02:01:13,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 552 transitions, 1132 flow [2024-11-24 02:01:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2024-11-24 02:01:13,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710391822827938 [2024-11-24 02:01:13,031 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1116 flow. Second operand 3 states and 1710 transitions. [2024-11-24 02:01:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 552 transitions, 1132 flow [2024-11-24 02:01:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 552 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:13,041 INFO L231 Difference]: Finished difference. Result has 549 places, 552 transitions, 1110 flow [2024-11-24 02:01:13,041 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-24 02:01:13,042 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -26 predicate places. [2024-11-24 02:01:13,042 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 552 transitions, 1110 flow [2024-11-24 02:01:13,043 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-24 02:01:13,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:13,043 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-24 02:01:13,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 02:01:13,043 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-24 02:01:13,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1100205178, now seen corresponding path program 1 times [2024-11-24 02:01:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692857256] [2024-11-24 02:01:13,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:17,453 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-24 02:01:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692857256] [2024-11-24 02:01:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692857256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:01:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211335851] [2024-11-24 02:01:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 02:01:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:17,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 02:01:17,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-24 02:01:18,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 525 out of 587 [2024-11-24 02:01:18,087 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-24 02:01:18,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:18,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 525 of 587 [2024-11-24 02:01:18,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:18,477 INFO L124 PetriNetUnfolderBase]: 126/1121 cut-off events. [2024-11-24 02:01:18,477 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-24 02:01:18,482 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-24 02:01:18,486 INFO L140 encePairwiseOnDemand]: 577/587 looper letters, 42 selfloop transitions, 9 changer transitions 0/551 dead transitions. [2024-11-24 02:01:18,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 551 transitions, 1210 flow [2024-11-24 02:01:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:01:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 02:01:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5302 transitions. [2024-11-24 02:01:18,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903236797274276 [2024-11-24 02:01:18,500 INFO L175 Difference]: Start difference. First operand has 549 places, 552 transitions, 1110 flow. Second operand 10 states and 5302 transitions. [2024-11-24 02:01:18,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 551 transitions, 1210 flow [2024-11-24 02:01:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 551 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:18,511 INFO L231 Difference]: Finished difference. Result has 556 places, 551 transitions, 1125 flow [2024-11-24 02:01:18,512 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-24 02:01:18,513 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -19 predicate places. [2024-11-24 02:01:18,513 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 551 transitions, 1125 flow [2024-11-24 02:01:18,515 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-24 02:01:18,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:18,516 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-24 02:01:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 02:01:18,516 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-24 02:01:18,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1189561870, now seen corresponding path program 1 times [2024-11-24 02:01:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:18,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23554175] [2024-11-24 02:01:18,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:18,685 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-24 02:01:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23554175] [2024-11-24 02:01:18,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23554175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:18,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270542483] [2024-11-24 02:01:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:18,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:18,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:18,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-24 02:01:18,748 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-24 02:01:18,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:18,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-24 02:01:18,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:18,964 INFO L124 PetriNetUnfolderBase]: 22/678 cut-off events. [2024-11-24 02:01:18,964 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-24 02:01:18,967 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-24 02:01:18,969 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-24 02:01:18,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 550 transitions, 1151 flow [2024-11-24 02:01:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2024-11-24 02:01:18,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659284497444633 [2024-11-24 02:01:18,975 INFO L175 Difference]: Start difference. First operand has 556 places, 551 transitions, 1125 flow. Second operand 3 states and 1701 transitions. [2024-11-24 02:01:18,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 550 transitions, 1151 flow [2024-11-24 02:01:18,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 550 transitions, 1133 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-24 02:01:18,984 INFO L231 Difference]: Finished difference. Result has 548 places, 550 transitions, 1109 flow [2024-11-24 02:01:18,985 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-24 02:01:18,986 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -27 predicate places. [2024-11-24 02:01:18,986 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 550 transitions, 1109 flow [2024-11-24 02:01:18,986 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-24 02:01:18,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:18,987 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-24 02:01:18,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 02:01:18,987 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-24 02:01:18,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1481215302, now seen corresponding path program 1 times [2024-11-24 02:01:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529549853] [2024-11-24 02:01:18,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:19,175 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-24 02:01:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529549853] [2024-11-24 02:01:19,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529549853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:19,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:19,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037904920] [2024-11-24 02:01:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:19,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:19,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:19,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 560 out of 587 [2024-11-24 02:01:19,215 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-24 02:01:19,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:19,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 560 of 587 [2024-11-24 02:01:19,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:19,542 INFO L124 PetriNetUnfolderBase]: 45/1044 cut-off events. [2024-11-24 02:01:19,542 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-24 02:01:19,546 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-24 02:01:19,550 INFO L140 encePairwiseOnDemand]: 582/587 looper letters, 13 selfloop transitions, 1 changer transitions 0/546 dead transitions. [2024-11-24 02:01:19,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 546 transitions, 1129 flow [2024-11-24 02:01:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1698 transitions. [2024-11-24 02:01:19,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642248722316865 [2024-11-24 02:01:19,556 INFO L175 Difference]: Start difference. First operand has 548 places, 550 transitions, 1109 flow. Second operand 3 states and 1698 transitions. [2024-11-24 02:01:19,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 546 transitions, 1129 flow [2024-11-24 02:01:19,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 546 transitions, 1125 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:19,570 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1099 flow [2024-11-24 02:01:19,571 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-24 02:01:19,571 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-24 02:01:19,571 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1099 flow [2024-11-24 02:01:19,572 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-24 02:01:19,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:19,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:01:19,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-24 02:01:19,573 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-24 02:01:19,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1892750420, now seen corresponding path program 1 times [2024-11-24 02:01:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972735427] [2024-11-24 02:01:19,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:19,782 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-24 02:01:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972735427] [2024-11-24 02:01:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972735427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:19,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632235948] [2024-11-24 02:01:19,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:19,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:19,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:19,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:19,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 570 out of 587 [2024-11-24 02:01:19,793 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-24 02:01:19,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:19,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 570 of 587 [2024-11-24 02:01:19,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:19,944 INFO L124 PetriNetUnfolderBase]: 13/587 cut-off events. [2024-11-24 02:01:19,945 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:19,947 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-24 02:01:19,949 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 6 selfloop transitions, 1 changer transitions 0/545 dead transitions. [2024-11-24 02:01:19,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 545 transitions, 1111 flow [2024-11-24 02:01:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1718 transitions. [2024-11-24 02:01:19,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755820556501987 [2024-11-24 02:01:19,954 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1099 flow. Second operand 3 states and 1718 transitions. [2024-11-24 02:01:19,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 545 transitions, 1111 flow [2024-11-24 02:01:19,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 545 transitions, 1110 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:19,964 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1098 flow [2024-11-24 02:01:19,964 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-24 02:01:19,990 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-24 02:01:19,990 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1098 flow [2024-11-24 02:01:19,990 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-24 02:01:19,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:19,991 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-24 02:01:19,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 02:01:19,991 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-24 02:01:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1377557941, now seen corresponding path program 1 times [2024-11-24 02:01:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957488492] [2024-11-24 02:01:19,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:20,138 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-24 02:01:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957488492] [2024-11-24 02:01:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957488492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057029034] [2024-11-24 02:01:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:20,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:20,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:20,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:20,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-24 02:01:20,183 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-24 02:01:20,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:20,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-24 02:01:20,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:20,330 INFO L124 PetriNetUnfolderBase]: 23/714 cut-off events. [2024-11-24 02:01:20,330 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-24 02:01:20,333 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-24 02:01:20,338 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 13 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-11-24 02:01:20,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 544 transitions, 1126 flow [2024-11-24 02:01:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2024-11-24 02:01:20,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966496308915389 [2024-11-24 02:01:20,343 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1098 flow. Second operand 3 states and 1702 transitions. [2024-11-24 02:01:20,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 544 transitions, 1126 flow [2024-11-24 02:01:20,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 544 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:20,353 INFO L231 Difference]: Finished difference. Result has 544 places, 544 transitions, 1099 flow [2024-11-24 02:01:20,354 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-24 02:01:20,355 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -31 predicate places. [2024-11-24 02:01:20,355 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 544 transitions, 1099 flow [2024-11-24 02:01:20,355 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-24 02:01:20,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:20,356 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-24 02:01:20,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 02:01:20,356 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-24 02:01:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash 20257327, now seen corresponding path program 1 times [2024-11-24 02:01:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406274013] [2024-11-24 02:01:20,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:20,502 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-24 02:01:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406274013] [2024-11-24 02:01:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406274013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:20,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213832508] [2024-11-24 02:01:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:20,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:20,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:20,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:20,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:20,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 587 [2024-11-24 02:01:20,534 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-24 02:01:20,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:20,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 587 [2024-11-24 02:01:20,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:20,797 INFO L124 PetriNetUnfolderBase]: 44/1078 cut-off events. [2024-11-24 02:01:20,798 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-24 02:01:20,802 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-24 02:01:20,808 INFO L140 encePairwiseOnDemand]: 581/587 looper letters, 16 selfloop transitions, 3 changer transitions 0/547 dead transitions. [2024-11-24 02:01:20,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 547 transitions, 1147 flow [2024-11-24 02:01:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1708 transitions. [2024-11-24 02:01:20,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699034639409426 [2024-11-24 02:01:20,813 INFO L175 Difference]: Start difference. First operand has 544 places, 544 transitions, 1099 flow. Second operand 3 states and 1708 transitions. [2024-11-24 02:01:20,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 547 transitions, 1147 flow [2024-11-24 02:01:20,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 547 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 02:01:20,824 INFO L231 Difference]: Finished difference. Result has 542 places, 542 transitions, 1102 flow [2024-11-24 02:01:20,825 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-24 02:01:20,825 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-11-24 02:01:20,826 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 542 transitions, 1102 flow [2024-11-24 02:01:20,826 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-24 02:01:20,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:20,826 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-24 02:01:20,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 02:01:20,827 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-24 02:01:20,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash -481240162, now seen corresponding path program 1 times [2024-11-24 02:01:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:20,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477018901] [2024-11-24 02:01:20,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:20,965 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-24 02:01:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477018901] [2024-11-24 02:01:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477018901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898475033] [2024-11-24 02:01:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:20,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:20,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:20,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:20,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-24 02:01:20,978 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-24 02:01:20,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:20,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-24 02:01:20,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:21,316 INFO L124 PetriNetUnfolderBase]: 49/1463 cut-off events. [2024-11-24 02:01:21,316 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-24 02:01:21,323 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-24 02:01:21,327 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/544 dead transitions. [2024-11-24 02:01:21,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 544 transitions, 1130 flow [2024-11-24 02:01:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-11-24 02:01:21,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-11-24 02:01:21,332 INFO L175 Difference]: Start difference. First operand has 542 places, 542 transitions, 1102 flow. Second operand 3 states and 1719 transitions. [2024-11-24 02:01:21,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 544 transitions, 1130 flow [2024-11-24 02:01:21,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 544 transitions, 1127 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:21,342 INFO L231 Difference]: Finished difference. Result has 542 places, 541 transitions, 1099 flow [2024-11-24 02:01:21,343 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-24 02:01:21,344 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -33 predicate places. [2024-11-24 02:01:21,344 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 541 transitions, 1099 flow [2024-11-24 02:01:21,345 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-24 02:01:21,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:21,345 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-24 02:01:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-24 02:01:21,346 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-24 02:01:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1707080083, now seen corresponding path program 1 times [2024-11-24 02:01:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509242481] [2024-11-24 02:01:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:21,557 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-24 02:01:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509242481] [2024-11-24 02:01:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509242481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430481353] [2024-11-24 02:01:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:21,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:21,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:21,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:21,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 563 out of 587 [2024-11-24 02:01:21,624 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-24 02:01:21,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:21,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 563 of 587 [2024-11-24 02:01:21,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:21,877 INFO L124 PetriNetUnfolderBase]: 30/861 cut-off events. [2024-11-24 02:01:21,877 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-11-24 02:01:21,881 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-24 02:01:21,884 INFO L140 encePairwiseOnDemand]: 584/587 looper letters, 14 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2024-11-24 02:01:21,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 541 transitions, 1131 flow [2024-11-24 02:01:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1705 transitions. [2024-11-24 02:01:21,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9681998864281658 [2024-11-24 02:01:21,890 INFO L175 Difference]: Start difference. First operand has 542 places, 541 transitions, 1099 flow. Second operand 3 states and 1705 transitions. [2024-11-24 02:01:21,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 541 transitions, 1131 flow [2024-11-24 02:01:21,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 541 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:21,900 INFO L231 Difference]: Finished difference. Result has 543 places, 541 transitions, 1106 flow [2024-11-24 02:01:21,901 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-24 02:01:21,901 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-24 02:01:21,901 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 541 transitions, 1106 flow [2024-11-24 02:01:21,902 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-24 02:01:21,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:01:21,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-24 02:01:21,903 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-24 02:01:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1384715168, now seen corresponding path program 1 times [2024-11-24 02:01:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11802880] [2024-11-24 02:01:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:22,039 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-24 02:01:22,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11802880] [2024-11-24 02:01:22,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11802880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:22,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:22,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042271775] [2024-11-24 02:01:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:22,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:22,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:22,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-24 02:01:22,053 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-24 02:01:22,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:22,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-24 02:01:22,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:22,368 INFO L124 PetriNetUnfolderBase]: 49/1445 cut-off events. [2024-11-24 02:01:22,369 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-24 02:01:22,376 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-24 02:01:22,381 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 10 selfloop transitions, 1 changer transitions 0/543 dead transitions. [2024-11-24 02:01:22,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 543 transitions, 1134 flow [2024-11-24 02:01:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1719 transitions. [2024-11-24 02:01:22,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9761499148211243 [2024-11-24 02:01:22,386 INFO L175 Difference]: Start difference. First operand has 543 places, 541 transitions, 1106 flow. Second operand 3 states and 1719 transitions. [2024-11-24 02:01:22,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 543 transitions, 1134 flow [2024-11-24 02:01:22,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 543 transitions, 1132 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:22,396 INFO L231 Difference]: Finished difference. Result has 543 places, 540 transitions, 1104 flow [2024-11-24 02:01:22,397 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-24 02:01:22,398 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-24 02:01:22,398 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 540 transitions, 1104 flow [2024-11-24 02:01:22,398 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-24 02:01:22,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:22,399 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-24 02:01:22,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 02:01:22,399 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-24 02:01:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash 424076854, now seen corresponding path program 1 times [2024-11-24 02:01:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:22,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286449983] [2024-11-24 02:01:22,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:22,528 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-24 02:01:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286449983] [2024-11-24 02:01:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286449983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:01:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497902213] [2024-11-24 02:01:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 02:01:22,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:22,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 02:01:22,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 02:01:22,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 587 [2024-11-24 02:01:22,545 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-24 02:01:22,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:22,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 587 [2024-11-24 02:01:22,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:22,747 INFO L124 PetriNetUnfolderBase]: 23/800 cut-off events. [2024-11-24 02:01:22,747 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2024-11-24 02:01:22,752 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-24 02:01:22,754 INFO L140 encePairwiseOnDemand]: 585/587 looper letters, 7 selfloop transitions, 1 changer transitions 1/540 dead transitions. [2024-11-24 02:01:22,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 540 transitions, 1123 flow [2024-11-24 02:01:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 02:01:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 02:01:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2024-11-24 02:01:22,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9750141964792731 [2024-11-24 02:01:22,760 INFO L175 Difference]: Start difference. First operand has 543 places, 540 transitions, 1104 flow. Second operand 3 states and 1717 transitions. [2024-11-24 02:01:22,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 540 transitions, 1123 flow [2024-11-24 02:01:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 540 transitions, 1122 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:22,775 INFO L231 Difference]: Finished difference. Result has 543 places, 539 transitions, 1103 flow [2024-11-24 02:01:22,776 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-24 02:01:22,781 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -32 predicate places. [2024-11-24 02:01:22,781 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 539 transitions, 1103 flow [2024-11-24 02:01:22,782 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-24 02:01:22,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:22,783 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-24 02:01:22,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-24 02:01:22,783 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-24 02:01:22,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:22,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1493992376, now seen corresponding path program 1 times [2024-11-24 02:01:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:22,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337980994] [2024-11-24 02:01:22,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:25,626 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-24 02:01:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337980994] [2024-11-24 02:01:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337980994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:01:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800431083] [2024-11-24 02:01:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 02:01:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:25,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 02:01:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-24 02:01:26,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 587 [2024-11-24 02:01:26,326 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-24 02:01:26,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:26,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 587 [2024-11-24 02:01:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:27,222 INFO L124 PetriNetUnfolderBase]: 303/2861 cut-off events. [2024-11-24 02:01:27,222 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-24 02:01:27,238 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-24 02:01:27,245 INFO L140 encePairwiseOnDemand]: 553/587 looper letters, 67 selfloop transitions, 45 changer transitions 6/597 dead transitions. [2024-11-24 02:01:27,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 597 transitions, 1461 flow [2024-11-24 02:01:27,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:01:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 02:01:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5346 transitions. [2024-11-24 02:01:27,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9107325383304941 [2024-11-24 02:01:27,259 INFO L175 Difference]: Start difference. First operand has 543 places, 539 transitions, 1103 flow. Second operand 10 states and 5346 transitions. [2024-11-24 02:01:27,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 597 transitions, 1461 flow [2024-11-24 02:01:27,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 597 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 02:01:27,269 INFO L231 Difference]: Finished difference. Result has 560 places, 576 transitions, 1419 flow [2024-11-24 02:01:27,270 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-24 02:01:27,272 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, -15 predicate places. [2024-11-24 02:01:27,272 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 576 transitions, 1419 flow [2024-11-24 02:01:27,274 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-24 02:01:27,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:27,274 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-24 02:01:27,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-24 02:01:27,275 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-24 02:01:27,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1075568129, now seen corresponding path program 1 times [2024-11-24 02:01:27,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:27,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468758262] [2024-11-24 02:01:27,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:36,329 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-24 02:01:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468758262] [2024-11-24 02:01:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468758262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-24 02:01:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620030890] [2024-11-24 02:01:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 02:01:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 02:01:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-24 02:01:43,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-24 02:01:43,838 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-24 02:01:43,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:01:43,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-24 02:01:43,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:01:50,667 INFO L124 PetriNetUnfolderBase]: 1164/5780 cut-off events. [2024-11-24 02:01:50,667 INFO L125 PetriNetUnfolderBase]: For 977/1069 co-relation queries the response was YES. [2024-11-24 02:01:50,701 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-24 02:01:50,718 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 276 selfloop transitions, 115 changer transitions 6/833 dead transitions. [2024-11-24 02:01:50,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 833 transitions, 3373 flow [2024-11-24 02:01:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-24 02:01:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-11-24 02:01:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 16995 transitions. [2024-11-24 02:01:50,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272085665612071 [2024-11-24 02:01:50,740 INFO L175 Difference]: Start difference. First operand has 560 places, 576 transitions, 1419 flow. Second operand 35 states and 16995 transitions. [2024-11-24 02:01:50,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 833 transitions, 3373 flow [2024-11-24 02:01:50,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 833 transitions, 3373 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 02:01:50,776 INFO L231 Difference]: Finished difference. Result has 601 places, 654 transitions, 2295 flow [2024-11-24 02:01:50,777 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-24 02:01:50,778 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 26 predicate places. [2024-11-24 02:01:50,778 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 654 transitions, 2295 flow [2024-11-24 02:01:50,783 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-24 02:01:50,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:01:50,784 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-24 02:01:50,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-24 02:01:50,784 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-24 02:01:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2110446327, now seen corresponding path program 2 times [2024-11-24 02:01:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439564088] [2024-11-24 02:01:50,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:01:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:50,893 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-24 02:01:50,893 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:01:58,331 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-24 02:01:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439564088] [2024-11-24 02:01:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439564088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:58,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-24 02:01:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818219778] [2024-11-24 02:01:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:58,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 02:01:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:58,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 02:01:58,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-24 02:02:06,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-24 02:02:06,181 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-24 02:02:06,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:02:06,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-24 02:02:06,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:02:12,756 INFO L124 PetriNetUnfolderBase]: 1742/7824 cut-off events. [2024-11-24 02:02:12,756 INFO L125 PetriNetUnfolderBase]: For 6329/6711 co-relation queries the response was YES. [2024-11-24 02:02:12,792 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-24 02:02:12,820 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 377 selfloop transitions, 176 changer transitions 0/989 dead transitions. [2024-11-24 02:02:12,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 989 transitions, 5478 flow [2024-11-24 02:02:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-24 02:02:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-24 02:02:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17517 transitions. [2024-11-24 02:02:12,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289324247586598 [2024-11-24 02:02:12,839 INFO L175 Difference]: Start difference. First operand has 601 places, 654 transitions, 2295 flow. Second operand 36 states and 17517 transitions. [2024-11-24 02:02:12,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 989 transitions, 5478 flow [2024-11-24 02:02:12,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 989 transitions, 5441 flow, removed 0 selfloop flow, removed 19 redundant places. [2024-11-24 02:02:12,896 INFO L231 Difference]: Finished difference. Result has 632 places, 764 transitions, 3885 flow [2024-11-24 02:02:12,897 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-24 02:02:12,899 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 57 predicate places. [2024-11-24 02:02:12,899 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 764 transitions, 3885 flow [2024-11-24 02:02:12,901 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-24 02:02:12,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:02:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:02:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 02:02:12,903 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-24 02:02:12,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:02:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 188933319, now seen corresponding path program 3 times [2024-11-24 02:02:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:02:12,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081081077] [2024-11-24 02:02:12,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:02:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:02:12,999 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-24 02:02:12,999 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:02:18,568 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-24 02:02:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:02:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081081077] [2024-11-24 02:02:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081081077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:02:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:02:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-24 02:02:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118628372] [2024-11-24 02:02:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:02:18,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 02:02:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:02:18,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 02:02:18,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-24 02:02:26,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-24 02:02:26,736 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-24 02:02:26,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:02:26,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-24 02:02:26,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:02:32,992 INFO L124 PetriNetUnfolderBase]: 2017/9329 cut-off events. [2024-11-24 02:02:32,992 INFO L125 PetriNetUnfolderBase]: For 18117/18681 co-relation queries the response was YES. [2024-11-24 02:02:33,068 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-24 02:02:33,105 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 405 selfloop transitions, 234 changer transitions 0/1075 dead transitions. [2024-11-24 02:02:33,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 1075 transitions, 7649 flow [2024-11-24 02:02:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-24 02:02:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-24 02:02:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17505 transitions. [2024-11-24 02:02:33,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283645655877342 [2024-11-24 02:02:33,123 INFO L175 Difference]: Start difference. First operand has 632 places, 764 transitions, 3885 flow. Second operand 36 states and 17505 transitions. [2024-11-24 02:02:33,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 1075 transitions, 7649 flow [2024-11-24 02:02:33,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 1075 transitions, 7484 flow, removed 46 selfloop flow, removed 20 redundant places. [2024-11-24 02:02:33,287 INFO L231 Difference]: Finished difference. Result has 663 places, 865 transitions, 5839 flow [2024-11-24 02:02:33,289 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-24 02:02:33,289 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 88 predicate places. [2024-11-24 02:02:33,289 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 865 transitions, 5839 flow [2024-11-24 02:02:33,292 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-24 02:02:33,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:02:33,293 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-24 02:02:33,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-24 02:02:33,294 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-24 02:02:33,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:02:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1346421843, now seen corresponding path program 4 times [2024-11-24 02:02:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:02:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122466581] [2024-11-24 02:02:33,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-24 02:02:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:02:33,516 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-24 02:02:33,517 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:02:42,125 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-24 02:02:42,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:02:42,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122466581] [2024-11-24 02:02:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122466581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:02:42,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:02:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-24 02:02:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440181277] [2024-11-24 02:02:42,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:02:42,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-24 02:02:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:02:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-24 02:02:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2024-11-24 02:02:47,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 587 [2024-11-24 02:02:47,437 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-24 02:02:47,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:02:47,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 587 [2024-11-24 02:02:47,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:02:53,936 INFO L124 PetriNetUnfolderBase]: 2335/10820 cut-off events. [2024-11-24 02:02:53,936 INFO L125 PetriNetUnfolderBase]: For 37637/38256 co-relation queries the response was YES. [2024-11-24 02:02:54,014 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-24 02:02:54,055 INFO L140 encePairwiseOnDemand]: 530/587 looper letters, 444 selfloop transitions, 323 changer transitions 0/1217 dead transitions. [2024-11-24 02:02:54,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 1217 transitions, 11164 flow [2024-11-24 02:02:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-24 02:02:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-11-24 02:02:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 16517 transitions. [2024-11-24 02:02:54,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526663569253007 [2024-11-24 02:02:54,072 INFO L175 Difference]: Start difference. First operand has 663 places, 865 transitions, 5839 flow. Second operand 33 states and 16517 transitions. [2024-11-24 02:02:54,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 1217 transitions, 11164 flow [2024-11-24 02:02:54,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 676 places, 1217 transitions, 10867 flow, removed 130 selfloop flow, removed 19 redundant places. [2024-11-24 02:02:54,330 INFO L231 Difference]: Finished difference. Result has 696 places, 1000 transitions, 8608 flow [2024-11-24 02:02:54,331 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-24 02:02:54,332 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 121 predicate places. [2024-11-24 02:02:54,332 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 1000 transitions, 8608 flow [2024-11-24 02:02:54,334 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-24 02:02:54,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:02:54,335 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-24 02:02:54,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-24 02:02:54,336 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-24 02:02:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:02:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1462804941, now seen corresponding path program 5 times [2024-11-24 02:02:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:02:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807749570] [2024-11-24 02:02:54,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-24 02:02:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:02:54,427 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:02:54,427 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:03:01,486 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-24 02:03:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:03:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807749570] [2024-11-24 02:03:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807749570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:03:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:03:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-11-24 02:03:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795841177] [2024-11-24 02:03:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:03:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-24 02:03:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:03:01,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-24 02:03:01,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-11-24 02:03:07,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 587 [2024-11-24 02:03:07,646 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-24 02:03:07,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:03:07,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 587 [2024-11-24 02:03:07,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:03:16,339 INFO L124 PetriNetUnfolderBase]: 2433/11336 cut-off events. [2024-11-24 02:03:16,339 INFO L125 PetriNetUnfolderBase]: For 66624/67609 co-relation queries the response was YES. [2024-11-24 02:03:16,461 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-24 02:03:16,495 INFO L140 encePairwiseOnDemand]: 520/587 looper letters, 658 selfloop transitions, 256 changer transitions 0/1353 dead transitions. [2024-11-24 02:03:16,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 1353 transitions, 14354 flow [2024-11-24 02:03:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-24 02:03:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-24 02:03:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17539 transitions. [2024-11-24 02:03:16,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299734999053568 [2024-11-24 02:03:16,510 INFO L175 Difference]: Start difference. First operand has 696 places, 1000 transitions, 8608 flow. Second operand 36 states and 17539 transitions. [2024-11-24 02:03:16,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 1353 transitions, 14354 flow [2024-11-24 02:03:16,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 1353 transitions, 14260 flow, removed 11 selfloop flow, removed 12 redundant places. [2024-11-24 02:03:16,889 INFO L231 Difference]: Finished difference. Result has 733 places, 1074 transitions, 10831 flow [2024-11-24 02:03:16,890 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-24 02:03:16,890 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 158 predicate places. [2024-11-24 02:03:16,890 INFO L471 AbstractCegarLoop]: Abstraction has has 733 places, 1074 transitions, 10831 flow [2024-11-24 02:03:16,892 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-24 02:03:16,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:03:16,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:03:16,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-24 02:03:16,892 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-24 02:03:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:03:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1260468431, now seen corresponding path program 6 times [2024-11-24 02:03:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:03:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742853410] [2024-11-24 02:03:16,895 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-24 02:03:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:03:16,987 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-24 02:03:16,987 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:03:24,559 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-24 02:03:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:03:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742853410] [2024-11-24 02:03:24,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742853410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:03:24,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493898747] [2024-11-24 02:03:24,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-24 02:03:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:03:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:03:24,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:03:24,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 02:03:25,260 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-24 02:03:25,260 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:03:25,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-24 02:03:25,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:03:25,832 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:25,834 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-24 02:03:25,922 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-24 02:03:25,922 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-24 02:03:26,090 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,091 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-24 02:03:26,174 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,174 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-24 02:03:26,259 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,260 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-24 02:03:26,346 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,346 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-24 02:03:26,427 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,427 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-24 02:03:26,502 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-24 02:03:26,502 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-24 02:03:26,662 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,663 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-24 02:03:26,744 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,745 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-24 02:03:26,823 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,823 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-24 02:03:26,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:26,902 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-24 02:03:26,969 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-24 02:03:26,970 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-24 02:03:27,127 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:27,127 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-24 02:03:27,208 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:27,209 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-24 02:03:27,280 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:03:27,280 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-24 02:03:27,334 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:03:27,334 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-24 02:03:28,827 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-24 02:03:28,953 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-24 02:03:29,030 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-24 02:03:29,114 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-24 02:03:29,200 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-24 02:03:29,303 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-24 02:03:29,413 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-24 02:03:29,556 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-24 02:03:29,720 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-24 02:03:29,847 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-24 02:03:29,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:03:34,628 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-24 02:03:39,598 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-24 02:03:44,374 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-24 02:03:49,073 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-24 02:03:54,462 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-24 02:03:58,917 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-24 02:04:03,484 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-24 02:04:08,562 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-24 02:04:13,737 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-24 02:04:13,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:04:13,987 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-24 02:04:14,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:04:14,048 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-24 02:04:14,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:04:14,093 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-24 02:04:14,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:04:14,418 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-24 02:04:14,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:04:14,489 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-24 02:04:14,558 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-24 02:04:14,665 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:04:14,666 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-24 02:04:14,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:04:14,837 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-24 02:04:14,910 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:04:14,910 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-24 02:04:14,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:04:14,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:04:14,967 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-24 02:04:15,058 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:04:15,058 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-24 02:04:15,089 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:04:15,090 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-24 02:04:15,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:04:15,292 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-24 02:04:15,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:04:15,367 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-24 02:04:15,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:04:15,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:04:15,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:04:15,427 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-24 02:04:15,469 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:04:15,469 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-24 02:05:33,326 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-24 02:05:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493898747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:33,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 62 [2024-11-24 02:05:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843087710] [2024-11-24 02:05:33,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:33,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-24 02:05:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-24 02:05:33,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2583, Unknown=9, NotChecked=1008, Total=3906 [2024-11-24 02:05:34,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 587 [2024-11-24 02:05:34,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 1074 transitions, 10831 flow. Second operand has 63 states, 63 states have (on average 454.6984126984127) internal successors, (28646), 63 states have internal predecessors, (28646), 0 states have call successors, (0), 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-24 02:05:34,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:05:34,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 587 [2024-11-24 02:05:34,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:06:34,292 INFO L124 PetriNetUnfolderBase]: 3379/15740 cut-off events. [2024-11-24 02:06:34,293 INFO L125 PetriNetUnfolderBase]: For 108545/109048 co-relation queries the response was YES. [2024-11-24 02:06:34,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52289 conditions, 15740 events. 3379/15740 cut-off events. For 108545/109048 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 175204 event pairs, 273 based on Foata normal form. 214/15205 useless extension candidates. Maximal degree in co-relation 51861. Up to 1677 conditions per place. [2024-11-24 02:06:34,587 INFO L140 encePairwiseOnDemand]: 533/587 looper letters, 800 selfloop transitions, 316 changer transitions 0/1527 dead transitions. [2024-11-24 02:06:34,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 1527 transitions, 18667 flow [2024-11-24 02:06:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-24 02:06:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-24 02:06:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 14871 transitions. [2024-11-24 02:06:34,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916844122657581 [2024-11-24 02:06:34,601 INFO L175 Difference]: Start difference. First operand has 733 places, 1074 transitions, 10831 flow. Second operand 32 states and 14871 transitions. [2024-11-24 02:06:34,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 1527 transitions, 18667 flow [2024-11-24 02:06:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 1527 transitions, 18114 flow, removed 240 selfloop flow, removed 20 redundant places. [2024-11-24 02:06:35,245 INFO L231 Difference]: Finished difference. Result has 762 places, 1209 transitions, 14139 flow [2024-11-24 02:06:35,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=10279, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=14139, PETRI_PLACES=762, PETRI_TRANSITIONS=1209} [2024-11-24 02:06:35,246 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 187 predicate places. [2024-11-24 02:06:35,246 INFO L471 AbstractCegarLoop]: Abstraction has has 762 places, 1209 transitions, 14139 flow [2024-11-24 02:06:35,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 454.6984126984127) internal successors, (28646), 63 states have internal predecessors, (28646), 0 states have call successors, (0), 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-24 02:06:35,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:06:35,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:06:35,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 02:06:35,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-24 02:06:35,456 INFO L396 AbstractCegarLoop]: === Iteration 36 === 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-24 02:06:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:06:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash 462882173, now seen corresponding path program 7 times [2024-11-24 02:06:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:06:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032887658] [2024-11-24 02:06:35,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-24 02:06:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:06:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:49,791 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-24 02:06:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:06:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032887658] [2024-11-24 02:06:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032887658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:06:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363152171] [2024-11-24 02:06:49,792 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-24 02:06:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:06:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:06:49,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:06:49,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 02:06:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:06:50,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-24 02:06:50,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:06:52,845 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:52,846 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-24 02:06:53,228 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:53,228 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-24 02:06:53,606 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:53,606 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-24 02:06:53,981 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:53,981 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-24 02:06:54,341 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:54,341 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-24 02:06:54,712 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:54,712 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-24 02:06:55,099 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:55,099 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-24 02:06:55,486 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:55,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-24 02:06:55,848 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:55,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-24 02:06:56,223 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:56,223 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-24 02:06:56,589 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:56,589 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-24 02:06:56,968 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:56,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-24 02:06:57,356 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:57,356 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-24 02:06:57,730 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:57,731 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-24 02:06:58,102 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:58,102 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-24 02:06:58,486 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:06:58,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-24 02:06:58,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:06:58,796 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-24 02:07:07,357 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-24 02:07:07,738 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-24 02:07:08,168 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-24 02:07:08,621 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-24 02:07:09,348 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-24 02:07:09,876 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-24 02:07:10,491 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-24 02:07:12,535 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-24 02:07:13,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2024-11-24 02:07:13,684 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-24 02:07:13,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:07:13,887 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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-24 02:07:14,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 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|) .cse1 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2024-11-24 02:07:16,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse2 (+ 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 (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0))))) is different from false [2024-11-24 02:07:16,281 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 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|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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-24 02:07:16,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse1 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse4 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse3 (+ 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|) .cse2 0) .cse1 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse2) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= 0 (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse3))) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |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_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse4) 0)) (forall ((v_ArrVal_1776 (Array Int Int))) (= (select (select (store .cse0 |c_~#nvram_mutex~0.base| v_ArrVal_1776) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))) is different from false [2024-11-24 02:07:21,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:07:21,712 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 53 treesize of output 89 [2024-11-24 02:07:21,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:07:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 100 treesize of output 50 [2024-11-24 02:07:21,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-24 02:07:21,798 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,798 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,817 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,817 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,840 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,840 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,861 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,861 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,881 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,882 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,902 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,902 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:21,922 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:07:21,923 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 1 [2024-11-24 02:07:51,390 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-24 02:07:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363152171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:07:51,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:07:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 69 [2024-11-24 02:07:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344635092] [2024-11-24 02:07:51,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:07:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-24 02:07:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:51,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-24 02:07:51,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=3677, Unknown=101, NotChecked=650, Total=4830 [2024-11-24 02:07:54,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 587 [2024-11-24 02:07:54,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 1209 transitions, 14139 flow. Second operand has 70 states, 70 states have (on average 438.7) internal successors, (30709), 70 states have internal predecessors, (30709), 0 states have call successors, (0), 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-24 02:07:54,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:07:54,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 587 [2024-11-24 02:07:54,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:08:52,805 INFO L124 PetriNetUnfolderBase]: 3512/15306 cut-off events. [2024-11-24 02:08:52,805 INFO L125 PetriNetUnfolderBase]: For 132108/132643 co-relation queries the response was YES. [2024-11-24 02:08:53,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57348 conditions, 15306 events. 3512/15306 cut-off events. For 132108/132643 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 166014 event pairs, 205 based on Foata normal form. 220/14804 useless extension candidates. Maximal degree in co-relation 56897. Up to 2643 conditions per place. [2024-11-24 02:08:53,498 INFO L140 encePairwiseOnDemand]: 509/587 looper letters, 679 selfloop transitions, 444 changer transitions 0/1518 dead transitions. [2024-11-24 02:08:53,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 798 places, 1518 transitions, 20704 flow [2024-11-24 02:08:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-24 02:08:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-11-24 02:08:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 16407 transitions. [2024-11-24 02:08:53,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7554215203278236 [2024-11-24 02:08:53,622 INFO L175 Difference]: Start difference. First operand has 762 places, 1209 transitions, 14139 flow. Second operand 37 states and 16407 transitions. [2024-11-24 02:08:53,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 798 places, 1518 transitions, 20704 flow [2024-11-24 02:08:55,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 1518 transitions, 20065 flow, removed 307 selfloop flow, removed 12 redundant places. [2024-11-24 02:08:55,295 INFO L231 Difference]: Finished difference. Result has 798 places, 1289 transitions, 16729 flow [2024-11-24 02:08:55,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=13590, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=16729, PETRI_PLACES=798, PETRI_TRANSITIONS=1289} [2024-11-24 02:08:55,301 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 223 predicate places. [2024-11-24 02:08:55,301 INFO L471 AbstractCegarLoop]: Abstraction has has 798 places, 1289 transitions, 16729 flow [2024-11-24 02:08:55,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 438.7) internal successors, (30709), 70 states have internal predecessors, (30709), 0 states have call successors, (0), 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-24 02:08:55,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:08:55,309 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-24 02:08:55,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 02:08:55,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-24 02:08:55,510 INFO L396 AbstractCegarLoop]: === Iteration 37 === 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-24 02:08:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1706730917, now seen corresponding path program 8 times [2024-11-24 02:08:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013037775] [2024-11-24 02:08:55,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:08:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:55,617 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:08:55,617 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:09:08,466 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-24 02:09:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:09:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013037775] [2024-11-24 02:09:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013037775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:09:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879078230] [2024-11-24 02:09:08,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:09:08,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:09:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:09:08,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:09:08,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 02:09:09,248 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:09:09,248 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:09:09,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-24 02:09:09,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:09:11,772 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:11,772 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-24 02:09:12,165 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:12,165 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-24 02:09:12,587 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:12,587 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-24 02:09:13,004 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:13,004 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-24 02:09:13,389 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:13,389 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-24 02:09:13,779 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:13,779 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-24 02:09:14,136 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:14,137 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-24 02:09:14,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:14,564 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-24 02:09:15,079 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:15,079 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-24 02:09:15,466 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:15,466 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-24 02:09:15,837 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:15,837 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-24 02:09:16,186 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:16,186 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-24 02:09:16,562 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:16,562 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-24 02:09:16,857 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-24 02:09:16,857 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-24 02:09:17,543 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:17,543 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-24 02:09:17,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:09:17,901 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-24 02:09:18,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:09:18,216 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-24 02:09:27,262 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-24 02:09:28,018 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-24 02:09:28,494 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-24 02:09:28,986 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-24 02:09:29,488 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-24 02:09:30,068 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-24 02:09:30,644 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-24 02:09:31,248 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-24 02:09:32,056 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-24 02:09:32,660 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-24 02:09:32,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:09:38,527 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_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= (let ((.cse6 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse6) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse6) .cse5 .cse6)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse7 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1970)) (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 7 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store |c_#race| |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)))))) is different from false [2024-11-24 02:09:44,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ 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 (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10 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_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (not (= (let ((.cse7 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse7) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (let ((.cse14 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse14) .cse5 .cse14)) v_ArrVal_1970)))))))) is different from false [2024-11-24 02:09:49,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 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 (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14 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_1970 (Array Int Int))) (or (= 0 (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1))) (not (= (let ((.cse3 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse8) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse8) .cse6 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse9) .cse6 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse10) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse11) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse11) .cse6 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse12) .cse6 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse13) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse13) .cse6 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse15 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse15) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse15) .cse6 .cse15)) v_ArrVal_1970)))))))) is different from false [2024-11-24 02:09:53,536 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 ((.cse6 (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 ((.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_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= 0 (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) 0) (not (= (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse13) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse14 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse14) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse14) .cse5 .cse14)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse15) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0) (not (= (let ((.cse16 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse16) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse16) .cse5 .cse16)) v_ArrVal_1970)))))))) is different from false [2024-11-24 02:09:58,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse9 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 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|) .cse12 0) .cse9 0) .cse14 0) .cse1 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_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= (let ((.cse4 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse4) .cse7 .cse4)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse8 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse8) .cse7 .cse8)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse10 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse10) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse10) .cse7 .cse10)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse11) .cse7 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse13) .cse7 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse15) .cse7 .cse15)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (not (= (let ((.cse16 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse16) .cse7 .cse16)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (not (= (let ((.cse17 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse17) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse17) .cse7 .cse17)) v_ArrVal_1970)) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) 0))))))) is different from false [2024-11-24 02:10:02,658 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse16 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse11 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 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 (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8 0) .cse16 0) .cse11 0) .cse14 0) .cse10 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_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (let ((.cse3 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse3) .cse6 .cse3)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse7 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse7) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse7) .cse6 .cse7)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse9 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse9) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse9) .cse6 .cse9)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1970 (let ((.cse12 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse12) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse12) .cse6 .cse12)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse13) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse13) .cse6 .cse13)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (let ((.cse15 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse15) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse15) .cse6 .cse15)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0) (not (= v_ArrVal_1970 (let ((.cse17 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse17) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse17) .cse6 .cse17)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0) (not (= v_ArrVal_1970 (let ((.cse18 (select v_ArrVal_1970 .cse5))) (store (store (store (store .cse1 .cse2 .cse18) .cse4 (select v_ArrVal_1970 .cse4)) .cse5 .cse18) .cse6 .cse18)))))))))) is different from false [2024-11-24 02:10:07,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse10 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse12 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse17 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 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 (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16 0) .cse10 0) .cse12 0) .cse17 0) .cse14 0) .cse7 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_1970 (Array Int Int))) (or (not (= (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0) (not (= (let ((.cse8 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse8) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse11 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse11) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse11) .cse5 .cse11)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse15 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse15) .cse5 .cse15)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= (let ((.cse18 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse18) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse18) .cse5 .cse18)) v_ArrVal_1970)))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= (let ((.cse19 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse19) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse19) .cse5 .cse19)) v_ArrVal_1970)) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |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-24 02:10:11,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse20 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse1 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse17 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse12 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse9 (+ 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) .cse20 0) .cse1 0) .cse17 0) .cse12 0) .cse14 0) .cse9 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_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse1) 0) (not (= v_ArrVal_1970 (let ((.cse4 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse4) .cse7 .cse4)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse8 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse8) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse8) .cse7 .cse8)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse9) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse10) 0) (not (= v_ArrVal_1970 (let ((.cse11 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse11) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse11) .cse7 .cse11)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse12) 0) (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse13) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse13) .cse7 .cse13)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0) (not (= v_ArrVal_1970 (let ((.cse15 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse15) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse15) .cse7 .cse15)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse16 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse16) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse16) .cse7 .cse16)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse17) 0) (not (= v_ArrVal_1970 (let ((.cse18 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse18) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse18) .cse7 .cse18)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse19 (select v_ArrVal_1970 .cse6))) (store (store (store (store .cse2 .cse3 .cse19) .cse5 (select v_ArrVal_1970 .cse5)) .cse6 .cse19) .cse7 .cse19)))) (= (select (select (store .cse0 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-11-24 02:10:16,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 1)) (.cse16 (+ 2 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse18 (+ 3 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse14 (+ |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset| 4)) (.cse8 (+ 5 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse7 (+ 6 |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|)) (.cse20 (+ 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 (store (store (select |c_#race| |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11 0) .cse16 0) .cse18 0) .cse14 0) .cse8 0) .cse7 0) .cse20 0)))) (let ((.cse0 (select .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base|)) (.cse1 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 4)) (.cse3 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 5)) (.cse5 (+ 7 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset|)) (.cse4 (+ |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.offset| 6))) (and (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse2 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse2) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse7) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse8) 0) (not (= v_ArrVal_1970 (let ((.cse9 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse9) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse9) .cse5 .cse9)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse10 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse10) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse10) .cse5 .cse10)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.offset|) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse11) 0) (not (= v_ArrVal_1970 (let ((.cse12 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse12) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse12) .cse5 .cse12)))))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse13 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse13) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse13) .cse5 .cse13)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse14) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse15 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse15) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse15) .cse5 .cse15)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse16) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse17 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse17) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse17) .cse5 .cse17)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse18) 0))) (forall ((v_ArrVal_1970 (Array Int Int))) (or (not (= v_ArrVal_1970 (let ((.cse19 (select v_ArrVal_1970 .cse4))) (store (store (store (store .cse0 .cse1 .cse19) .cse3 (select v_ArrVal_1970 .cse3)) .cse4 .cse19) .cse5 .cse19)))) (= (select (select (store .cse6 |c_whoop_wrapper_nvram_unlocked_ioctlThread1of1ForFork1_mutex_lock_#in~lock#1.base| v_ArrVal_1970) |c_whoop_wrapper_read_nvramThread1of1ForFork0_read_nvram_~ppos#1.base|) .cse20) 0))))))) is different from false [2024-11-24 02:10:17,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:10:17,239 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 139 treesize of output 131 [2024-11-24 02:10:17,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:10:17,304 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-24 02:10:17,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:10:17,371 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 1144 treesize of output 1106 [2024-11-24 02:10:17,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:10:17,715 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-24 02:10:17,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:10:17,808 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-24 02:10:17,903 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 2000 treesize of output 1938 [2024-11-24 02:10:18,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:10:18,330 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-24 02:10:18,427 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:10:18,428 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-24 02:10:18,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:10:18,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:10:18,515 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 120 treesize of output 86 [2024-11-24 02:10:18,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 02:10:18,681 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-24 02:10:18,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:10:18,767 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-24 02:10:18,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:10:18,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:10:18,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 02:10:18,825 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 86 treesize of output 52 [2024-11-24 02:10:18,867 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:10:18,867 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-24 02:10:18,891 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:10:18,891 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-24 02:10:18,914 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:10:18,915 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-24 02:10:18,938 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-24 02:10:18,939 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-24 02:11:36,734 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-24 02:11:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879078230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:11:36,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:11:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 20, 20] total 70 [2024-11-24 02:11:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423690382] [2024-11-24 02:11:36,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:11:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-24 02:11:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:11:36,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-24 02:11:36,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3440, Unknown=9, NotChecked=1152, Total=4970 [2024-11-24 02:11:38,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 587 [2024-11-24 02:11:38,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 1289 transitions, 16729 flow. Second operand has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 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-24 02:11:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 02:11:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 587 [2024-11-24 02:11:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 02:13:41,630 INFO L124 PetriNetUnfolderBase]: 4718/20917 cut-off events. [2024-11-24 02:13:41,631 INFO L125 PetriNetUnfolderBase]: For 198661/199363 co-relation queries the response was YES. [2024-11-24 02:13:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79628 conditions, 20917 events. 4718/20917 cut-off events. For 198661/199363 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 244692 event pairs, 185 based on Foata normal form. 388/20268 useless extension candidates. Maximal degree in co-relation 79125. Up to 3451 conditions per place. [2024-11-24 02:13:41,983 INFO L140 encePairwiseOnDemand]: 508/587 looper letters, 1031 selfloop transitions, 757 changer transitions 0/2169 dead transitions. [2024-11-24 02:13:41,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 864 places, 2169 transitions, 32827 flow [2024-11-24 02:13:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-24 02:13:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2024-11-24 02:13:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 28874 transitions. [2024-11-24 02:13:42,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73416562841669 [2024-11-24 02:13:42,013 INFO L175 Difference]: Start difference. First operand has 798 places, 1289 transitions, 16729 flow. Second operand 67 states and 28874 transitions. [2024-11-24 02:13:42,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 864 places, 2169 transitions, 32827 flow [2024-11-24 02:13:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 841 places, 2169 transitions, 32579 flow, removed 51 selfloop flow, removed 23 redundant places. [2024-11-24 02:13:43,650 INFO L231 Difference]: Finished difference. Result has 870 places, 1662 transitions, 26049 flow [2024-11-24 02:13:43,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=587, PETRI_DIFFERENCE_MINUEND_FLOW=16507, PETRI_DIFFERENCE_MINUEND_PLACES=775, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=26049, PETRI_PLACES=870, PETRI_TRANSITIONS=1662} [2024-11-24 02:13:43,653 INFO L279 CegarLoopForPetriNet]: 575 programPoint places, 295 predicate places. [2024-11-24 02:13:43,653 INFO L471 AbstractCegarLoop]: Abstraction has has 870 places, 1662 transitions, 26049 flow [2024-11-24 02:13:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 425.1830985915493) internal successors, (30188), 71 states have internal predecessors, (30188), 0 states have call successors, (0), 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-24 02:13:43,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 02:13:43,658 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-24 02:13:43,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 02:13:43,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-24 02:13:43,862 INFO L396 AbstractCegarLoop]: === Iteration 38 === 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-24 02:13:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:13:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1955583549, now seen corresponding path program 9 times [2024-11-24 02:13:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:13:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410460723] [2024-11-24 02:13:43,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:13:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:13:43,953 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-24 02:13:43,953 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:13:58,428 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-24 02:13:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:13:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410460723] [2024-11-24 02:13:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410460723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:13:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696901989] [2024-11-24 02:13:58,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:13:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:13:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:13:58,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:13:58,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0ed3ca2-99c4-4d10-828d-9fa39eec3807/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 02:13:59,175 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-24 02:13:59,176 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:13:59,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-24 02:13:59,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:14:01,860 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:01,861 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-24 02:14:02,224 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:02,224 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-24 02:14:02,630 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:02,630 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-24 02:14:02,991 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:02,991 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-24 02:14:03,343 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:03,344 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-24 02:14:03,705 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:03,705 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-24 02:14:04,107 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:04,108 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-24 02:14:04,494 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:04,495 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-24 02:14:04,803 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-24 02:14:04,803 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-24 02:14:05,502 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:05,503 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-24 02:14:05,868 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:05,869 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-24 02:14:06,249 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:06,249 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-24 02:14:06,606 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:06,607 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-24 02:14:06,975 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:06,976 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-24 02:14:07,358 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:07,358 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-24 02:14:07,741 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-24 02:14:07,741 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-24 02:14:08,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 02:14:08,050 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-24 02:14:16,155 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-24 02:14:16,542 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-24 02:14:17,011 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-24 02:14:17,461 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-24 02:14:17,985 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-24 02:14:18,558 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-24 02:14:22,158 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-24 02:14:22,815 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