./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/caslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/caslock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccdf0afe8275b0f0027f25e9cbae71f2f65e35cd382dc94e4bf618f0bb694bbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:19,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:19,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:46:19,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:19,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:19,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:19,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:19,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:19,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:19,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:19,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:19,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:19,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:19,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:19,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:19,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:19,548 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccdf0afe8275b0f0027f25e9cbae71f2f65e35cd382dc94e4bf618f0bb694bbb [2025-02-08 05:46:19,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:19,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:19,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:19,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:19,758 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:19,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/caslock.i [2025-02-08 05:46:20,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db540fe3/24d0e5783e42453fb0f906303a346fa1/FLAGf0bc8716a [2025-02-08 05:46:21,460 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:21,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/caslock.i [2025-02-08 05:46:21,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db540fe3/24d0e5783e42453fb0f906303a346fa1/FLAGf0bc8716a [2025-02-08 05:46:21,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db540fe3/24d0e5783e42453fb0f906303a346fa1 [2025-02-08 05:46:21,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:21,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:21,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:21,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:21,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:21,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:21" (1/1) ... [2025-02-08 05:46:21,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1351ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:21, skipping insertion in model container [2025-02-08 05:46:21,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:21" (1/1) ... [2025-02-08 05:46:22,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:24,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:24,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:25,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:46:25,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:46:25,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:46:25,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:46:25,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:46:25,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:46:25,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:46:25,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:46:25,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:46:25,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:46:25,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:46:25,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:46:25,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:46:25,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:46:25,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:46:25,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:46:25,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:46:25,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:46:25,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:46:25,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:46:25,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:46:25,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:46:25,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:46:25,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:46:25,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:46:25,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:46:25,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:46:25,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:46:25,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:46:25,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:46:25,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:46:25,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:46:25,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:46:25,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:46:25,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:46:25,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:46:25,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:46:25,134 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:46:25,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:46:25,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:46:25,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:46:25,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:46:25,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:46:25,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:46:25,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:46:25,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:46:25,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:46:25,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:46:25,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:46:25,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:46:25,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:46:25,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:46:25,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:46:25,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:46:25,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:46:25,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:46:25,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:46:25,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:46:25,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:46:25,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:46:25,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:46:25,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:46:25,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:46:25,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:46:25,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:46:25,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:46:25,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:46:25,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:46:25,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:46:25,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:46:25,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:46:25,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:46:25,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:46:25,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:46:25,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:46:25,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:46:25,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:46:25,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:46:25,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:46:25,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:46:25,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:46:25,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:46:25,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:46:25,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:46:25,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:46:25,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:46:25,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:46:25,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:46:25,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:46:25,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:46:25,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:46:25,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:46:25,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:46:25,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:46:25,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:46:25,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:46:25,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:46:25,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:46:25,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:46:25,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:46:25,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:25,375 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:25,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25 WrapperNode [2025-02-08 05:46:25,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:25,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:25,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:25,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:25,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,464 INFO L138 Inliner]: procedures = 917, calls = 917, calls flagged for inlining = 819, calls inlined = 36, statements flattened = 403 [2025-02-08 05:46:25,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:25,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:25,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:25,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:25,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:25,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:25,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:25,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:25,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (1/1) ... [2025-02-08 05:46:25,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:25,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:46:25,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 05:46:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:25,543 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:46:25,650 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:25,651 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:25,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5996-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:25,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5996: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:26,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387: havoc caslock_tryacquire_#t~ret802#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387-4: havoc vatomic32_cmpxchg_acq_#in~a#1.base, vatomic32_cmpxchg_acq_#in~a#1.offset, vatomic32_cmpxchg_acq_#in~e#1, vatomic32_cmpxchg_acq_#in~v#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387-5: havoc vatomic32_cmpxchg_acq_#t~ret118#1, vatomic32_cmpxchg_acq_~a#1.base, vatomic32_cmpxchg_acq_~a#1.offset, vatomic32_cmpxchg_acq_~e#1, vatomic32_cmpxchg_acq_~v#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387-2: havoc caslock_tryacquire_#t~ret802#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387-3: assume { :end_inline_vatomic32_cmpxchg_acq } true;caslock_tryacquire_#res#1 := (if 0 == caslock_tryacquire_#t~ret802#1 % 4294967296 then 0 else 1); [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5387-6: caslock_tryacquire_#t~ret802#1 := vatomic32_cmpxchg_acq_#res#1; [2025-02-08 05:46:26,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-3: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-5: havoc acquire_#t~ite821#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-6: havoc acquire_#t~ite821#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-9: havoc acquire_#t~ret820#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-10: assume { :end_inline_verification_spin_end } true;acquire_#t~ite821#1 := 0; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-7: assume 0 != acquire_#t~ite821#1; [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-7: assume !(0 != acquire_#t~ite821#1); [2025-02-08 05:46:26,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-8: havoc acquire_#t~ret820#1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-14: assume 0 == acquire_#t~ret820#1 % 256; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-14: assume !(0 == acquire_#t~ret820#1 % 256); [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-17: havoc caslock_tryacquire_#in~l#1.base, caslock_tryacquire_#in~l#1.offset;assume { :end_inline_caslock_tryacquire } true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-18: havoc caslock_tryacquire_#t~ret802#1, caslock_tryacquire_~l#1.base, caslock_tryacquire_~l#1.offset; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-15: acquire_#t~ite821#1 := 1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6016-19: acquire_#t~ret820#1 := caslock_tryacquire_#res#1; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6018: havoc caslock_acquire_#in~l#1.base, caslock_acquire_#in~l#1.offset;assume { :end_inline_caslock_acquire } true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6018-1: havoc caslock_acquire_#t~ret801#1, caslock_acquire_~l#1.base, caslock_acquire_~l#1.offset; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:26,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume !false; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume !true; [2025-02-08 05:46:26,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume !false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume true; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume !true; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume !false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume true; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume !true; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume !false; [2025-02-08 05:46:26,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume true; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume !true; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume false; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume !false; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-3: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-5: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-4: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925: havoc vatomic32_cmpxchg_acq_#t~ret118#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925-2: havoc vatomic32_cmpxchg_acq_#t~ret118#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925-3: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_acq_#res#1 := vatomic32_cmpxchg_acq_#t~ret118#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925-4: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925-5: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925-6: vatomic32_cmpxchg_acq_#t~ret118#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3926-1: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 05:46:26,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382: assume { :end_inline_vatomic32_await_eq_set_acq } true;havoc caslock_acquire_#t~ret801#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382-3: caslock_acquire_#t~ret801#1 := vatomic32_await_eq_set_acq_#res#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382-1: havoc vatomic32_await_eq_set_acq_#in~a#1.base, vatomic32_await_eq_set_acq_#in~a#1.offset, vatomic32_await_eq_set_acq_#in~c#1, vatomic32_await_eq_set_acq_#in~v#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5382-2: havoc vatomic32_await_eq_set_acq_#t~ret232#1, vatomic32_await_eq_set_acq_~a#1.base, vatomic32_await_eq_set_acq_~a#1.offset, vatomic32_await_eq_set_acq_~c#1, vatomic32_await_eq_set_acq_~v#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-26: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-28: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-27: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-30: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-29: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-32: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-31: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-34: [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-33: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-36: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-35: assume ((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-35: assume !(((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1); [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-38: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-37: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-40: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-39: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-42: assume 0 != vatomic32_cmpxchg_#t~ret462#1 % 256; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-42: assume !(0 != vatomic32_cmpxchg_#t~ret462#1 % 256); [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575: havoc vatomic32_await_eq_set_acq_#t~ret232#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-41: SUMMARY for call write~int(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-3: assume { :end_inline_vatomic32_await_eq_set } true;vatomic32_await_eq_set_acq_#res#1 := vatomic32_await_eq_set_acq_#t~ret232#1; [2025-02-08 05:46:26,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-44: vatomic32_cmpxchg_#t~ret462#1 := (if vatomic32_cmpxchg_#t~mem463#1 == vatomic32_cmpxchg_#t~ret464#1 then 1 else 0); [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-2: havoc vatomic32_await_eq_set_acq_#t~ret232#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-43: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-5: havoc vatomic32_await_eq_set_#t~ret791#1, vatomic32_await_eq_set_#t~ret792#1, vatomic32_await_eq_set_~a#1.base, vatomic32_await_eq_set_~a#1.offset, vatomic32_await_eq_set_~c#1, vatomic32_await_eq_set_~v#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-46: SUMMARY for call vatomic32_cmpxchg_#t~mem463#1 := read~int(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-4: havoc vatomic32_await_eq_set_#in~a#1.base, vatomic32_await_eq_set_#in~a#1.offset, vatomic32_await_eq_set_#in~c#1, vatomic32_await_eq_set_#in~v#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-45: vatomic32_cmpxchg_#t~ret464#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-48: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2575-6: vatomic32_await_eq_set_acq_#t~ret232#1 := vatomic32_await_eq_set_#res#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-47: assume ((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-47: assume !(((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]); [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-50: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-49: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-51: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334-1: assume vatomic32_await_eq_set_#t~ret792#1 != vatomic32_await_eq_set_~c#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334-1: assume !(vatomic32_await_eq_set_#t~ret792#1 != vatomic32_await_eq_set_~c#1); [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3931-3: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335: assume { :end_inline_vatomic32_await_eq } true;havoc vatomic32_await_eq_set_#t~ret791#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-1: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-2: havoc vatomic32_await_eq_#t~ret679#1, vatomic32_await_eq_#t~ite680#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:26,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-3: vatomic32_await_eq_set_#t~ret791#1 := vatomic32_await_eq_#res#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite680#1 := 0; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:26,077 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-1: havoc vatomic32_await_eq_set_#t~ret792#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-2: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1;assume { :end_inline_vatomic32_cmpxchg } true; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336: havoc vatomic32_await_eq_set_#t~ret792#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-5: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-6: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:26,078 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-3: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-4: vatomic32_await_eq_set_#t~ret792#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-7: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_await_eq_set_~a#1.base, vatomic32_await_eq_set_~a#1.offset, vatomic32_await_eq_set_~c#1, vatomic32_await_eq_set_~v#1; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:46:26,079 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:46:26,080 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:26,080 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:26,128 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:26,129 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:26,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:26 BoogieIcfgContainer [2025-02-08 05:46:26,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:26,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:26,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:26,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:26,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:21" (1/3) ... [2025-02-08 05:46:26,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d1af4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:26, skipping insertion in model container [2025-02-08 05:46:26,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:25" (2/3) ... [2025-02-08 05:46:26,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d1af4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:26, skipping insertion in model container [2025-02-08 05:46:26,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:26" (3/3) ... [2025-02-08 05:46:26,136 INFO L128 eAbstractionObserver]: Analyzing ICFG caslock.i [2025-02-08 05:46:26,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:26,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG caslock.i that has 2 procedures, 285 locations, 1 initial locations, 41 loop locations, and 15 error locations. [2025-02-08 05:46:26,148 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:26,227 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:46:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 333 transitions, 673 flow [2025-02-08 05:46:26,362 INFO L124 PetriNetUnfolderBase]: 62/411 cut-off events. [2025-02-08 05:46:26,363 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:46:26,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 411 events. 62/411 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1385 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 294. Up to 6 conditions per place. [2025-02-08 05:46:26,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 333 transitions, 673 flow [2025-02-08 05:46:26,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 333 transitions, 673 flow [2025-02-08 05:46:26,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:26,389 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;@7f705366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:26,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:46:26,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:26,397 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:46:26,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:26,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:26,398 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] [2025-02-08 05:46:26,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2137614502, now seen corresponding path program 1 times [2025-02-08 05:46:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:26,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479586557] [2025-02-08 05:46:26,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:26,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:46:26,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:46:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479586557] [2025-02-08 05:46:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479586557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578987769] [2025-02-08 05:46:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:26,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:26,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:26,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:26,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 333 [2025-02-08 05:46:26,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 333 transitions, 673 flow. Second operand has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:26,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:26,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 333 [2025-02-08 05:46:26,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:26,624 INFO L124 PetriNetUnfolderBase]: 3/307 cut-off events. [2025-02-08 05:46:26,624 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:26,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 307 events. 3/307 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 808 event pairs, 0 based on Foata normal form. 103/388 useless extension candidates. Maximal degree in co-relation 217. Up to 6 conditions per place. [2025-02-08 05:46:26,626 INFO L140 encePairwiseOnDemand]: 282/333 looper letters, 5 selfloop transitions, 0 changer transitions 0/247 dead transitions. [2025-02-08 05:46:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 247 transitions, 511 flow [2025-02-08 05:46:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 610 transitions. [2025-02-08 05:46:26,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159159159159159 [2025-02-08 05:46:26,637 INFO L175 Difference]: Start difference. First operand has 288 places, 333 transitions, 673 flow. Second operand 2 states and 610 transitions. [2025-02-08 05:46:26,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 247 transitions, 511 flow [2025-02-08 05:46:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 247 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:26,644 INFO L231 Difference]: Finished difference. Result has 248 places, 247 transitions, 501 flow [2025-02-08 05:46:26,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=501, PETRI_PLACES=248, PETRI_TRANSITIONS=247} [2025-02-08 05:46:26,648 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -40 predicate places. [2025-02-08 05:46:26,648 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 247 transitions, 501 flow [2025-02-08 05:46:26,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:26,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:26,649 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] [2025-02-08 05:46:26,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:26,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1329565833, now seen corresponding path program 1 times [2025-02-08 05:46:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:26,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357093206] [2025-02-08 05:46:26,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:46:26,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:46:26,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:26,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357093206] [2025-02-08 05:46:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357093206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:27,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689296031] [2025-02-08 05:46:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:27,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:27,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:27,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:27,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 333 [2025-02-08 05:46:27,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 247 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:27,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:27,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 333 [2025-02-08 05:46:27,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:28,052 INFO L124 PetriNetUnfolderBase]: 118/1513 cut-off events. [2025-02-08 05:46:28,052 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1513 events. 118/1513 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 9711 event pairs, 27 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1725. Up to 180 conditions per place. [2025-02-08 05:46:28,061 INFO L140 encePairwiseOnDemand]: 323/333 looper letters, 23 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2025-02-08 05:46:28,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 264 transitions, 617 flow [2025-02-08 05:46:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-02-08 05:46:28,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7957957957957958 [2025-02-08 05:46:28,069 INFO L175 Difference]: Start difference. First operand has 248 places, 247 transitions, 501 flow. Second operand 6 states and 1590 transitions. [2025-02-08 05:46:28,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 264 transitions, 617 flow [2025-02-08 05:46:28,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:28,079 INFO L231 Difference]: Finished difference. Result has 258 places, 264 transitions, 625 flow [2025-02-08 05:46:28,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=258, PETRI_TRANSITIONS=264} [2025-02-08 05:46:28,080 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -30 predicate places. [2025-02-08 05:46:28,080 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 264 transitions, 625 flow [2025-02-08 05:46:28,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:28,081 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] [2025-02-08 05:46:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:28,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -750098173, now seen corresponding path program 1 times [2025-02-08 05:46:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84464450] [2025-02-08 05:46:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:28,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:28,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84464450] [2025-02-08 05:46:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84464450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:28,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:28,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901077217] [2025-02-08 05:46:28,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:28,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:28,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:28,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:28,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 333 [2025-02-08 05:46:28,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 264 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:28,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 333 [2025-02-08 05:46:28,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:28,302 INFO L124 PetriNetUnfolderBase]: 85/1377 cut-off events. [2025-02-08 05:46:28,303 INFO L125 PetriNetUnfolderBase]: For 225/503 co-relation queries the response was YES. [2025-02-08 05:46:28,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1377 events. 85/1377 cut-off events. For 225/503 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8365 event pairs, 0 based on Foata normal form. 25/1322 useless extension candidates. Maximal degree in co-relation 1667. Up to 83 conditions per place. [2025-02-08 05:46:28,309 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 23 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2025-02-08 05:46:28,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 265 transitions, 681 flow [2025-02-08 05:46:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2025-02-08 05:46:28,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8158158158158159 [2025-02-08 05:46:28,311 INFO L175 Difference]: Start difference. First operand has 258 places, 264 transitions, 625 flow. Second operand 3 states and 815 transitions. [2025-02-08 05:46:28,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 265 transitions, 681 flow [2025-02-08 05:46:28,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 265 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:28,317 INFO L231 Difference]: Finished difference. Result has 258 places, 262 transitions, 623 flow [2025-02-08 05:46:28,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=258, PETRI_TRANSITIONS=262} [2025-02-08 05:46:28,319 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -30 predicate places. [2025-02-08 05:46:28,319 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 262 transitions, 623 flow [2025-02-08 05:46:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:28,319 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] [2025-02-08 05:46:28,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:28,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:28,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 710187978, now seen corresponding path program 1 times [2025-02-08 05:46:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126641249] [2025-02-08 05:46:28,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:28,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:46:28,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:46:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126641249] [2025-02-08 05:46:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126641249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:28,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:28,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696855989] [2025-02-08 05:46:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:28,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:28,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:28,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:28,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:28,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 333 [2025-02-08 05:46:28,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 262 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:28,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 333 [2025-02-08 05:46:28,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:28,498 INFO L124 PetriNetUnfolderBase]: 74/1485 cut-off events. [2025-02-08 05:46:28,498 INFO L125 PetriNetUnfolderBase]: For 211/319 co-relation queries the response was YES. [2025-02-08 05:46:28,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1485 events. 74/1485 cut-off events. For 211/319 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9183 event pairs, 3 based on Foata normal form. 12/1430 useless extension candidates. Maximal degree in co-relation 1743. Up to 71 conditions per place. [2025-02-08 05:46:28,504 INFO L140 encePairwiseOnDemand]: 331/333 looper letters, 18 selfloop transitions, 1 changer transitions 3/264 dead transitions. [2025-02-08 05:46:28,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 264 transitions, 677 flow [2025-02-08 05:46:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-02-08 05:46:28,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8218218218218218 [2025-02-08 05:46:28,506 INFO L175 Difference]: Start difference. First operand has 258 places, 262 transitions, 623 flow. Second operand 3 states and 821 transitions. [2025-02-08 05:46:28,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 264 transitions, 677 flow [2025-02-08 05:46:28,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 264 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:28,510 INFO L231 Difference]: Finished difference. Result has 258 places, 261 transitions, 622 flow [2025-02-08 05:46:28,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=258, PETRI_TRANSITIONS=261} [2025-02-08 05:46:28,510 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -30 predicate places. [2025-02-08 05:46:28,510 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 261 transitions, 622 flow [2025-02-08 05:46:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:28,511 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] [2025-02-08 05:46:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:28,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -537553523, now seen corresponding path program 1 times [2025-02-08 05:46:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878011864] [2025-02-08 05:46:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:28,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:46:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:46:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878011864] [2025-02-08 05:46:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878011864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270445606] [2025-02-08 05:46:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:28,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:28,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:28,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:28,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2025-02-08 05:46:28,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 261 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:28,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2025-02-08 05:46:28,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:28,840 INFO L124 PetriNetUnfolderBase]: 85/1564 cut-off events. [2025-02-08 05:46:28,841 INFO L125 PetriNetUnfolderBase]: For 207/461 co-relation queries the response was YES. [2025-02-08 05:46:28,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 1564 events. 85/1564 cut-off events. For 207/461 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10249 event pairs, 9 based on Foata normal form. 10/1494 useless extension candidates. Maximal degree in co-relation 1863. Up to 90 conditions per place. [2025-02-08 05:46:28,855 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 27 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-08 05:46:28,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 267 transitions, 710 flow [2025-02-08 05:46:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-02-08 05:46:28,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8288288288288288 [2025-02-08 05:46:28,866 INFO L175 Difference]: Start difference. First operand has 258 places, 261 transitions, 622 flow. Second operand 3 states and 828 transitions. [2025-02-08 05:46:28,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 267 transitions, 710 flow [2025-02-08 05:46:28,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 267 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:28,871 INFO L231 Difference]: Finished difference. Result has 260 places, 261 transitions, 629 flow [2025-02-08 05:46:28,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=260, PETRI_TRANSITIONS=261} [2025-02-08 05:46:28,875 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, -28 predicate places. [2025-02-08 05:46:28,876 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 261 transitions, 629 flow [2025-02-08 05:46:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:28,877 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:28,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:28,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:46:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1529029416, now seen corresponding path program 1 times [2025-02-08 05:46:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544272881] [2025-02-08 05:46:28,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:28,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:46:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:46:28,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:28,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:28,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:46:28,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:46:28,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:29,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:29,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:29,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:46:29,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:46:29,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:46:29,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:46:29,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:46:29,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:46:29,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:29,016 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:46:29,018 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:29,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:29,117 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:29,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 474 places, 545 transitions, 1106 flow [2025-02-08 05:46:29,223 INFO L124 PetriNetUnfolderBase]: 113/764 cut-off events. [2025-02-08 05:46:29,223 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:29,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 764 events. 113/764 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3535 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 557. Up to 12 conditions per place. [2025-02-08 05:46:29,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 474 places, 545 transitions, 1106 flow [2025-02-08 05:46:29,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 474 places, 545 transitions, 1106 flow [2025-02-08 05:46:29,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:29,248 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;@7f705366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:29,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 05:46:29,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:29,255 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:46:29,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:29,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:29,255 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] [2025-02-08 05:46:29,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:29,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 204699, now seen corresponding path program 1 times [2025-02-08 05:46:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243783360] [2025-02-08 05:46:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:29,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:46:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:46:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:29,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243783360] [2025-02-08 05:46:29,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243783360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:29,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:29,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387725310] [2025-02-08 05:46:29,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:29,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:29,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 545 [2025-02-08 05:46:29,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 545 transitions, 1106 flow. Second operand has 2 states, 2 states have (on average 453.5) internal successors, (907), 2 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:29,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:29,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 545 [2025-02-08 05:46:29,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:29,526 INFO L124 PetriNetUnfolderBase]: 31/1474 cut-off events. [2025-02-08 05:46:29,526 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-08 05:46:29,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 1474 events. 31/1474 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9724 event pairs, 18 based on Foata normal form. 625/1970 useless extension candidates. Maximal degree in co-relation 535. Up to 49 conditions per place. [2025-02-08 05:46:29,538 INFO L140 encePairwiseOnDemand]: 463/545 looper letters, 10 selfloop transitions, 0 changer transitions 0/397 dead transitions. [2025-02-08 05:46:29,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 397 transitions, 830 flow [2025-02-08 05:46:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 998 transitions. [2025-02-08 05:46:29,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155963302752294 [2025-02-08 05:46:29,542 INFO L175 Difference]: Start difference. First operand has 474 places, 545 transitions, 1106 flow. Second operand 2 states and 998 transitions. [2025-02-08 05:46:29,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 397 transitions, 830 flow [2025-02-08 05:46:29,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:29,547 INFO L231 Difference]: Finished difference. Result has 397 places, 397 transitions, 810 flow [2025-02-08 05:46:29,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=397} [2025-02-08 05:46:29,549 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -77 predicate places. [2025-02-08 05:46:29,549 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 397 transitions, 810 flow [2025-02-08 05:46:29,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 453.5) internal successors, (907), 2 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:29,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:29,549 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] [2025-02-08 05:46:29,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:46:29,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:29,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash 877859529, now seen corresponding path program 1 times [2025-02-08 05:46:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214755197] [2025-02-08 05:46:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:46:29,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:46:29,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:29,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214755197] [2025-02-08 05:46:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214755197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:30,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201990413] [2025-02-08 05:46:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:30,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:30,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:30,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 545 [2025-02-08 05:46:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 397 transitions, 810 flow. Second operand has 6 states, 6 states have (on average 435.5) internal successors, (2613), 6 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:30,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 545 [2025-02-08 05:46:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:31,774 INFO L124 PetriNetUnfolderBase]: 1226/8818 cut-off events. [2025-02-08 05:46:31,775 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-02-08 05:46:31,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10521 conditions, 8818 events. 1226/8818 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 93272 event pairs, 360 based on Foata normal form. 0/7977 useless extension candidates. Maximal degree in co-relation 10516. Up to 1528 conditions per place. [2025-02-08 05:46:31,863 INFO L140 encePairwiseOnDemand]: 532/545 looper letters, 29 selfloop transitions, 30 changer transitions 0/427 dead transitions. [2025-02-08 05:46:31,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 427 transitions, 993 flow [2025-02-08 05:46:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2664 transitions. [2025-02-08 05:46:31,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8146788990825689 [2025-02-08 05:46:31,869 INFO L175 Difference]: Start difference. First operand has 397 places, 397 transitions, 810 flow. Second operand 6 states and 2664 transitions. [2025-02-08 05:46:31,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 427 transitions, 993 flow [2025-02-08 05:46:31,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 427 transitions, 993 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:31,878 INFO L231 Difference]: Finished difference. Result has 407 places, 426 transitions, 1012 flow [2025-02-08 05:46:31,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1012, PETRI_PLACES=407, PETRI_TRANSITIONS=426} [2025-02-08 05:46:31,879 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -67 predicate places. [2025-02-08 05:46:31,879 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 426 transitions, 1012 flow [2025-02-08 05:46:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 435.5) internal successors, (2613), 6 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:31,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:31,881 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] [2025-02-08 05:46:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:46:31,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1281199043, now seen corresponding path program 1 times [2025-02-08 05:46:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098709282] [2025-02-08 05:46:31,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:31,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:31,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098709282] [2025-02-08 05:46:31,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098709282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:31,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:31,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893851041] [2025-02-08 05:46:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:31,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:31,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:31,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 545 [2025-02-08 05:46:31,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 426 transitions, 1012 flow. Second operand has 3 states, 3 states have (on average 439.6666666666667) internal successors, (1319), 3 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:31,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:31,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 545 [2025-02-08 05:46:31,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:33,727 INFO L124 PetriNetUnfolderBase]: 912/10188 cut-off events. [2025-02-08 05:46:33,727 INFO L125 PetriNetUnfolderBase]: For 1581/2573 co-relation queries the response was YES. [2025-02-08 05:46:33,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12706 conditions, 10188 events. 912/10188 cut-off events. For 1581/2573 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 111836 event pairs, 179 based on Foata normal form. 24/9698 useless extension candidates. Maximal degree in co-relation 12696. Up to 864 conditions per place. [2025-02-08 05:46:33,848 INFO L140 encePairwiseOnDemand]: 542/545 looper letters, 43 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2025-02-08 05:46:33,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 430 transitions, 1120 flow [2025-02-08 05:46:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1339 transitions. [2025-02-08 05:46:33,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189602446483181 [2025-02-08 05:46:33,855 INFO L175 Difference]: Start difference. First operand has 407 places, 426 transitions, 1012 flow. Second operand 3 states and 1339 transitions. [2025-02-08 05:46:33,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 430 transitions, 1120 flow [2025-02-08 05:46:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 430 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:33,864 INFO L231 Difference]: Finished difference. Result has 407 places, 424 transitions, 1010 flow [2025-02-08 05:46:33,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1010, PETRI_PLACES=407, PETRI_TRANSITIONS=424} [2025-02-08 05:46:33,867 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -67 predicate places. [2025-02-08 05:46:33,867 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 424 transitions, 1010 flow [2025-02-08 05:46:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 439.6666666666667) internal successors, (1319), 3 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:33,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:33,868 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] [2025-02-08 05:46:33,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:46:33,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1423289686, now seen corresponding path program 1 times [2025-02-08 05:46:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870608720] [2025-02-08 05:46:33,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:33,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:46:33,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:46:33,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:33,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870608720] [2025-02-08 05:46:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870608720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736567309] [2025-02-08 05:46:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:33,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:33,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:33,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:33,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 545 [2025-02-08 05:46:33,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 424 transitions, 1010 flow. Second operand has 3 states, 3 states have (on average 442.6666666666667) internal successors, (1328), 3 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:33,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:33,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 545 [2025-02-08 05:46:33,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:34,993 INFO L124 PetriNetUnfolderBase]: 776/8094 cut-off events. [2025-02-08 05:46:34,994 INFO L125 PetriNetUnfolderBase]: For 1507/2586 co-relation queries the response was YES. [2025-02-08 05:46:35,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 8094 events. 776/8094 cut-off events. For 1507/2586 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 85111 event pairs, 80 based on Foata normal form. 120/7795 useless extension candidates. Maximal degree in co-relation 10325. Up to 744 conditions per place. [2025-02-08 05:46:35,068 INFO L140 encePairwiseOnDemand]: 543/545 looper letters, 41 selfloop transitions, 1 changer transitions 0/429 dead transitions. [2025-02-08 05:46:35,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 429 transitions, 1116 flow [2025-02-08 05:46:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2025-02-08 05:46:35,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226299694189603 [2025-02-08 05:46:35,071 INFO L175 Difference]: Start difference. First operand has 407 places, 424 transitions, 1010 flow. Second operand 3 states and 1345 transitions. [2025-02-08 05:46:35,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 429 transitions, 1116 flow [2025-02-08 05:46:35,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 429 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:35,077 INFO L231 Difference]: Finished difference. Result has 407 places, 423 transitions, 1009 flow [2025-02-08 05:46:35,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=407, PETRI_TRANSITIONS=423} [2025-02-08 05:46:35,078 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -67 predicate places. [2025-02-08 05:46:35,078 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 423 transitions, 1009 flow [2025-02-08 05:46:35,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.6666666666667) internal successors, (1328), 3 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:35,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:35,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:46:35,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2044116174, now seen corresponding path program 1 times [2025-02-08 05:46:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897448490] [2025-02-08 05:46:35,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:35,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:46:35,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:46:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897448490] [2025-02-08 05:46:35,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897448490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:35,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:35,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215130119] [2025-02-08 05:46:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:35,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:35,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:35,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:35,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 545 [2025-02-08 05:46:35,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 423 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:35,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:35,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 545 [2025-02-08 05:46:35,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:36,186 INFO L124 PetriNetUnfolderBase]: 876/8637 cut-off events. [2025-02-08 05:46:36,186 INFO L125 PetriNetUnfolderBase]: For 1479/3055 co-relation queries the response was YES. [2025-02-08 05:46:36,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11152 conditions, 8637 events. 876/8637 cut-off events. For 1479/3055 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 91694 event pairs, 71 based on Foata normal form. 22/8141 useless extension candidates. Maximal degree in co-relation 11141. Up to 942 conditions per place. [2025-02-08 05:46:36,289 INFO L140 encePairwiseOnDemand]: 542/545 looper letters, 45 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2025-02-08 05:46:36,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 430 transitions, 1135 flow [2025-02-08 05:46:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-08 05:46:36,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8330275229357799 [2025-02-08 05:46:36,292 INFO L175 Difference]: Start difference. First operand has 407 places, 423 transitions, 1009 flow. Second operand 3 states and 1362 transitions. [2025-02-08 05:46:36,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 430 transitions, 1135 flow [2025-02-08 05:46:36,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 430 transitions, 1134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:36,299 INFO L231 Difference]: Finished difference. Result has 409 places, 424 transitions, 1020 flow [2025-02-08 05:46:36,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=409, PETRI_TRANSITIONS=424} [2025-02-08 05:46:36,300 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -65 predicate places. [2025-02-08 05:46:36,300 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 424 transitions, 1020 flow [2025-02-08 05:46:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,301 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] [2025-02-08 05:46:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:46:36,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -990982923, now seen corresponding path program 1 times [2025-02-08 05:46:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253124645] [2025-02-08 05:46:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:36,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:46:36,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:46:36,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:36,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253124645] [2025-02-08 05:46:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253124645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780782731] [2025-02-08 05:46:36,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:36,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:46:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:46:36,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:46:36,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 545 [2025-02-08 05:46:36,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 424 transitions, 1020 flow. Second operand has 5 states, 5 states have (on average 446.6) internal successors, (2233), 5 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:36,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 545 [2025-02-08 05:46:36,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:38,195 INFO L124 PetriNetUnfolderBase]: 970/8939 cut-off events. [2025-02-08 05:46:38,196 INFO L125 PetriNetUnfolderBase]: For 1585/3458 co-relation queries the response was YES. [2025-02-08 05:46:38,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11720 conditions, 8939 events. 970/8939 cut-off events. For 1585/3458 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 96256 event pairs, 49 based on Foata normal form. 121/8556 useless extension candidates. Maximal degree in co-relation 11708. Up to 942 conditions per place. [2025-02-08 05:46:38,331 INFO L140 encePairwiseOnDemand]: 540/545 looper letters, 73 selfloop transitions, 5 changer transitions 0/459 dead transitions. [2025-02-08 05:46:38,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 459 transitions, 1348 flow [2025-02-08 05:46:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2707 transitions. [2025-02-08 05:46:38,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.82782874617737 [2025-02-08 05:46:38,342 INFO L175 Difference]: Start difference. First operand has 409 places, 424 transitions, 1020 flow. Second operand 6 states and 2707 transitions. [2025-02-08 05:46:38,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 459 transitions, 1348 flow [2025-02-08 05:46:38,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 459 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:38,369 INFO L231 Difference]: Finished difference. Result has 416 places, 426 transitions, 1044 flow [2025-02-08 05:46:38,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=545, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1044, PETRI_PLACES=416, PETRI_TRANSITIONS=426} [2025-02-08 05:46:38,371 INFO L279 CegarLoopForPetriNet]: 474 programPoint places, -58 predicate places. [2025-02-08 05:46:38,371 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 426 transitions, 1044 flow [2025-02-08 05:46:38,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 446.6) internal successors, (2233), 5 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:38,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:38,376 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:46:38,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:46:38,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -582698352, now seen corresponding path program 1 times [2025-02-08 05:46:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221968703] [2025-02-08 05:46:38,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:38,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:46:38,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:46:38,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:38,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:38,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:38,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:46:38,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:46:38,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:38,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:38,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:38,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-02-08 05:46:38,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-02-08 05:46:38,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-02-08 05:46:38,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-02-08 05:46:38,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-02-08 05:46:38,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-02-08 05:46:38,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-02-08 05:46:38,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:46:38,491 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:38,491 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:38,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:46:38,594 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:46:38,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 660 places, 757 transitions, 1541 flow [2025-02-08 05:46:38,848 INFO L124 PetriNetUnfolderBase]: 183/1224 cut-off events. [2025-02-08 05:46:38,848 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:46:38,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 1224 events. 183/1224 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6417 event pairs, 1 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 875. Up to 24 conditions per place. [2025-02-08 05:46:38,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 660 places, 757 transitions, 1541 flow [2025-02-08 05:46:38,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 660 places, 757 transitions, 1541 flow [2025-02-08 05:46:38,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:38,894 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;@7f705366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:38,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-08 05:46:38,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:38,896 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:46:38,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:38,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:38,896 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] [2025-02-08 05:46:38,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:46:38,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -40801488, now seen corresponding path program 1 times [2025-02-08 05:46:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:38,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947233586] [2025-02-08 05:46:38,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:38,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:46:38,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:46:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:38,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947233586] [2025-02-08 05:46:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947233586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:38,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502159896] [2025-02-08 05:46:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:38,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:38,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:38,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 757 [2025-02-08 05:46:38,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 757 transitions, 1541 flow. Second operand has 2 states, 2 states have (on average 629.5) internal successors, (1259), 2 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:38,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:38,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 757 [2025-02-08 05:46:38,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:39,952 INFO L124 PetriNetUnfolderBase]: 254/7053 cut-off events. [2025-02-08 05:46:39,952 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-02-08 05:46:40,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7565 conditions, 7053 events. 254/7053 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 76702 event pairs, 193 based on Foata normal form. 3724/10065 useless extension candidates. Maximal degree in co-relation 1566. Up to 352 conditions per place. [2025-02-08 05:46:40,042 INFO L140 encePairwiseOnDemand]: 644/757 looper letters, 15 selfloop transitions, 0 changer transitions 0/547 dead transitions. [2025-02-08 05:46:40,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 547 transitions, 1151 flow [2025-02-08 05:46:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1386 transitions. [2025-02-08 05:46:40,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154557463672391 [2025-02-08 05:46:40,045 INFO L175 Difference]: Start difference. First operand has 660 places, 757 transitions, 1541 flow. Second operand 2 states and 1386 transitions. [2025-02-08 05:46:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 547 transitions, 1151 flow [2025-02-08 05:46:40,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 547 transitions, 1151 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:40,050 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1121 flow [2025-02-08 05:46:40,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=757, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1121, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-02-08 05:46:40,051 INFO L279 CegarLoopForPetriNet]: 660 programPoint places, -114 predicate places. [2025-02-08 05:46:40,051 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1121 flow [2025-02-08 05:46:40,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 629.5) internal successors, (1259), 2 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:40,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:40,052 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] [2025-02-08 05:46:40,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:46:40,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:46:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1538469367, now seen corresponding path program 1 times [2025-02-08 05:46:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780643302] [2025-02-08 05:46:40,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:40,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:46:40,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:46:40,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:40,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:40,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:40,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780643302] [2025-02-08 05:46:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780643302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:40,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014951127] [2025-02-08 05:46:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:40,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:40,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:40,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 757 [2025-02-08 05:46:40,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1121 flow. Second operand has 6 states, 6 states have (on average 611.5) internal successors, (3669), 6 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:40,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:40,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 757 [2025-02-08 05:46:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:50,588 INFO L124 PetriNetUnfolderBase]: 8513/42494 cut-off events. [2025-02-08 05:46:50,588 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2025-02-08 05:46:51,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53250 conditions, 42494 events. 8513/42494 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 911. Compared 562341 event pairs, 2632 based on Foata normal form. 0/38507 useless extension candidates. Maximal degree in co-relation 53244. Up to 9927 conditions per place. [2025-02-08 05:46:51,472 INFO L140 encePairwiseOnDemand]: 741/757 looper letters, 35 selfloop transitions, 42 changer transitions 0/590 dead transitions. [2025-02-08 05:46:51,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 590 transitions, 1373 flow [2025-02-08 05:46:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3738 transitions. [2025-02-08 05:46:51,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8229854689564069 [2025-02-08 05:46:51,477 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1121 flow. Second operand 6 states and 3738 transitions. [2025-02-08 05:46:51,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 590 transitions, 1373 flow [2025-02-08 05:46:51,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 590 transitions, 1373 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:51,485 INFO L231 Difference]: Finished difference. Result has 556 places, 588 transitions, 1401 flow [2025-02-08 05:46:51,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=757, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1401, PETRI_PLACES=556, PETRI_TRANSITIONS=588} [2025-02-08 05:46:51,486 INFO L279 CegarLoopForPetriNet]: 660 programPoint places, -104 predicate places. [2025-02-08 05:46:51,486 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 588 transitions, 1401 flow [2025-02-08 05:46:51,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 611.5) internal successors, (3669), 6 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:51,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:51,488 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] [2025-02-08 05:46:51,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:46:51,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:46:51,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1547790973, now seen corresponding path program 1 times [2025-02-08 05:46:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654569940] [2025-02-08 05:46:51,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:46:51,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:46:51,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:51,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654569940] [2025-02-08 05:46:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654569940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599155452] [2025-02-08 05:46:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:51,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:51,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 611 out of 757 [2025-02-08 05:46:51,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 588 transitions, 1401 flow. Second operand has 3 states, 3 states have (on average 611.6666666666666) internal successors, (1835), 3 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:51,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:51,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 611 of 757 [2025-02-08 05:46:51,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:58,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][133], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 513#L3928-7true, 659#true, 656#true, 589#L6005true, 660#true, 663#true, 676#true, 665#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:46:58,051 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2025-02-08 05:46:58,052 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:46:58,052 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-02-08 05:46:58,052 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:46:58,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][133], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 268#L3779-1true, 659#true, 656#true, 589#L6005true, 660#true, 665#true, 663#true, 676#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:46:58,899 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-02-08 05:46:58,899 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:46:58,899 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:46:58,899 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-02-08 05:46:59,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][133], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 659#true, 412#L3825-1true, 656#true, 660#true, 589#L6005true, 663#true, 665#true, 676#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:46:59,171 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2025-02-08 05:46:59,171 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:46:59,171 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:46:59,171 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-02-08 05:47:03,391 INFO L124 PetriNetUnfolderBase]: 6289/47920 cut-off events. [2025-02-08 05:47:03,392 INFO L125 PetriNetUnfolderBase]: For 9023/13861 co-relation queries the response was YES. [2025-02-08 05:47:04,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64182 conditions, 47920 events. 6289/47920 cut-off events. For 9023/13861 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 678242 event pairs, 1524 based on Foata normal form. 36/45734 useless extension candidates. Maximal degree in co-relation 64171. Up to 6052 conditions per place. [2025-02-08 05:47:04,554 INFO L140 encePairwiseOnDemand]: 754/757 looper letters, 63 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2025-02-08 05:47:04,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 595 transitions, 1561 flow [2025-02-08 05:47:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1863 transitions. [2025-02-08 05:47:04,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203434610303831 [2025-02-08 05:47:04,558 INFO L175 Difference]: Start difference. First operand has 556 places, 588 transitions, 1401 flow. Second operand 3 states and 1863 transitions. [2025-02-08 05:47:04,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 595 transitions, 1561 flow [2025-02-08 05:47:04,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 595 transitions, 1561 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:04,574 INFO L231 Difference]: Finished difference. Result has 556 places, 586 transitions, 1399 flow [2025-02-08 05:47:04,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=757, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1399, PETRI_PLACES=556, PETRI_TRANSITIONS=586} [2025-02-08 05:47:04,575 INFO L279 CegarLoopForPetriNet]: 660 programPoint places, -104 predicate places. [2025-02-08 05:47:04,575 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 586 transitions, 1399 flow [2025-02-08 05:47:04,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.6666666666666) internal successors, (1835), 3 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:04,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:04,576 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] [2025-02-08 05:47:04,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:47:04,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:47:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1368372470, now seen corresponding path program 1 times [2025-02-08 05:47:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834874243] [2025-02-08 05:47:04,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:04,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:47:04,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:47:04,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:04,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:04,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834874243] [2025-02-08 05:47:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834874243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:04,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:04,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116592137] [2025-02-08 05:47:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:04,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:04,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:04,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:04,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:04,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 757 [2025-02-08 05:47:04,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 586 transitions, 1399 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:04,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:04,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 757 [2025-02-08 05:47:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][132], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 660#true, 676#true, 665#true, 679#true, 513#L3928-7true, 659#true, 656#true, 589#L6005true, 663#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:47:09,944 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2025-02-08 05:47:09,944 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:47:09,944 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-02-08 05:47:09,944 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2025-02-08 05:47:10,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][132], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 660#true, 676#true, 665#true, 679#true, 268#L3779-1true, 659#true, 656#true, 589#L6005true, 663#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:47:10,440 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-02-08 05:47:10,441 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:10,441 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:47:10,441 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2025-02-08 05:47:10,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2852] runEXIT-->L6005: Formula: (= |v_ULTIMATE.start_main_#t~mem818#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem818#1=|v_ULTIMATE.start_main_#t~mem818#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][132], [Black: 670#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))), Black: 668#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), Black: 669#(and (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet815#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)) 1)))) (and (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869183) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))))), 660#true, 676#true, 665#true, 679#true, 659#true, 656#true, 412#L3825-1true, 589#L6005true, 663#true, Black: 667#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (- 17179869184) (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet815#1|)))]) [2025-02-08 05:47:10,628 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2025-02-08 05:47:10,628 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:47:10,628 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:47:10,628 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event