./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/ttaslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/ttaslock.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 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:47:02,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:47:02,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:47:02,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:47:02,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:47:02,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:47:02,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:47:02,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:47:02,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:47:02,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:47:02,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:47:02,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:47:02,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:47:02,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:47:02,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:47:02,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:47:02,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:47:02,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:47:02,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:47:02,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:47:02,521 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 -> 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 [2025-02-08 05:47:02,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:47:02,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:47:02,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:47:02,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:47:02,792 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:47:02,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ttaslock.i [2025-02-08 05:47:04,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cafe1223/2a1aac05595e48b7a0f58f6dd0720d18/FLAGfe37c4047 [2025-02-08 05:47:04,611 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:47:04,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/ttaslock.i [2025-02-08 05:47:04,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cafe1223/2a1aac05595e48b7a0f58f6dd0720d18/FLAGfe37c4047 [2025-02-08 05:47:04,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cafe1223/2a1aac05595e48b7a0f58f6dd0720d18 [2025-02-08 05:47:04,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:47:04,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:47:04,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:47:04,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:47:04,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:47:04,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:47:04" (1/1) ... [2025-02-08 05:47:04,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:04, skipping insertion in model container [2025-02-08 05:47:04,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:47:04" (1/1) ... [2025-02-08 05:47:04,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:47:06,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:47:06,219 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:47:06,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:47:06,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:47:06,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:47:06,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:47:06,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:47:06,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:47:06,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:47:06,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:47:06,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:47:06,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:47:06,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:47:06,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:47:06,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:47:06,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:47:06,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:47:06,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:47:06,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:47:06,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:47:06,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:47:06,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:47:06,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:47:06,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:47:06,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:47:06,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:47:06,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:47:06,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:47:06,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:47:06,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:47:06,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:47:06,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:47:06,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:47:06,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:47:06,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:47:06,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:47:06,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:47:06,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:47:06,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:47:06,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:47:06,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:47:06,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:47:06,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:47:06,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:47:06,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:47:06,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:47:06,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:47:06,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:47:06,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:47:06,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:47:06,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:47:06,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:47:06,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:47:06,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:47:06,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:47:06,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:47:06,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:47:06,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:47:06,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:47:06,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:47:06,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:47:06,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:47:06,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:47:06,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:47:06,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:47:06,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:47:06,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:47:06,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:47:06,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:47:06,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:47:06,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:47:06,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:47:06,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:47:06,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:47:06,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:47:06,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:47:06,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:47:06,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:47:06,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:47:06,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:47:06,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:47:06,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:47:06,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:47:06,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:47:06,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:47:06,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:47:06,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:47:06,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:47:06,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:47:06,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:47:06,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:47:06,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:47:06,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:47:06,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:47:06,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:47:06,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:47:06,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:47:06,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:47:06,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:47:06,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:47:06,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:47:06,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:47:06,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:47:06,612 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:47:06,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06 WrapperNode [2025-02-08 05:47:06,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:47:06,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:47:06,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:47:06,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:47:06,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,698 INFO L138 Inliner]: procedures = 917, calls = 913, calls flagged for inlining = 815, calls inlined = 29, statements flattened = 318 [2025-02-08 05:47:06,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:47:06,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:47:06,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:47:06,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:47:06,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:47:06,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:47:06,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:47:06,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:47:06,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (1/1) ... [2025-02-08 05:47:06,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:47:06,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:47:06,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:47:06,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:47:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:47:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:47:06,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 05:47:06,792 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:47:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:47:06,793 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:47:06,921 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:47:06,923 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:47:07,093 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:47:07,093 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:47:07,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3867-1: vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset := vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset; [2025-02-08 05:47:07,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3867: vatomic32_xchg_~v#1 := vatomic32_xchg_#in~v#1; [2025-02-08 05:47:07,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 05:47:07,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:47:07,338 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3871: vatomic32_xchg_~tmp~8#1 := vatomic32_xchg_#t~mem446#1; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872: havoc vatomic32_xchg_#t~nondet447#1; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-2: [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-1: havoc vatomic32_xchg_#t~mem446#1; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-4: #race := #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset := vatomic32_xchg_#t~nondet447#1]; [2025-02-08 05:47:07,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-3: assume ((#race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1 && #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1) && #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1) && #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-3: assume !(((#race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1 && #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1) && #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1) && #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset] == vatomic32_xchg_#t~nondet447#1); [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-6: #race := #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset := vatomic32_xchg_#t~nondet447#1]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-5: #race := #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset := vatomic32_xchg_#t~nondet447#1]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-8: havoc vatomic32_xchg_#t~nondet447#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-7: #race := #race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset := vatomic32_xchg_#t~nondet447#1]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-10: SUMMARY for call vatomic32_xchg_#t~mem446#1 := read~int(vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-9: SUMMARY for call write~int(vatomic32_xchg_~v#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-12: #race := #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset := 0]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-11: assume ((0 == #race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset] && 0 == #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset]) && 0 == #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset]) && 0 == #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-11: assume !(((0 == #race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset] && 0 == #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset]) && 0 == #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset]) && 0 == #race[vatomic32_xchg_~a#1.base,3 + vatomic32_xchg_~a#1.offset]); [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-14: #race := #race[vatomic32_xchg_~a#1.base,1 + vatomic32_xchg_~a#1.offset := 0]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: vatomic32_xchg_acq_~v#1 := vatomic32_xchg_acq_#in~v#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-13: #race := #race[vatomic32_xchg_~a#1.base,2 + vatomic32_xchg_~a#1.offset := 0]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907-1: vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset := vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3872-15: #race := #race[vatomic32_xchg_~a#1.base,vatomic32_xchg_~a#1.offset := 0]; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-3: assume { :end_inline_vatomic32_await_eq } true;vatomic32_await_eq_rlx_#res#1 := vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-2: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-5: havoc vatomic32_await_eq_#t~ret679#1, vatomic32_await_eq_#t~ite680#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-4: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255-6: vatomic32_await_eq_rlx_#t~ret168#1 := vatomic32_await_eq_#res#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3874-1: vatomic32_xchg_#res#1 := vatomic32_xchg_~tmp~8#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-2: havoc vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-3: assume { :end_inline_vatomic32_xchg } true;vatomic32_xchg_acq_#res#1 := vatomic32_xchg_acq_#t~ret115#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-4: havoc vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset, vatomic32_xchg_#in~v#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-5: havoc vatomic32_xchg_#t~mem446#1, vatomic32_xchg_#t~nondet447#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, vatomic32_xchg_~v#1, vatomic32_xchg_~tmp~8#1; [2025-02-08 05:47:07,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-6: vatomic32_xchg_acq_#t~ret115#1 := vatomic32_xchg_#res#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-7: havoc vatomic32_xchg_#t~mem446#1, vatomic32_xchg_#t~nondet447#1, vatomic32_xchg_~a#1.base, vatomic32_xchg_~a#1.offset, vatomic32_xchg_~v#1, vatomic32_xchg_~tmp~8#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-8: havoc vatomic32_xchg_#res#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-9: assume { :begin_inline_vatomic32_xchg } true;vatomic32_xchg_#in~a#1.base, vatomic32_xchg_#in~a#1.offset, vatomic32_xchg_#in~v#1 := vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383: assume { :end_inline_vatomic32_await_eq_rlx } true;havoc ttaslock_acquire_#t~ret801#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-1: havoc vatomic32_await_eq_rlx_#in~a#1.base, vatomic32_await_eq_rlx_#in~a#1.offset, vatomic32_await_eq_rlx_#in~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-2: havoc vatomic32_await_eq_rlx_#t~ret168#1, vatomic32_await_eq_rlx_~a#1.base, vatomic32_await_eq_rlx_~a#1.offset, vatomic32_await_eq_rlx_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383-3: ttaslock_acquire_#t~ret801#1 := vatomic32_await_eq_rlx_#res#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-1: havoc ttaslock_acquire_#t~ret802#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-2: havoc ttaslock_acquire_#t~ret802#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384: assume 0 == ttaslock_acquire_#t~ret802#1 % 4294967296; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384: assume !(0 == ttaslock_acquire_#t~ret802#1 % 4294967296); [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-5: ttaslock_acquire_#t~ret802#1 := vatomic32_xchg_acq_#res#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-6: havoc vatomic32_xchg_acq_#t~ret115#1, vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-3: havoc vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset, vatomic32_xchg_acq_#in~v#1;assume { :end_inline_vatomic32_xchg_acq } true; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-4: havoc vatomic32_xchg_acq_#t~ret115#1, vatomic32_xchg_acq_~a#1.base, vatomic32_xchg_acq_~a#1.offset, vatomic32_xchg_acq_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-7: havoc vatomic32_xchg_acq_#res#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5384-8: assume { :begin_inline_vatomic32_xchg_acq } true;vatomic32_xchg_acq_#in~a#1.base, vatomic32_xchg_acq_#in~a#1.offset, vatomic32_xchg_acq_#in~v#1 := ttaslock_acquire_~l#1.base, ttaslock_acquire_~l#1.offset, 1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite680#1 := 0; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:47:07,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:47:07,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:47:07,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:47:07,343 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:47:07,344 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:47:07,384 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:47:07,385 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:47:07,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:47:07 BoogieIcfgContainer [2025-02-08 05:47:07,385 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:47:07,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:47:07,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:47:07,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:47:07,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:47:04" (1/3) ... [2025-02-08 05:47:07,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc9c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:47:07, skipping insertion in model container [2025-02-08 05:47:07,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:47:06" (2/3) ... [2025-02-08 05:47:07,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc9c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:47:07, skipping insertion in model container [2025-02-08 05:47:07,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:47:07" (3/3) ... [2025-02-08 05:47:07,396 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-02-08 05:47:07,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:47:07,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 253 locations, 1 initial locations, 37 loop locations, and 13 error locations. [2025-02-08 05:47:07,410 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:47:07,508 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:47:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 307 transitions, 621 flow [2025-02-08 05:47:07,651 INFO L124 PetriNetUnfolderBase]: 68/385 cut-off events. [2025-02-08 05:47:07,656 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:47:07,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 385 events. 68/385 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1208 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 268. Up to 6 conditions per place. [2025-02-08 05:47:07,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 307 transitions, 621 flow [2025-02-08 05:47:07,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 307 transitions, 621 flow [2025-02-08 05:47:07,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:07,692 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;@6d73f57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:07,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:47:07,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:07,703 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:47:07,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:07,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:07,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:07,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1618696727, now seen corresponding path program 1 times [2025-02-08 05:47:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:07,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477334826] [2025-02-08 05:47:07,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:47:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:47:07,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:07,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477334826] [2025-02-08 05:47:07,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477334826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:07,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:07,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796474757] [2025-02-08 05:47:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:47:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:07,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:47:07,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:47:07,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 307 [2025-02-08 05:47:07,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 307 transitions, 621 flow. Second operand has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:07,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:07,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 307 [2025-02-08 05:47:07,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:07,925 INFO L124 PetriNetUnfolderBase]: 3/277 cut-off events. [2025-02-08 05:47:07,926 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:47:07,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 277 events. 3/277 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 662 event pairs, 0 based on Foata normal form. 94/350 useless extension candidates. Maximal degree in co-relation 186. Up to 5 conditions per place. [2025-02-08 05:47:07,928 INFO L140 encePairwiseOnDemand]: 253/307 looper letters, 4 selfloop transitions, 0 changer transitions 0/217 dead transitions. [2025-02-08 05:47:07,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 217 transitions, 449 flow [2025-02-08 05:47:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:47:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:47:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 556 transitions. [2025-02-08 05:47:07,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055374592833876 [2025-02-08 05:47:07,939 INFO L175 Difference]: Start difference. First operand has 256 places, 307 transitions, 621 flow. Second operand 2 states and 556 transitions. [2025-02-08 05:47:07,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 217 transitions, 449 flow [2025-02-08 05:47:07,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 217 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:07,950 INFO L231 Difference]: Finished difference. Result has 218 places, 217 transitions, 441 flow [2025-02-08 05:47:07,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=441, PETRI_PLACES=218, PETRI_TRANSITIONS=217} [2025-02-08 05:47:07,954 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -38 predicate places. [2025-02-08 05:47:07,954 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 217 transitions, 441 flow [2025-02-08 05:47:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:07,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:07,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:47:07,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash 218804993, now seen corresponding path program 1 times [2025-02-08 05:47:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814990536] [2025-02-08 05:47:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:07,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:47:07,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:47:07,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814990536] [2025-02-08 05:47:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814990536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:08,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:08,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205114854] [2025-02-08 05:47:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:08,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:09,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 307 [2025-02-08 05:47:09,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 217 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:09,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 307 [2025-02-08 05:47:09,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,232 INFO L124 PetriNetUnfolderBase]: 82/1184 cut-off events. [2025-02-08 05:47:09,233 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:47:09,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1184 events. 82/1184 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6882 event pairs, 18 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 1338. Up to 128 conditions per place. [2025-02-08 05:47:09,238 INFO L140 encePairwiseOnDemand]: 298/307 looper letters, 22 selfloop transitions, 14 changer transitions 0/230 dead transitions. [2025-02-08 05:47:09,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 230 transitions, 539 flow [2025-02-08 05:47:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1417 transitions. [2025-02-08 05:47:09,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7692725298588491 [2025-02-08 05:47:09,247 INFO L175 Difference]: Start difference. First operand has 218 places, 217 transitions, 441 flow. Second operand 6 states and 1417 transitions. [2025-02-08 05:47:09,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 230 transitions, 539 flow [2025-02-08 05:47:09,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:09,257 INFO L231 Difference]: Finished difference. Result has 228 places, 230 transitions, 539 flow [2025-02-08 05:47:09,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=228, PETRI_TRANSITIONS=230} [2025-02-08 05:47:09,258 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -28 predicate places. [2025-02-08 05:47:09,258 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 230 transitions, 539 flow [2025-02-08 05:47:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:09,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:09,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:47:09,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:09,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash -396266223, now seen corresponding path program 1 times [2025-02-08 05:47:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454329569] [2025-02-08 05:47:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:47:09,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:47:09,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:09,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454329569] [2025-02-08 05:47:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454329569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737170109] [2025-02-08 05:47:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:09,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 307 [2025-02-08 05:47:09,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 230 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:09,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 307 [2025-02-08 05:47:09,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,420 INFO L124 PetriNetUnfolderBase]: 61/1194 cut-off events. [2025-02-08 05:47:09,420 INFO L125 PetriNetUnfolderBase]: For 152/272 co-relation queries the response was YES. [2025-02-08 05:47:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 1194 events. 61/1194 cut-off events. For 152/272 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6892 event pairs, 6 based on Foata normal form. 8/1139 useless extension candidates. Maximal degree in co-relation 1399. Up to 56 conditions per place. [2025-02-08 05:47:09,425 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 17 selfloop transitions, 1 changer transitions 0/230 dead transitions. [2025-02-08 05:47:09,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 579 flow [2025-02-08 05:47:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2025-02-08 05:47:09,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915309446254072 [2025-02-08 05:47:09,427 INFO L175 Difference]: Start difference. First operand has 228 places, 230 transitions, 539 flow. Second operand 3 states and 729 transitions. [2025-02-08 05:47:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 579 flow [2025-02-08 05:47:09,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:09,432 INFO L231 Difference]: Finished difference. Result has 228 places, 228 transitions, 537 flow [2025-02-08 05:47:09,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=228, PETRI_TRANSITIONS=228} [2025-02-08 05:47:09,433 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -28 predicate places. [2025-02-08 05:47:09,433 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 228 transitions, 537 flow [2025-02-08 05:47:09,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:09,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:09,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:47:09,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1440266387, now seen corresponding path program 1 times [2025-02-08 05:47:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77074379] [2025-02-08 05:47:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:09,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:47:09,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:47:09,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:09,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77074379] [2025-02-08 05:47:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77074379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:09,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047889059] [2025-02-08 05:47:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:09,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:09,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:09,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 307 [2025-02-08 05:47:09,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 228 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:09,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 307 [2025-02-08 05:47:09,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,606 INFO L124 PetriNetUnfolderBase]: 53/1178 cut-off events. [2025-02-08 05:47:09,606 INFO L125 PetriNetUnfolderBase]: For 144/216 co-relation queries the response was YES. [2025-02-08 05:47:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 1178 events. 53/1178 cut-off events. For 144/216 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6621 event pairs, 2 based on Foata normal form. 8/1135 useless extension candidates. Maximal degree in co-relation 1361. Up to 48 conditions per place. [2025-02-08 05:47:09,613 INFO L140 encePairwiseOnDemand]: 305/307 looper letters, 13 selfloop transitions, 1 changer transitions 2/229 dead transitions. [2025-02-08 05:47:09,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 229 transitions, 575 flow [2025-02-08 05:47:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2025-02-08 05:47:09,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7980456026058632 [2025-02-08 05:47:09,616 INFO L175 Difference]: Start difference. First operand has 228 places, 228 transitions, 537 flow. Second operand 3 states and 735 transitions. [2025-02-08 05:47:09,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 229 transitions, 575 flow [2025-02-08 05:47:09,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 229 transitions, 574 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:09,621 INFO L231 Difference]: Finished difference. Result has 228 places, 227 transitions, 536 flow [2025-02-08 05:47:09,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2025-02-08 05:47:09,622 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -28 predicate places. [2025-02-08 05:47:09,622 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 536 flow [2025-02-08 05:47:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:09,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:47:09,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1260735917, now seen corresponding path program 1 times [2025-02-08 05:47:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61337299] [2025-02-08 05:47:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:09,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:47:09,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:47:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61337299] [2025-02-08 05:47:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61337299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:09,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:09,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707603329] [2025-02-08 05:47:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:09,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:09,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:09,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:09,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 307 [2025-02-08 05:47:09,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:09,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 307 [2025-02-08 05:47:09,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:09,824 INFO L124 PetriNetUnfolderBase]: 60/1226 cut-off events. [2025-02-08 05:47:09,824 INFO L125 PetriNetUnfolderBase]: For 140/310 co-relation queries the response was YES. [2025-02-08 05:47:09,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 1226 events. 60/1226 cut-off events. For 140/310 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7268 event pairs, 6 based on Foata normal form. 7/1174 useless extension candidates. Maximal degree in co-relation 1438. Up to 63 conditions per place. [2025-02-08 05:47:09,830 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 20 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-02-08 05:47:09,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 231 transitions, 600 flow [2025-02-08 05:47:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-02-08 05:47:09,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8056460369163952 [2025-02-08 05:47:09,832 INFO L175 Difference]: Start difference. First operand has 228 places, 227 transitions, 536 flow. Second operand 3 states and 742 transitions. [2025-02-08 05:47:09,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 231 transitions, 600 flow [2025-02-08 05:47:09,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 231 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:09,838 INFO L231 Difference]: Finished difference. Result has 230 places, 227 transitions, 543 flow [2025-02-08 05:47:09,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=230, PETRI_TRANSITIONS=227} [2025-02-08 05:47:09,840 INFO L279 CegarLoopForPetriNet]: 256 programPoint places, -26 predicate places. [2025-02-08 05:47:09,840 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 227 transitions, 543 flow [2025-02-08 05:47:09,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:09,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:09,841 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:09,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:47:09,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-08 05:47:09,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1693899996, now seen corresponding path program 1 times [2025-02-08 05:47:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719989365] [2025-02-08 05:47:09,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:09,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:47:09,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:47:09,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:09,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:09,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:09,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:47:09,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:47:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:09,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:09,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:09,893 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:09,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:47:09,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:47:09,899 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:47:09,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:47:09,899 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:47:09,901 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:09,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:47:09,950 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:47:09,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 493 transitions, 1002 flow [2025-02-08 05:47:10,101 INFO L124 PetriNetUnfolderBase]: 125/712 cut-off events. [2025-02-08 05:47:10,102 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:47:10,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 712 events. 125/712 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3033 event pairs, 0 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 505. Up to 12 conditions per place. [2025-02-08 05:47:10,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 493 transitions, 1002 flow [2025-02-08 05:47:10,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 410 places, 493 transitions, 1002 flow [2025-02-08 05:47:10,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:10,123 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;@6d73f57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:10,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 05:47:10,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:10,127 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:47:10,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:10,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:10,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:10,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 567328630, now seen corresponding path program 1 times [2025-02-08 05:47:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924218114] [2025-02-08 05:47:10,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:10,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:47:10,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:47:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:10,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:10,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924218114] [2025-02-08 05:47:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924218114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122978814] [2025-02-08 05:47:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:10,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:47:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:10,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:47:10,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:47:10,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 493 [2025-02-08 05:47:10,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 493 transitions, 1002 flow. Second operand has 2 states, 2 states have (on average 397.5) internal successors, (795), 2 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:10,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:10,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 493 [2025-02-08 05:47:10,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:10,308 INFO L124 PetriNetUnfolderBase]: 21/1050 cut-off events. [2025-02-08 05:47:10,308 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:47:10,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 1050 events. 21/1050 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5602 event pairs, 10 based on Foata normal form. 484/1438 useless extension candidates. Maximal degree in co-relation 428. Up to 31 conditions per place. [2025-02-08 05:47:10,318 INFO L140 encePairwiseOnDemand]: 405/493 looper letters, 8 selfloop transitions, 0 changer transitions 0/337 dead transitions. [2025-02-08 05:47:10,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 337 transitions, 706 flow [2025-02-08 05:47:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:47:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:47:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 890 transitions. [2025-02-08 05:47:10,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9026369168356998 [2025-02-08 05:47:10,320 INFO L175 Difference]: Start difference. First operand has 410 places, 493 transitions, 1002 flow. Second operand 2 states and 890 transitions. [2025-02-08 05:47:10,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 337 transitions, 706 flow [2025-02-08 05:47:10,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 706 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:10,324 INFO L231 Difference]: Finished difference. Result has 337 places, 337 transitions, 690 flow [2025-02-08 05:47:10,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=690, PETRI_PLACES=337, PETRI_TRANSITIONS=337} [2025-02-08 05:47:10,325 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -73 predicate places. [2025-02-08 05:47:10,325 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 337 transitions, 690 flow [2025-02-08 05:47:10,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 397.5) internal successors, (795), 2 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:10,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:10,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:10,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:47:10,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -804495295, now seen corresponding path program 1 times [2025-02-08 05:47:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046879566] [2025-02-08 05:47:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:47:10,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:47:10,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:10,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046879566] [2025-02-08 05:47:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046879566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:10,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:10,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771665082] [2025-02-08 05:47:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:10,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:10,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:10,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 493 [2025-02-08 05:47:10,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 337 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 379.5) internal successors, (2277), 6 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:10,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:10,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 493 [2025-02-08 05:47:10,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:11,814 INFO L124 PetriNetUnfolderBase]: 653/5543 cut-off events. [2025-02-08 05:47:11,815 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 05:47:11,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6487 conditions, 5543 events. 653/5543 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 52720 event pairs, 175 based on Foata normal form. 0/5045 useless extension candidates. Maximal degree in co-relation 6482. Up to 828 conditions per place. [2025-02-08 05:47:11,871 INFO L140 encePairwiseOnDemand]: 482/493 looper letters, 27 selfloop transitions, 22 changer transitions 0/359 dead transitions. [2025-02-08 05:47:11,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 359 transitions, 837 flow [2025-02-08 05:47:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2318 transitions. [2025-02-08 05:47:11,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7836375929682218 [2025-02-08 05:47:11,875 INFO L175 Difference]: Start difference. First operand has 337 places, 337 transitions, 690 flow. Second operand 6 states and 2318 transitions. [2025-02-08 05:47:11,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 359 transitions, 837 flow [2025-02-08 05:47:11,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 359 transitions, 837 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:11,879 INFO L231 Difference]: Finished difference. Result has 347 places, 358 transitions, 840 flow [2025-02-08 05:47:11,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=840, PETRI_PLACES=347, PETRI_TRANSITIONS=358} [2025-02-08 05:47:11,880 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -63 predicate places. [2025-02-08 05:47:11,880 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 358 transitions, 840 flow [2025-02-08 05:47:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.5) internal successors, (2277), 6 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:11,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:11,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:47:11,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1143641903, now seen corresponding path program 1 times [2025-02-08 05:47:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44846999] [2025-02-08 05:47:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:11,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:47:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:47:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44846999] [2025-02-08 05:47:11,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44846999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:11,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:11,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603810566] [2025-02-08 05:47:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:11,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:11,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:11,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 493 [2025-02-08 05:47:11,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 358 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:11,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:11,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 493 [2025-02-08 05:47:11,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:12,917 INFO L124 PetriNetUnfolderBase]: 495/6380 cut-off events. [2025-02-08 05:47:12,917 INFO L125 PetriNetUnfolderBase]: For 928/1662 co-relation queries the response was YES. [2025-02-08 05:47:12,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7748 conditions, 6380 events. 495/6380 cut-off events. For 928/1662 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 62447 event pairs, 100 based on Foata normal form. 16/6073 useless extension candidates. Maximal degree in co-relation 7738. Up to 449 conditions per place. [2025-02-08 05:47:12,986 INFO L140 encePairwiseOnDemand]: 490/493 looper letters, 31 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2025-02-08 05:47:12,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 360 transitions, 916 flow [2025-02-08 05:47:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1167 transitions. [2025-02-08 05:47:12,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7890466531440162 [2025-02-08 05:47:12,989 INFO L175 Difference]: Start difference. First operand has 347 places, 358 transitions, 840 flow. Second operand 3 states and 1167 transitions. [2025-02-08 05:47:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 360 transitions, 916 flow [2025-02-08 05:47:12,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 916 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:12,994 INFO L231 Difference]: Finished difference. Result has 347 places, 356 transitions, 838 flow [2025-02-08 05:47:12,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=347, PETRI_TRANSITIONS=356} [2025-02-08 05:47:12,995 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -63 predicate places. [2025-02-08 05:47:12,995 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 356 transitions, 838 flow [2025-02-08 05:47:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:12,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:12,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:47:12,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 471792115, now seen corresponding path program 1 times [2025-02-08 05:47:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201553035] [2025-02-08 05:47:12,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:13,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:47:13,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:47:13,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:13,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201553035] [2025-02-08 05:47:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201553035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149538055] [2025-02-08 05:47:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:13,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:13,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 493 [2025-02-08 05:47:13,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 356 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:13,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:13,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 493 [2025-02-08 05:47:13,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:13,910 INFO L124 PetriNetUnfolderBase]: 427/5884 cut-off events. [2025-02-08 05:47:13,911 INFO L125 PetriNetUnfolderBase]: For 872/1398 co-relation queries the response was YES. [2025-02-08 05:47:13,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7103 conditions, 5884 events. 427/5884 cut-off events. For 872/1398 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 56366 event pairs, 68 based on Foata normal form. 16/5631 useless extension candidates. Maximal degree in co-relation 7092. Up to 385 conditions per place. [2025-02-08 05:47:13,989 INFO L140 encePairwiseOnDemand]: 491/493 looper letters, 29 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2025-02-08 05:47:13,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 359 transitions, 912 flow [2025-02-08 05:47:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1173 transitions. [2025-02-08 05:47:13,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2025-02-08 05:47:13,991 INFO L175 Difference]: Start difference. First operand has 347 places, 356 transitions, 838 flow. Second operand 3 states and 1173 transitions. [2025-02-08 05:47:13,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 359 transitions, 912 flow [2025-02-08 05:47:13,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 359 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:13,998 INFO L231 Difference]: Finished difference. Result has 347 places, 355 transitions, 837 flow [2025-02-08 05:47:13,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=347, PETRI_TRANSITIONS=355} [2025-02-08 05:47:13,999 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -63 predicate places. [2025-02-08 05:47:13,999 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 355 transitions, 837 flow [2025-02-08 05:47:14,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.6666666666667) internal successors, (1160), 3 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:14,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:14,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:14,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:47:14,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1218666784, now seen corresponding path program 1 times [2025-02-08 05:47:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574936024] [2025-02-08 05:47:14,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:14,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:47:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:47:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574936024] [2025-02-08 05:47:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574936024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404842544] [2025-02-08 05:47:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:14,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:14,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:14,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:14,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 493 [2025-02-08 05:47:14,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 355 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:14,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:14,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 493 [2025-02-08 05:47:14,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:14,727 INFO L124 PetriNetUnfolderBase]: 470/5505 cut-off events. [2025-02-08 05:47:14,728 INFO L125 PetriNetUnfolderBase]: For 868/2057 co-relation queries the response was YES. [2025-02-08 05:47:14,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 5505 events. 470/5505 cut-off events. For 868/2057 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 52204 event pairs, 104 based on Foata normal form. 7/5200 useless extension candidates. Maximal degree in co-relation 6857. Up to 499 conditions per place. [2025-02-08 05:47:14,785 INFO L140 encePairwiseOnDemand]: 490/493 looper letters, 33 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-02-08 05:47:14,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 360 transitions, 929 flow [2025-02-08 05:47:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1191 transitions. [2025-02-08 05:47:14,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8052738336713996 [2025-02-08 05:47:14,788 INFO L175 Difference]: Start difference. First operand has 347 places, 355 transitions, 837 flow. Second operand 3 states and 1191 transitions. [2025-02-08 05:47:14,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 360 transitions, 929 flow [2025-02-08 05:47:14,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 360 transitions, 928 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:14,792 INFO L231 Difference]: Finished difference. Result has 349 places, 356 transitions, 848 flow [2025-02-08 05:47:14,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=349, PETRI_TRANSITIONS=356} [2025-02-08 05:47:14,793 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -61 predicate places. [2025-02-08 05:47:14,793 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 356 transitions, 848 flow [2025-02-08 05:47:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:14,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:14,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:47:14,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 855915602, now seen corresponding path program 1 times [2025-02-08 05:47:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470215925] [2025-02-08 05:47:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:14,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:47:14,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:47:14,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:14,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470215925] [2025-02-08 05:47:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470215925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467423614] [2025-02-08 05:47:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:47:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:47:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:47:14,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 493 [2025-02-08 05:47:14,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 356 transitions, 848 flow. Second operand has 5 states, 5 states have (on average 390.6) internal successors, (1953), 5 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:14,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:14,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 493 [2025-02-08 05:47:14,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:15,633 INFO L124 PetriNetUnfolderBase]: 516/5623 cut-off events. [2025-02-08 05:47:15,633 INFO L125 PetriNetUnfolderBase]: For 917/2303 co-relation queries the response was YES. [2025-02-08 05:47:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7126 conditions, 5623 events. 516/5623 cut-off events. For 917/2303 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 53962 event pairs, 25 based on Foata normal form. 67/5393 useless extension candidates. Maximal degree in co-relation 7114. Up to 485 conditions per place. [2025-02-08 05:47:15,698 INFO L140 encePairwiseOnDemand]: 488/493 looper letters, 52 selfloop transitions, 5 changer transitions 0/380 dead transitions. [2025-02-08 05:47:15,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 380 transitions, 1078 flow [2025-02-08 05:47:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2364 transitions. [2025-02-08 05:47:15,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7991886409736308 [2025-02-08 05:47:15,702 INFO L175 Difference]: Start difference. First operand has 349 places, 356 transitions, 848 flow. Second operand 6 states and 2364 transitions. [2025-02-08 05:47:15,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 380 transitions, 1078 flow [2025-02-08 05:47:15,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 380 transitions, 1076 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:15,772 INFO L231 Difference]: Finished difference. Result has 356 places, 358 transitions, 872 flow [2025-02-08 05:47:15,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=493, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=356, PETRI_TRANSITIONS=358} [2025-02-08 05:47:15,773 INFO L279 CegarLoopForPetriNet]: 410 programPoint places, -54 predicate places. [2025-02-08 05:47:15,773 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 358 transitions, 872 flow [2025-02-08 05:47:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 390.6) internal successors, (1953), 5 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:15,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:15,775 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:15,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:47:15,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-02-08 05:47:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -651447695, now seen corresponding path program 1 times [2025-02-08 05:47:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42268357] [2025-02-08 05:47:15,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:15,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:47:15,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:47:15,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:15,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:47:15,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:47:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:47:15,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:47:15,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:47:15,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:47:15,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-02-08 05:47:15,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-02-08 05:47:15,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-02-08 05:47:15,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-02-08 05:47:15,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-02-08 05:47:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:47:15,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:15,831 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:47:15,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:47:15,913 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:47:15,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 564 places, 679 transitions, 1385 flow [2025-02-08 05:47:16,136 INFO L124 PetriNetUnfolderBase]: 201/1146 cut-off events. [2025-02-08 05:47:16,136 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:47:16,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 1146 events. 201/1146 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5560 event pairs, 1 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 797. Up to 24 conditions per place. [2025-02-08 05:47:16,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 564 places, 679 transitions, 1385 flow [2025-02-08 05:47:16,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 564 places, 679 transitions, 1385 flow [2025-02-08 05:47:16,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:47:16,182 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;@6d73f57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:47:16,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-08 05:47:16,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:47:16,185 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-02-08 05:47:16,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:47:16,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:16,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:16,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:16,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash 598631677, now seen corresponding path program 1 times [2025-02-08 05:47:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214653606] [2025-02-08 05:47:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:16,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:47:16,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:47:16,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:16,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214653606] [2025-02-08 05:47:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214653606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:16,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687165347] [2025-02-08 05:47:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:16,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:47:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:16,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:47:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:47:16,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 679 [2025-02-08 05:47:16,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 679 transitions, 1385 flow. Second operand has 2 states, 2 states have (on average 545.5) internal successors, (1091), 2 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:16,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:16,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 679 [2025-02-08 05:47:16,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:16,955 INFO L124 PetriNetUnfolderBase]: 128/3902 cut-off events. [2025-02-08 05:47:16,956 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-02-08 05:47:16,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4177 conditions, 3902 events. 128/3902 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 34533 event pairs, 87 based on Foata normal form. 2421/5910 useless extension candidates. Maximal degree in co-relation 1118. Up to 174 conditions per place. [2025-02-08 05:47:17,010 INFO L140 encePairwiseOnDemand]: 557/679 looper letters, 12 selfloop transitions, 0 changer transitions 0/457 dead transitions. [2025-02-08 05:47:17,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 457 transitions, 965 flow [2025-02-08 05:47:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:47:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:47:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1224 transitions. [2025-02-08 05:47:17,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9013254786450663 [2025-02-08 05:47:17,013 INFO L175 Difference]: Start difference. First operand has 564 places, 679 transitions, 1385 flow. Second operand 2 states and 1224 transitions. [2025-02-08 05:47:17,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 457 transitions, 965 flow [2025-02-08 05:47:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 457 transitions, 965 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:17,018 INFO L231 Difference]: Finished difference. Result has 456 places, 457 transitions, 941 flow [2025-02-08 05:47:17,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=941, PETRI_PLACES=456, PETRI_TRANSITIONS=457} [2025-02-08 05:47:17,019 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -108 predicate places. [2025-02-08 05:47:17,019 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 457 transitions, 941 flow [2025-02-08 05:47:17,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 545.5) internal successors, (1091), 2 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:17,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:17,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:47:17,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 216752129, now seen corresponding path program 1 times [2025-02-08 05:47:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117938801] [2025-02-08 05:47:17,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:17,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:47:17,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:47:17,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:17,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117938801] [2025-02-08 05:47:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117938801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:17,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215278099] [2025-02-08 05:47:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:17,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:17,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:17,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 526 out of 679 [2025-02-08 05:47:17,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 457 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 527.5) internal successors, (3165), 6 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:17,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:17,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 526 of 679 [2025-02-08 05:47:17,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:22,197 INFO L124 PetriNetUnfolderBase]: 3536/20890 cut-off events. [2025-02-08 05:47:22,197 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2025-02-08 05:47:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25513 conditions, 20890 events. 3536/20890 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 250941 event pairs, 1158 based on Foata normal form. 0/19013 useless extension candidates. Maximal degree in co-relation 25507. Up to 4188 conditions per place. [2025-02-08 05:47:22,601 INFO L140 encePairwiseOnDemand]: 666/679 looper letters, 32 selfloop transitions, 30 changer transitions 0/488 dead transitions. [2025-02-08 05:47:22,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 488 transitions, 1139 flow [2025-02-08 05:47:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3219 transitions. [2025-02-08 05:47:22,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7901325478645066 [2025-02-08 05:47:22,606 INFO L175 Difference]: Start difference. First operand has 456 places, 457 transitions, 941 flow. Second operand 6 states and 3219 transitions. [2025-02-08 05:47:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 488 transitions, 1139 flow [2025-02-08 05:47:22,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 488 transitions, 1139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:22,612 INFO L231 Difference]: Finished difference. Result has 466 places, 486 transitions, 1143 flow [2025-02-08 05:47:22,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1143, PETRI_PLACES=466, PETRI_TRANSITIONS=486} [2025-02-08 05:47:22,613 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -98 predicate places. [2025-02-08 05:47:22,613 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 486 transitions, 1143 flow [2025-02-08 05:47:22,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 527.5) internal successors, (3165), 6 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:22,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:22,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:47:22,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 449293329, now seen corresponding path program 1 times [2025-02-08 05:47:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620965181] [2025-02-08 05:47:22,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:22,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:47:22,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:47:22,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:22,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620965181] [2025-02-08 05:47:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620965181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605442612] [2025-02-08 05:47:22,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:22,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:22,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:22,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:22,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 527 out of 679 [2025-02-08 05:47:22,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 486 transitions, 1143 flow. Second operand has 3 states, 3 states have (on average 527.6666666666666) internal successors, (1583), 3 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:22,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:22,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 527 of 679 [2025-02-08 05:47:22,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:27,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2485] runEXIT-->L6010: Formula: (= |v_ULTIMATE.start_main_#t~mem819#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][133], [560#true, 417#L6010true, Black: 574#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), Black: 571#(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~nondet816#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~nondet816#1|))), Black: 573#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 569#true, 240#L3779-1true, 567#true, 563#true, 580#true, Black: 572#(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~nondet816#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~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 564#true]) [2025-02-08 05:47:27,035 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-02-08 05:47:27,035 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:47:27,035 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-02-08 05:47:27,035 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:47:27,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2485] runEXIT-->L6010: Formula: (= |v_ULTIMATE.start_main_#t~mem819#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][133], [Black: 574#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 560#true, 417#L6010true, Black: 571#(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~nondet816#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~nondet816#1|))), Black: 573#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 569#true, 361#L3825-1true, 567#true, 563#true, 580#true, Black: 572#(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~nondet816#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~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 564#true]) [2025-02-08 05:47:27,327 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2025-02-08 05:47:27,327 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-02-08 05:47:27,327 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:47:27,327 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:47:29,518 INFO L124 PetriNetUnfolderBase]: 2689/27156 cut-off events. [2025-02-08 05:47:29,519 INFO L125 PetriNetUnfolderBase]: For 3921/5842 co-relation queries the response was YES. [2025-02-08 05:47:29,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34009 conditions, 27156 events. 2689/27156 cut-off events. For 3921/5842 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 354295 event pairs, 616 based on Foata normal form. 24/25943 useless extension candidates. Maximal degree in co-relation 33998. Up to 2468 conditions per place. [2025-02-08 05:47:29,924 INFO L140 encePairwiseOnDemand]: 676/679 looper letters, 45 selfloop transitions, 1 changer transitions 0/490 dead transitions. [2025-02-08 05:47:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 490 transitions, 1255 flow [2025-02-08 05:47:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1605 transitions. [2025-02-08 05:47:29,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879234167893961 [2025-02-08 05:47:29,927 INFO L175 Difference]: Start difference. First operand has 466 places, 486 transitions, 1143 flow. Second operand 3 states and 1605 transitions. [2025-02-08 05:47:29,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 490 transitions, 1255 flow [2025-02-08 05:47:29,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 490 transitions, 1255 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:29,935 INFO L231 Difference]: Finished difference. Result has 466 places, 484 transitions, 1141 flow [2025-02-08 05:47:29,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1141, PETRI_PLACES=466, PETRI_TRANSITIONS=484} [2025-02-08 05:47:29,936 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -98 predicate places. [2025-02-08 05:47:29,936 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 484 transitions, 1141 flow [2025-02-08 05:47:29,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 527.6666666666666) internal successors, (1583), 3 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:29,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:29,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:29,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:47:29,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:29,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2020752877, now seen corresponding path program 1 times [2025-02-08 05:47:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89494058] [2025-02-08 05:47:29,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:47:29,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:47:29,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:29,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89494058] [2025-02-08 05:47:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89494058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:47:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11030950] [2025-02-08 05:47:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:29,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:29,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:29,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 530 out of 679 [2025-02-08 05:47:29,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 484 transitions, 1141 flow. Second operand has 3 states, 3 states have (on average 530.6666666666666) internal successors, (1592), 3 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:29,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:29,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 530 of 679 [2025-02-08 05:47:29,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:33,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2485] runEXIT-->L6010: Formula: (= |v_ULTIMATE.start_main_#t~mem819#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][132], [560#true, Black: 574#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), Black: 571#(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~nondet816#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~nondet816#1|))), Black: 573#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 583#true, 569#true, 240#L3779-1true, 567#true, 564#true, 417#L6010true, 563#true, 580#true, Black: 572#(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~nondet816#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~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|))))]) [2025-02-08 05:47:33,509 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-02-08 05:47:33,509 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:47:33,509 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:47:33,509 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-02-08 05:47:33,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2485] runEXIT-->L6010: Formula: (= |v_ULTIMATE.start_main_#t~mem819#1_12| v_runThread1of3ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem819#1=|v_ULTIMATE.start_main_#t~mem819#1_12|, runThread1of3ForFork0_thidvar0=v_runThread1of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][132], [Black: 574#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296)))) |ULTIMATE.start_main_#t~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 560#true, Black: 571#(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~nondet816#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~nondet816#1|))), 569#true, 583#true, Black: 573#(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~nondet816#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~nondet816#1|))) (or (and (= |ULTIMATE.start_main_#t~nondet816#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))))) (<= 2147483648 (mod |ULTIMATE.start_main_~i~1#1| 4294967296))) (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_~#t~0#1.offset| (* (- 17179869184) (div |ULTIMATE.start_main_~i~1#1| 4294967296))))))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|)))), 361#L3825-1true, 567#true, 564#true, 417#L6010true, 563#true, 580#true, Black: 572#(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~nondet816#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~nondet816#1|))) (or (and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet816#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~nondet816#1|))))]) [2025-02-08 05:47:33,643 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2025-02-08 05:47:33,643 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-02-08 05:47:33,643 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-02-08 05:47:33,643 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:47:34,583 INFO L124 PetriNetUnfolderBase]: 2226/19270 cut-off events. [2025-02-08 05:47:34,584 INFO L125 PetriNetUnfolderBase]: For 3845/6294 co-relation queries the response was YES. [2025-02-08 05:47:34,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25274 conditions, 19270 events. 2226/19270 cut-off events. For 3845/6294 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 230403 event pairs, 288 based on Foata normal form. 208/18455 useless extension candidates. Maximal degree in co-relation 25262. Up to 2084 conditions per place. [2025-02-08 05:47:34,905 INFO L140 encePairwiseOnDemand]: 677/679 looper letters, 43 selfloop transitions, 1 changer transitions 0/489 dead transitions. [2025-02-08 05:47:34,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 489 transitions, 1251 flow [2025-02-08 05:47:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-02-08 05:47:34,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7908689248895434 [2025-02-08 05:47:34,908 INFO L175 Difference]: Start difference. First operand has 466 places, 484 transitions, 1141 flow. Second operand 3 states and 1611 transitions. [2025-02-08 05:47:34,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 489 transitions, 1251 flow [2025-02-08 05:47:34,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 489 transitions, 1250 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:34,916 INFO L231 Difference]: Finished difference. Result has 466 places, 483 transitions, 1140 flow [2025-02-08 05:47:34,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=466, PETRI_TRANSITIONS=483} [2025-02-08 05:47:34,917 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -98 predicate places. [2025-02-08 05:47:34,917 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 483 transitions, 1140 flow [2025-02-08 05:47:34,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 530.6666666666666) internal successors, (1592), 3 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:34,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:34,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:47:34,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1178149529, now seen corresponding path program 1 times [2025-02-08 05:47:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:34,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750569424] [2025-02-08 05:47:34,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:34,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:47:34,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:47:34,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:34,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:34,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750569424] [2025-02-08 05:47:34,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750569424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:34,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846270305] [2025-02-08 05:47:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:34,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:34,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 679 [2025-02-08 05:47:34,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 483 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:34,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:34,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 679 [2025-02-08 05:47:34,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:39,665 INFO L124 PetriNetUnfolderBase]: 2434/20308 cut-off events. [2025-02-08 05:47:39,666 INFO L125 PetriNetUnfolderBase]: For 3767/7033 co-relation queries the response was YES. [2025-02-08 05:47:39,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26857 conditions, 20308 events. 2434/20308 cut-off events. For 3767/7033 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 245633 event pairs, 586 based on Foata normal form. 7/19128 useless extension candidates. Maximal degree in co-relation 26845. Up to 2579 conditions per place. [2025-02-08 05:47:39,980 INFO L140 encePairwiseOnDemand]: 676/679 looper letters, 45 selfloop transitions, 2 changer transitions 0/488 dead transitions. [2025-02-08 05:47:39,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 488 transitions, 1256 flow [2025-02-08 05:47:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-08 05:47:39,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046146293568974 [2025-02-08 05:47:39,983 INFO L175 Difference]: Start difference. First operand has 466 places, 483 transitions, 1140 flow. Second operand 3 states and 1639 transitions. [2025-02-08 05:47:39,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 488 transitions, 1256 flow [2025-02-08 05:47:39,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 488 transitions, 1255 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:39,990 INFO L231 Difference]: Finished difference. Result has 468 places, 484 transitions, 1151 flow [2025-02-08 05:47:39,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1151, PETRI_PLACES=468, PETRI_TRANSITIONS=484} [2025-02-08 05:47:39,992 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -96 predicate places. [2025-02-08 05:47:39,993 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 484 transitions, 1151 flow [2025-02-08 05:47:39,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:39,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:39,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:47:39,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1832363162, now seen corresponding path program 1 times [2025-02-08 05:47:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931312678] [2025-02-08 05:47:39,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:40,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:47:40,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:47:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931312678] [2025-02-08 05:47:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931312678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:40,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:40,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:40,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865283143] [2025-02-08 05:47:40,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:47:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:40,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:47:40,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:47:40,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 679 [2025-02-08 05:47:40,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 484 transitions, 1151 flow. Second operand has 5 states, 5 states have (on average 538.6) internal successors, (2693), 5 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:40,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:40,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 679 [2025-02-08 05:47:40,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:44,872 INFO L124 PetriNetUnfolderBase]: 2697/20772 cut-off events. [2025-02-08 05:47:44,873 INFO L125 PetriNetUnfolderBase]: For 4026/8196 co-relation queries the response was YES. [2025-02-08 05:47:45,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28001 conditions, 20772 events. 2697/20772 cut-off events. For 4026/8196 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 253236 event pairs, 482 based on Foata normal form. 67/19557 useless extension candidates. Maximal degree in co-relation 27988. Up to 2776 conditions per place. [2025-02-08 05:47:45,162 INFO L140 encePairwiseOnDemand]: 674/679 looper letters, 66 selfloop transitions, 5 changer transitions 0/510 dead transitions. [2025-02-08 05:47:45,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 510 transitions, 1415 flow [2025-02-08 05:47:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-02-08 05:47:45,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7997054491899853 [2025-02-08 05:47:45,166 INFO L175 Difference]: Start difference. First operand has 468 places, 484 transitions, 1151 flow. Second operand 6 states and 3258 transitions. [2025-02-08 05:47:45,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 510 transitions, 1415 flow [2025-02-08 05:47:45,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 510 transitions, 1413 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:45,172 INFO L231 Difference]: Finished difference. Result has 475 places, 487 transitions, 1181 flow [2025-02-08 05:47:45,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=679, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1181, PETRI_PLACES=475, PETRI_TRANSITIONS=487} [2025-02-08 05:47:45,173 INFO L279 CegarLoopForPetriNet]: 564 programPoint places, -89 predicate places. [2025-02-08 05:47:45,173 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 487 transitions, 1181 flow [2025-02-08 05:47:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 538.6) internal successors, (2693), 5 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:45,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:45,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:47:45,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-02-08 05:47:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2006003418, now seen corresponding path program 1 times [2025-02-08 05:47:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120824125] [2025-02-08 05:47:45,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:45,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:47:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:47:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:47:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120824125] [2025-02-08 05:47:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120824125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:47:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052592505] [2025-02-08 05:47:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:47:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:45,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:47:45,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:47:45,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 679 [2025-02-08 05:47:45,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 487 transitions, 1181 flow. Second operand has 7 states, 7 states have (on average 538.7142857142857) internal successors, (3771), 7 states have internal predecessors, (3771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:45,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:45,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 679 [2025-02-08 05:47:45,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand