./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/ticketlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/ticketlock.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 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:38:48,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:38:48,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:38:48,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:38:48,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:38:48,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:38:48,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:38:48,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:38:48,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:38:48,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:38:48,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:38:48,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:38:48,434 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:38:48,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:38:48,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:48,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:38:48,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:38:48,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:38:48,436 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 -> 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb [2025-02-06 09:38:48,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:38:48,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:38:48,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:38:48,664 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:38:48,664 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:38:48,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ticketlock.i [2025-02-06 09:38:49,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c382382/32a99afc2e0b419ea62bbc489bcd25f3/FLAG294bf4425 [2025-02-06 09:38:50,274 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:38:50,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/ticketlock.i [2025-02-06 09:38:50,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c382382/32a99afc2e0b419ea62bbc489bcd25f3/FLAG294bf4425 [2025-02-06 09:38:50,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c382382/32a99afc2e0b419ea62bbc489bcd25f3 [2025-02-06 09:38:50,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:38:50,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:38:50,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:50,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:38:50,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:38:50,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:50" (1/1) ... [2025-02-06 09:38:50,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:50, skipping insertion in model container [2025-02-06 09:38:50,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:50" (1/1) ... [2025-02-06 09:38:50,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:38:51,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:51,922 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:38:51,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-06 09:38:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-06 09:38:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-06 09:38:51,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-06 09:38:51,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-06 09:38:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-06 09:38:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-06 09:38:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-06 09:38:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-06 09:38:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-06 09:38:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-06 09:38:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-06 09:38:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-06 09:38:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-06 09:38:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-06 09:38:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-06 09:38:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-06 09:38:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-06 09:38:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-06 09:38:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-06 09:38:51,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-06 09:38:51,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-06 09:38:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-06 09:38:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-06 09:38:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-06 09:38:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-06 09:38:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-06 09:38:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-06 09:38:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-06 09:38:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-06 09:38:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-06 09:38:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-06 09:38:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-06 09:38:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-06 09:38:51,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-06 09:38:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-06 09:38:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-06 09:38:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-06 09:38:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-06 09:38:52,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-06 09:38:52,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-06 09:38:52,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-06 09:38:52,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-06 09:38:52,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-06 09:38:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-06 09:38:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-06 09:38:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-06 09:38:52,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-06 09:38:52,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-06 09:38:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-06 09:38:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-06 09:38:52,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-06 09:38:52,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-06 09:38:52,012 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-06 09:38:52,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-06 09:38:52,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-06 09:38:52,014 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-06 09:38:52,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-06 09:38:52,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-06 09:38:52,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-06 09:38:52,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-06 09:38:52,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-06 09:38:52,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-06 09:38:52,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-06 09:38:52,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-06 09:38:52,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-06 09:38:52,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-06 09:38:52,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-06 09:38:52,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-06 09:38:52,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-06 09:38:52,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-06 09:38:52,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-06 09:38:52,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-06 09:38:52,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-06 09:38:52,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-06 09:38:52,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-06 09:38:52,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-06 09:38:52,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-06 09:38:52,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-06 09:38:52,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-06 09:38:52,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-06 09:38:52,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-06 09:38:52,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-06 09:38:52,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-06 09:38:52,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-06 09:38:52,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-06 09:38:52,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-06 09:38:52,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-06 09:38:52,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-06 09:38:52,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-06 09:38:52,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-06 09:38:52,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-06 09:38:52,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-06 09:38:52,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-06 09:38:52,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-06 09:38:52,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:52,352 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:38:52,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52 WrapperNode [2025-02-06 09:38:52,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:52,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:52,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:38:52,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:38:52,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,469 INFO L138 Inliner]: procedures = 918, calls = 924, calls flagged for inlining = 825, calls inlined = 41, statements flattened = 436 [2025-02-06 09:38:52,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:52,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:38:52,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:38:52,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:38:52,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:38:52,523 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:38:52,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:38:52,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:38:52,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (1/1) ... [2025-02-06 09:38:52,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:52,567 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-06 09:38:52,573 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-06 09:38:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:38:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:38:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:38:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:38:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 09:38:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 09:38:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:38:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:38:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:38:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:38:52,609 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:38:52,727 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:38:52,729 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:38:52,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 09:38:52,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 09:38:53,224 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 09:38:53,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-06 09:38:53,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-06 09:38:53,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-06 09:38:53,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret620#1; [2025-02-06 09:38:53,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-02-06 09:38:53,226 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:38:53,226 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:38:53,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:38:53,322 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:38:53,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:53 BoogieIcfgContainer [2025-02-06 09:38:53,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:38:53,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:38:53,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:38:53,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:38:53,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:38:50" (1/3) ... [2025-02-06 09:38:53,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c37e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:53, skipping insertion in model container [2025-02-06 09:38:53,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:52" (2/3) ... [2025-02-06 09:38:53,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c37e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:53, skipping insertion in model container [2025-02-06 09:38:53,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:53" (3/3) ... [2025-02-06 09:38:53,329 INFO L128 eAbstractionObserver]: Analyzing ICFG ticketlock.i [2025-02-06 09:38:53,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:38:53,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ticketlock.i that has 2 procedures, 453 locations, 1 initial locations, 40 loop locations, and 17 error locations. [2025-02-06 09:38:53,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:38:53,484 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:38:53,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 534 transitions, 1075 flow [2025-02-06 09:38:53,689 INFO L124 PetriNetUnfolderBase]: 95/613 cut-off events. [2025-02-06 09:38:53,691 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:38:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 613 events. 95/613 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1888 event pairs, 0 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 493. Up to 6 conditions per place. [2025-02-06 09:38:53,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 534 transitions, 1075 flow [2025-02-06 09:38:53,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 456 places, 534 transitions, 1075 flow [2025-02-06 09:38:53,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:53,739 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;@4cb4425d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:53,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 09:38:53,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:53,748 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-02-06 09:38:53,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:53,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:53,750 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] [2025-02-06 09:38:53,752 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-06 09:38:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1046126615, now seen corresponding path program 1 times [2025-02-06 09:38:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720284325] [2025-02-06 09:38:53,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:53,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:38:53,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:38:53,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:53,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:53,904 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-06 09:38:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720284325] [2025-02-06 09:38:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720284325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:53,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971489738] [2025-02-06 09:38:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:53,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:53,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:53,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 534 [2025-02-06 09:38:53,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 534 transitions, 1075 flow. Second operand has 2 states, 2 states have (on average 446.5) internal successors, (893), 2 states have internal predecessors, (893), 0 states have call successors, (0), 0 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-06 09:38:53,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:53,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 534 [2025-02-06 09:38:53,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:54,064 INFO L124 PetriNetUnfolderBase]: 9/511 cut-off events. [2025-02-06 09:38:54,065 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:54,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 511 events. 9/511 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1398 event pairs, 0 based on Foata normal form. 170/651 useless extension candidates. Maximal degree in co-relation 421. Up to 9 conditions per place. [2025-02-06 09:38:54,070 INFO L140 encePairwiseOnDemand]: 454/534 looper letters, 8 selfloop transitions, 0 changer transitions 0/450 dead transitions. [2025-02-06 09:38:54,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 450 transitions, 923 flow [2025-02-06 09:38:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 980 transitions. [2025-02-06 09:38:54,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176029962546817 [2025-02-06 09:38:54,088 INFO L175 Difference]: Start difference. First operand has 456 places, 534 transitions, 1075 flow. Second operand 2 states and 980 transitions. [2025-02-06 09:38:54,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 450 transitions, 923 flow [2025-02-06 09:38:54,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 450 transitions, 923 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:54,103 INFO L231 Difference]: Finished difference. Result has 445 places, 450 transitions, 907 flow [2025-02-06 09:38:54,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=907, PETRI_PLACES=445, PETRI_TRANSITIONS=450} [2025-02-06 09:38:54,110 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -11 predicate places. [2025-02-06 09:38:54,110 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 450 transitions, 907 flow [2025-02-06 09:38:54,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 446.5) internal successors, (893), 2 states have internal predecessors, (893), 0 states have call successors, (0), 0 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-06 09:38:54,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:54,111 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] [2025-02-06 09:38:54,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:38:54,112 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-06 09:38:54,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1193980277, now seen corresponding path program 1 times [2025-02-06 09:38:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691931270] [2025-02-06 09:38:54,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:54,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 09:38:54,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 09:38:54,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:54,964 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-06 09:38:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691931270] [2025-02-06 09:38:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691931270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:54,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:54,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707791827] [2025-02-06 09:38:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:54,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:54,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:55,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 534 [2025-02-06 09:38:55,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 450 transitions, 907 flow. Second operand has 6 states, 6 states have (on average 428.5) internal successors, (2571), 6 states have internal predecessors, (2571), 0 states have call successors, (0), 0 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-06 09:38:55,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:55,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 534 [2025-02-06 09:38:55,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:55,583 INFO L124 PetriNetUnfolderBase]: 220/3159 cut-off events. [2025-02-06 09:38:55,584 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:38:55,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 3159 events. 220/3159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 27793 event pairs, 54 based on Foata normal form. 0/2910 useless extension candidates. Maximal degree in co-relation 3497. Up to 288 conditions per place. [2025-02-06 09:38:55,594 INFO L140 encePairwiseOnDemand]: 521/534 looper letters, 26 selfloop transitions, 30 changer transitions 0/479 dead transitions. [2025-02-06 09:38:55,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 479 transitions, 1077 flow [2025-02-06 09:38:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2619 transitions. [2025-02-06 09:38:55,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8174157303370787 [2025-02-06 09:38:55,600 INFO L175 Difference]: Start difference. First operand has 445 places, 450 transitions, 907 flow. Second operand 6 states and 2619 transitions. [2025-02-06 09:38:55,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 479 transitions, 1077 flow [2025-02-06 09:38:55,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 479 transitions, 1077 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:55,607 INFO L231 Difference]: Finished difference. Result has 455 places, 479 transitions, 1109 flow [2025-02-06 09:38:55,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1109, PETRI_PLACES=455, PETRI_TRANSITIONS=479} [2025-02-06 09:38:55,608 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, -1 predicate places. [2025-02-06 09:38:55,608 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 479 transitions, 1109 flow [2025-02-06 09:38:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 428.5) internal successors, (2571), 6 states have internal predecessors, (2571), 0 states have call successors, (0), 0 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-06 09:38:55,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:55,610 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-06 09:38:55,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:38:55,610 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-06 09:38:55,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2143489244, now seen corresponding path program 1 times [2025-02-06 09:38:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986224022] [2025-02-06 09:38:55,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:38:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:38:55,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:55,652 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-06 09:38:55,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986224022] [2025-02-06 09:38:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986224022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:55,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444448367] [2025-02-06 09:38:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:55,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:55,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:55,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 534 [2025-02-06 09:38:55,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 479 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 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-06 09:38:55,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:55,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 534 [2025-02-06 09:38:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:56,119 INFO L124 PetriNetUnfolderBase]: 238/4634 cut-off events. [2025-02-06 09:38:56,120 INFO L125 PetriNetUnfolderBase]: For 324/443 co-relation queries the response was YES. [2025-02-06 09:38:56,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5252 conditions, 4634 events. 238/4634 cut-off events. For 324/443 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 37913 event pairs, 36 based on Foata normal form. 12/4406 useless extension candidates. Maximal degree in co-relation 5243. Up to 167 conditions per place. [2025-02-06 09:38:56,140 INFO L140 encePairwiseOnDemand]: 525/534 looper letters, 46 selfloop transitions, 6 changer transitions 0/489 dead transitions. [2025-02-06 09:38:56,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 489 transitions, 1245 flow [2025-02-06 09:38:56,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1339 transitions. [2025-02-06 09:38:56,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8358302122347067 [2025-02-06 09:38:56,144 INFO L175 Difference]: Start difference. First operand has 455 places, 479 transitions, 1109 flow. Second operand 3 states and 1339 transitions. [2025-02-06 09:38:56,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 489 transitions, 1245 flow [2025-02-06 09:38:56,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 489 transitions, 1245 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:56,152 INFO L231 Difference]: Finished difference. Result has 458 places, 483 transitions, 1155 flow [2025-02-06 09:38:56,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=458, PETRI_TRANSITIONS=483} [2025-02-06 09:38:56,154 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 2 predicate places. [2025-02-06 09:38:56,154 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 483 transitions, 1155 flow [2025-02-06 09:38:56,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 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-06 09:38:56,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:56,155 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] [2025-02-06 09:38:56,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:38:56,156 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-06 09:38:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:56,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1691162609, now seen corresponding path program 1 times [2025-02-06 09:38:56,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303158490] [2025-02-06 09:38:56,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:38:56,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:38:56,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:56,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:56,188 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-06 09:38:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:56,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303158490] [2025-02-06 09:38:56,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303158490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542229558] [2025-02-06 09:38:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:56,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:56,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:56,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 534 [2025-02-06 09:38:56,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 483 transitions, 1155 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-06 09:38:56,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:56,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 534 [2025-02-06 09:38:56,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:56,752 INFO L124 PetriNetUnfolderBase]: 273/5743 cut-off events. [2025-02-06 09:38:56,752 INFO L125 PetriNetUnfolderBase]: For 384/517 co-relation queries the response was YES. [2025-02-06 09:38:56,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6541 conditions, 5743 events. 273/5743 cut-off events. For 384/517 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 49191 event pairs, 26 based on Foata normal form. 32/5515 useless extension candidates. Maximal degree in co-relation 6530. Up to 187 conditions per place. [2025-02-06 09:38:56,775 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 43 selfloop transitions, 4 changer transitions 0/491 dead transitions. [2025-02-06 09:38:56,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 491 transitions, 1277 flow [2025-02-06 09:38:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1342 transitions. [2025-02-06 09:38:56,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8377028714107366 [2025-02-06 09:38:56,778 INFO L175 Difference]: Start difference. First operand has 458 places, 483 transitions, 1155 flow. Second operand 3 states and 1342 transitions. [2025-02-06 09:38:56,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 491 transitions, 1277 flow [2025-02-06 09:38:56,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 491 transitions, 1265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:56,785 INFO L231 Difference]: Finished difference. Result has 459 places, 485 transitions, 1171 flow [2025-02-06 09:38:56,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=459, PETRI_TRANSITIONS=485} [2025-02-06 09:38:56,786 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 3 predicate places. [2025-02-06 09:38:56,786 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 485 transitions, 1171 flow [2025-02-06 09:38:56,787 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-06 09:38:56,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:56,787 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] [2025-02-06 09:38:56,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:38:56,787 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-06 09:38:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1484354393, now seen corresponding path program 1 times [2025-02-06 09:38:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386642230] [2025-02-06 09:38:56,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:56,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:38:56,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:38:56,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:56,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:56,835 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-06 09:38:56,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:56,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386642230] [2025-02-06 09:38:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386642230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:56,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:38:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187095726] [2025-02-06 09:38:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:56,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:56,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:56,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 534 [2025-02-06 09:38:56,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 485 transitions, 1171 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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-06 09:38:56,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:56,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 534 [2025-02-06 09:38:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:57,371 INFO L124 PetriNetUnfolderBase]: 272/6176 cut-off events. [2025-02-06 09:38:57,371 INFO L125 PetriNetUnfolderBase]: For 378/581 co-relation queries the response was YES. [2025-02-06 09:38:57,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7000 conditions, 6176 events. 272/6176 cut-off events. For 378/581 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 54635 event pairs, 42 based on Foata normal form. 10/5912 useless extension candidates. Maximal degree in co-relation 6988. Up to 231 conditions per place. [2025-02-06 09:38:57,472 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 45 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2025-02-06 09:38:57,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 494 transitions, 1307 flow [2025-02-06 09:38:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1341 transitions. [2025-02-06 09:38:57,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8370786516853933 [2025-02-06 09:38:57,474 INFO L175 Difference]: Start difference. First operand has 459 places, 485 transitions, 1171 flow. Second operand 3 states and 1341 transitions. [2025-02-06 09:38:57,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 494 transitions, 1307 flow [2025-02-06 09:38:57,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 494 transitions, 1299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:57,489 INFO L231 Difference]: Finished difference. Result has 460 places, 485 transitions, 1171 flow [2025-02-06 09:38:57,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=460, PETRI_TRANSITIONS=485} [2025-02-06 09:38:57,491 INFO L279 CegarLoopForPetriNet]: 456 programPoint places, 4 predicate places. [2025-02-06 09:38:57,491 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 485 transitions, 1171 flow [2025-02-06 09:38:57,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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-06 09:38:57,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:57,492 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, 1, 1] [2025-02-06 09:38:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:38:57,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-06 09:38:57,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 285872249, now seen corresponding path program 1 times [2025-02-06 09:38:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798087747] [2025-02-06 09:38:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:57,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:38:57,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:38:57,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:57,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:57,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:38:57,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:38:57,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:38:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:57,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:38:57,556 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:38:57,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-02-06 09:38:57,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-02-06 09:38:57,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-02-06 09:38:57,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-02-06 09:38:57,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-02-06 09:38:57,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-02-06 09:38:57,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-02-06 09:38:57,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-02-06 09:38:57,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-02-06 09:38:57,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:38:57,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:38:57,564 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:38:57,564 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:38:57,667 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:38:57,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 807 places, 944 transitions, 1904 flow [2025-02-06 09:38:57,852 INFO L124 PetriNetUnfolderBase]: 179/1166 cut-off events. [2025-02-06 09:38:57,853 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:38:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 1166 events. 179/1166 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5331 event pairs, 0 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 955. Up to 12 conditions per place. [2025-02-06 09:38:57,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 807 places, 944 transitions, 1904 flow [2025-02-06 09:38:57,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 807 places, 944 transitions, 1904 flow [2025-02-06 09:38:57,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:57,902 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;@4cb4425d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:57,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 09:38:57,904 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:57,904 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-02-06 09:38:57,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:57,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:57,904 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] [2025-02-06 09:38:57,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 09:38:57,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1532183495, now seen corresponding path program 1 times [2025-02-06 09:38:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119779931] [2025-02-06 09:38:57,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:57,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:38:57,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:38:57,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:57,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:57,939 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-06 09:38:57,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119779931] [2025-02-06 09:38:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119779931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:57,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111428029] [2025-02-06 09:38:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:57,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:57,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:57,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:57,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 788 out of 944 [2025-02-06 09:38:57,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 944 transitions, 1904 flow. Second operand has 2 states, 2 states have (on average 788.5) internal successors, (1577), 2 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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-06 09:38:57,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:57,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 788 of 944 [2025-02-06 09:38:57,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:58,674 INFO L124 PetriNetUnfolderBase]: 121/4022 cut-off events. [2025-02-06 09:38:58,675 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 09:38:58,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 4022 events. 121/4022 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 34735 event pairs, 54 based on Foata normal form. 1749/5494 useless extension candidates. Maximal degree in co-relation 883. Up to 127 conditions per place. [2025-02-06 09:38:58,722 INFO L140 encePairwiseOnDemand]: 804/944 looper letters, 16 selfloop transitions, 0 changer transitions 0/800 dead transitions. [2025-02-06 09:38:58,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 800 transitions, 1648 flow [2025-02-06 09:38:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1732 transitions. [2025-02-06 09:38:58,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173728813559322 [2025-02-06 09:38:58,726 INFO L175 Difference]: Start difference. First operand has 807 places, 944 transitions, 1904 flow. Second operand 2 states and 1732 transitions. [2025-02-06 09:38:58,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 800 transitions, 1648 flow [2025-02-06 09:38:58,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 800 transitions, 1648 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:58,737 INFO L231 Difference]: Finished difference. Result has 788 places, 800 transitions, 1616 flow [2025-02-06 09:38:58,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=944, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=787, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1616, PETRI_PLACES=788, PETRI_TRANSITIONS=800} [2025-02-06 09:38:58,740 INFO L279 CegarLoopForPetriNet]: 807 programPoint places, -19 predicate places. [2025-02-06 09:38:58,741 INFO L471 AbstractCegarLoop]: Abstraction has has 788 places, 800 transitions, 1616 flow [2025-02-06 09:38:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 788.5) internal successors, (1577), 2 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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-06 09:38:58,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:58,742 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] [2025-02-06 09:38:58,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:38:58,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 09:38:58,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2127663243, now seen corresponding path program 1 times [2025-02-06 09:38:58,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:58,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470780504] [2025-02-06 09:38:58,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:58,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 09:38:58,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 09:38:58,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:58,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:59,213 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-06 09:38:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470780504] [2025-02-06 09:38:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470780504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:38:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068752021] [2025-02-06 09:38:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:38:59,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 769 out of 944 [2025-02-06 09:38:59,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 800 transitions, 1616 flow. Second operand has 6 states, 6 states have (on average 770.5) internal successors, (4623), 6 states have internal predecessors, (4623), 0 states have call successors, (0), 0 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-06 09:38:59,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:59,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 769 of 944 [2025-02-06 09:38:59,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:04,195 INFO L124 PetriNetUnfolderBase]: 3451/30302 cut-off events. [2025-02-06 09:39:04,195 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-02-06 09:39:04,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34639 conditions, 30302 events. 3451/30302 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 418032 event pairs, 1200 based on Foata normal form. 0/27956 useless extension candidates. Maximal degree in co-relation 34634. Up to 3913 conditions per place. [2025-02-06 09:39:04,483 INFO L140 encePairwiseOnDemand]: 925/944 looper letters, 35 selfloop transitions, 54 changer transitions 0/854 dead transitions. [2025-02-06 09:39:04,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 854 transitions, 1907 flow [2025-02-06 09:39:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:39:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:39:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4704 transitions. [2025-02-06 09:39:04,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-02-06 09:39:04,491 INFO L175 Difference]: Start difference. First operand has 788 places, 800 transitions, 1616 flow. Second operand 6 states and 4704 transitions. [2025-02-06 09:39:04,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 793 places, 854 transitions, 1907 flow [2025-02-06 09:39:04,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 854 transitions, 1907 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:39:04,501 INFO L231 Difference]: Finished difference. Result has 798 places, 853 transitions, 1974 flow [2025-02-06 09:39:04,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=944, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=788, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1974, PETRI_PLACES=798, PETRI_TRANSITIONS=853} [2025-02-06 09:39:04,503 INFO L279 CegarLoopForPetriNet]: 807 programPoint places, -9 predicate places. [2025-02-06 09:39:04,503 INFO L471 AbstractCegarLoop]: Abstraction has has 798 places, 853 transitions, 1974 flow [2025-02-06 09:39:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 770.5) internal successors, (4623), 6 states have internal predecessors, (4623), 0 states have call successors, (0), 0 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-06 09:39:04,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:04,505 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-06 09:39:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:39:04,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 09:39:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -826798812, now seen corresponding path program 1 times [2025-02-06 09:39:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626261412] [2025-02-06 09:39:04,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:04,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:39:04,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:39:04,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:04,538 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-06 09:39:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626261412] [2025-02-06 09:39:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626261412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072765721] [2025-02-06 09:39:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:04,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:04,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:04,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:04,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 774 out of 944 [2025-02-06 09:39:04,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 853 transitions, 1974 flow. Second operand has 3 states, 3 states have (on average 774.6666666666666) internal successors, (2324), 3 states have internal predecessors, (2324), 0 states have call successors, (0), 0 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-06 09:39:04,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:04,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 774 of 944 [2025-02-06 09:39:04,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:15,701 INFO L124 PetriNetUnfolderBase]: 6641/66007 cut-off events. [2025-02-06 09:39:15,701 INFO L125 PetriNetUnfolderBase]: For 7327/10502 co-relation queries the response was YES. [2025-02-06 09:39:16,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81144 conditions, 66007 events. 6641/66007 cut-off events. For 7327/10502 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 978071 event pairs, 1214 based on Foata normal form. 347/62414 useless extension candidates. Maximal degree in co-relation 81134. Up to 4903 conditions per place. [2025-02-06 09:39:16,324 INFO L140 encePairwiseOnDemand]: 930/944 looper letters, 141 selfloop transitions, 10 changer transitions 0/926 dead transitions. [2025-02-06 09:39:16,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 926 transitions, 2649 flow [2025-02-06 09:39:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2381 transitions. [2025-02-06 09:39:16,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407485875706214 [2025-02-06 09:39:16,329 INFO L175 Difference]: Start difference. First operand has 798 places, 853 transitions, 1974 flow. Second operand 3 states and 2381 transitions. [2025-02-06 09:39:16,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 800 places, 926 transitions, 2649 flow [2025-02-06 09:39:16,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 800 places, 926 transitions, 2649 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:39:16,346 INFO L231 Difference]: Finished difference. Result has 802 places, 863 transitions, 2062 flow [2025-02-06 09:39:16,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=944, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=798, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2062, PETRI_PLACES=802, PETRI_TRANSITIONS=863} [2025-02-06 09:39:16,350 INFO L279 CegarLoopForPetriNet]: 807 programPoint places, -5 predicate places. [2025-02-06 09:39:16,350 INFO L471 AbstractCegarLoop]: Abstraction has has 802 places, 863 transitions, 2062 flow [2025-02-06 09:39:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 774.6666666666666) internal successors, (2324), 3 states have internal predecessors, (2324), 0 states have call successors, (0), 0 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-06 09:39:16,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:16,352 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] [2025-02-06 09:39:16,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:39:16,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 09:39:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 15345649, now seen corresponding path program 1 times [2025-02-06 09:39:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923019397] [2025-02-06 09:39:16,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:39:16,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:39:16,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:16,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:16,375 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-06 09:39:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923019397] [2025-02-06 09:39:16,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923019397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:16,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:16,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:39:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197629] [2025-02-06 09:39:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:16,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:16,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:16,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:16,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:16,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 777 out of 944 [2025-02-06 09:39:16,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 863 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 777.6666666666666) internal successors, (2333), 3 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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-06 09:39:16,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:16,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 777 of 944 [2025-02-06 09:39:16,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:25,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2702] L3779-17-->L3779-10: Formula: (let ((.cse1 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 1)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 2)) (.cse0 (select |v_#race_361| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|)) (.cse3 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 3))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|) 0) (= |v_#race_361| (store |v_#race_362| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7| (store (store (store (store (select |v_#race_362| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_3| (select (select |v_#memory_int_111| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|)) (= (select .cse0 .cse3) 0))) InVars {#race=|v_#race_362|, #memory_int=|v_#memory_int_111|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|} OutVars{#race=|v_#race_361|, #memory_int=|v_#memory_int_111|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|, runThread1of2ForFork0_vatomic32_read_#t~mem432#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_3|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem432#1][226], [808#true, 806#true, 810#true, 300#L6011-6true, Black: 817#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (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~nondet820#1|)) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), Black: 815#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), 823#true, Black: 814#(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~nondet820#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~nondet820#1|))), Black: 816#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), 812#true, 103#L3779-19true, Black: 825#(= |#race~g_cs_x~0| 0), 771#L3779-10true, 828#true]) [2025-02-06 09:39:25,695 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-02-06 09:39:25,695 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-06 09:39:25,695 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-02-06 09:39:25,695 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-02-06 09:39:30,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2702] L3779-17-->L3779-10: Formula: (let ((.cse1 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 1)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 2)) (.cse0 (select |v_#race_361| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|)) (.cse3 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 3))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|) 0) (= |v_#race_361| (store |v_#race_362| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7| (store (store (store (store (select |v_#race_362| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7| 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_3| (select (select |v_#memory_int_111| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|)) (= (select .cse0 .cse3) 0))) InVars {#race=|v_#race_362|, #memory_int=|v_#memory_int_111|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|} OutVars{#race=|v_#race_361|, #memory_int=|v_#memory_int_111|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_7|, runThread1of2ForFork0_vatomic32_read_#t~mem432#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem432#1_3|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem432#1][225], [808#true, 806#true, 810#true, 300#L6011-6true, 830#(= |#race~g_cs_y~0| 0), Black: 817#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (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~nondet820#1|)) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), Black: 815#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), Black: 814#(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~nondet820#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~nondet820#1|))), 823#true, 241#L5978-7true, Black: 816#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), 812#true, 771#L3779-10true, Black: 825#(= |#race~g_cs_x~0| 0)]) [2025-02-06 09:39:30,229 INFO L294 olderBase$Statistics]: this new event has 332 ancestors and is cut-off event [2025-02-06 09:39:30,229 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2025-02-06 09:39:30,229 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-02-06 09:39:30,229 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:39:38,443 INFO L124 PetriNetUnfolderBase]: 10860/135420 cut-off events. [2025-02-06 09:39:38,443 INFO L125 PetriNetUnfolderBase]: For 10888/13579 co-relation queries the response was YES. [2025-02-06 09:39:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160859 conditions, 135420 events. 10860/135420 cut-off events. For 10888/13579 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 2253124 event pairs, 2074 based on Foata normal form. 120/128617 useless extension candidates. Maximal degree in co-relation 160847. Up to 6988 conditions per place. [2025-02-06 09:39:39,496 INFO L140 encePairwiseOnDemand]: 933/944 looper letters, 138 selfloop transitions, 8 changer transitions 0/934 dead transitions. [2025-02-06 09:39:39,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 804 places, 934 transitions, 2723 flow [2025-02-06 09:39:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2384 transitions. [2025-02-06 09:39:39,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418079096045198 [2025-02-06 09:39:39,500 INFO L175 Difference]: Start difference. First operand has 802 places, 863 transitions, 2062 flow. Second operand 3 states and 2384 transitions. [2025-02-06 09:39:39,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 804 places, 934 transitions, 2723 flow [2025-02-06 09:39:39,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 802 places, 934 transitions, 2703 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:39:39,522 INFO L231 Difference]: Finished difference. Result has 804 places, 871 transitions, 2112 flow [2025-02-06 09:39:39,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=944, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=800, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=804, PETRI_TRANSITIONS=871} [2025-02-06 09:39:39,524 INFO L279 CegarLoopForPetriNet]: 807 programPoint places, -3 predicate places. [2025-02-06 09:39:39,524 INFO L471 AbstractCegarLoop]: Abstraction has has 804 places, 871 transitions, 2112 flow [2025-02-06 09:39:39,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 777.6666666666666) internal successors, (2333), 3 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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-06 09:39:39,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:39,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:39,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:39:39,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 09:39:39,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1073637129, now seen corresponding path program 1 times [2025-02-06 09:39:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047041118] [2025-02-06 09:39:39,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:39:39,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:39:39,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:39,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:39,561 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-06 09:39:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:39,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047041118] [2025-02-06 09:39:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047041118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:39,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:39:39,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:39:39,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382836158] [2025-02-06 09:39:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:39,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:39:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:39,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:39:39,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:39:39,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 782 out of 944 [2025-02-06 09:39:39,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 871 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 783.3333333333334) internal successors, (2350), 3 states have internal predecessors, (2350), 0 states have call successors, (0), 0 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-06 09:39:39,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:39,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 782 of 944 [2025-02-06 09:39:39,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:48,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2294] L3779-17-->L3779-10: Formula: (let ((.cse1 (+ |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7| 1)) (.cse2 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|)) (.cse3 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|)) (.cse0 (select |v_#race_361| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7|))) (and (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem432#1_3| (select (select |v_#memory_int_111| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|)) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (store |v_#race_362| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7| (store (store (store (store (select |v_#race_362| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7| 0) .cse1 0) .cse3 0) .cse2 0)) |v_#race_361|) (= (select .cse0 .cse3) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|) 0))) InVars {#race=|v_#race_362|, #memory_int=|v_#memory_int_111|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7|} OutVars{#race=|v_#race_361|, runThread2of2ForFork0_vatomic32_read_#t~mem432#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem432#1_3|, #memory_int=|v_#memory_int_111|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_7|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_7|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem432#1][358], [808#true, 806#true, 478#L3779-10true, 810#true, Black: 817#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (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~nondet820#1|)) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), 156#ULTIMATE.startFINALtrue, Black: 815#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), Black: 814#(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~nondet820#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~nondet820#1|))), Black: 816#(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~nondet820#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~nondet820#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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)))))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet820#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))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet820#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 (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= (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~nondet820#1|)))), 812#true, Black: 823#true, 828#true, 771#L3779-10true, Black: 830#(= |#race~g_cs_y~0| 0), 833#true]) [2025-02-06 09:39:48,308 INFO L294 olderBase$Statistics]: this new event has 368 ancestors and is cut-off event [2025-02-06 09:39:48,308 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-02-06 09:39:48,308 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-02-06 09:39:48,308 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event