./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-1_3b-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/ldv-races/race-1_3b-join.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 c73b137d4d055d601e6891c370b9da4780621da8a7fc8a5ca4886c6b3b685d8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:16:57,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:16:57,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:16:57,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:16:57,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:16:57,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:16:57,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:16:57,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:16:57,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:16:57,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:16:57,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:16:57,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:57,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:57,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:16:57,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:16:57,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:16:57,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:16:57,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:16:57,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:16:57,285 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 -> c73b137d4d055d601e6891c370b9da4780621da8a7fc8a5ca4886c6b3b685d8b [2025-01-09 21:16:57,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:16:57,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:16:57,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:16:57,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:16:57,526 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:16:57,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_3b-join.i [2025-01-09 21:16:58,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3723ff478/22cdd8da25da4997b121453bab6d213d/FLAGf86658673 [2025-01-09 21:16:59,133 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:16:59,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_3b-join.i [2025-01-09 21:16:59,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3723ff478/22cdd8da25da4997b121453bab6d213d/FLAGf86658673 [2025-01-09 21:16:59,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3723ff478/22cdd8da25da4997b121453bab6d213d [2025-01-09 21:16:59,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:16:59,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:16:59,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:16:59,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:16:59,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:16:59,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:59" (1/1) ... [2025-01-09 21:16:59,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124bdcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:16:59, skipping insertion in model container [2025-01-09 21:16:59,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:16:59" (1/1) ... [2025-01-09 21:16:59,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:16:59,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:16:59,877 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:16:59,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:00,014 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:00,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00 WrapperNode [2025-01-09 21:17:00,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:00,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:00,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:00,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:00,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,058 INFO L138 Inliner]: procedures = 481, calls = 25, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 119 [2025-01-09 21:17:00,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:00,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:00,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:00,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:00,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:00,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:00,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:00,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:00,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (1/1) ... [2025-01-09 21:17:00,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:00,113 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-01-09 21:17:00,116 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-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:00,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:17:00,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:17:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:00,132 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:17:00,315 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:00,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:00,443 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:00,444 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:00,457 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:00,458 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:17:00,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:00 BoogieIcfgContainer [2025-01-09 21:17:00,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:00,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:00,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:00,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:00,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:16:59" (1/3) ... [2025-01-09 21:17:00,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef0b7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:00, skipping insertion in model container [2025-01-09 21:17:00,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:00" (2/3) ... [2025-01-09 21:17:00,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef0b7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:00, skipping insertion in model container [2025-01-09 21:17:00,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:00" (3/3) ... [2025-01-09 21:17:00,466 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_3b-join.i [2025-01-09 21:17:00,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:00,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_3b-join.i that has 2 procedures, 154 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-01-09 21:17:00,477 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:00,521 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:17:00,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 333 flow [2025-01-09 21:17:00,588 INFO L124 PetriNetUnfolderBase]: 11/200 cut-off events. [2025-01-09 21:17:00,590 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:17:00,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 200 events. 11/200 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 332 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2025-01-09 21:17:00,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 333 flow [2025-01-09 21:17:00,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 296 flow [2025-01-09 21:17:00,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:00,607 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;@5305c5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:00,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:17:00,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:00,612 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:17:00,612 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:00,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:00,612 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] [2025-01-09 21:17:00,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:00,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1862016540, now seen corresponding path program 1 times [2025-01-09 21:17:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470272654] [2025-01-09 21:17:00,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:00,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:00,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:17:00,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:17:00,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:00,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470272654] [2025-01-09 21:17:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470272654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134114866] [2025-01-09 21:17:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:00,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:00,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:00,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-01-09 21:17:00,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-01-09 21:17:00,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:00,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-01-09 21:17:00,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:00,923 INFO L124 PetriNetUnfolderBase]: 9/211 cut-off events. [2025-01-09 21:17:00,924 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:17:00,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 211 events. 9/211 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 574 event pairs, 9 based on Foata normal form. 10/195 useless extension candidates. Maximal degree in co-relation 120. Up to 38 conditions per place. [2025-01-09 21:17:00,925 INFO L140 encePairwiseOnDemand]: 154/163 looper letters, 16 selfloop transitions, 2 changer transitions 6/132 dead transitions. [2025-01-09 21:17:00,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 306 flow [2025-01-09 21:17:00,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2025-01-09 21:17:00,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609406952965235 [2025-01-09 21:17:00,935 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 296 flow. Second operand 3 states and 421 transitions. [2025-01-09 21:17:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 306 flow [2025-01-09 21:17:00,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:00,941 INFO L231 Difference]: Finished difference. Result has 135 places, 126 transitions, 258 flow [2025-01-09 21:17:00,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=135, PETRI_TRANSITIONS=126} [2025-01-09 21:17:00,944 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -7 predicate places. [2025-01-09 21:17:00,944 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 126 transitions, 258 flow [2025-01-09 21:17:00,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-01-09 21:17:00,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:00,945 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] [2025-01-09 21:17:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:00,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:00,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1831768595, now seen corresponding path program 1 times [2025-01-09 21:17:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286015582] [2025-01-09 21:17:00,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:00,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:17:00,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:17:00,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:01,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286015582] [2025-01-09 21:17:01,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286015582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:01,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:01,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478311815] [2025-01-09 21:17:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:01,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:01,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:01,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:01,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 163 [2025-01-09 21:17:01,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-01-09 21:17:01,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:01,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 163 [2025-01-09 21:17:01,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,108 INFO L124 PetriNetUnfolderBase]: 11/246 cut-off events. [2025-01-09 21:17:01,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:17:01,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 246 events. 11/246 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 738 event pairs, 4 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 267. Up to 24 conditions per place. [2025-01-09 21:17:01,109 INFO L140 encePairwiseOnDemand]: 150/163 looper letters, 15 selfloop transitions, 8 changer transitions 3/130 dead transitions. [2025-01-09 21:17:01,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 130 transitions, 315 flow [2025-01-09 21:17:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2025-01-09 21:17:01,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8548057259713702 [2025-01-09 21:17:01,111 INFO L175 Difference]: Start difference. First operand has 135 places, 126 transitions, 258 flow. Second operand 3 states and 418 transitions. [2025-01-09 21:17:01,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 130 transitions, 315 flow [2025-01-09 21:17:01,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 130 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:01,114 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 292 flow [2025-01-09 21:17:01,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2025-01-09 21:17:01,115 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -14 predicate places. [2025-01-09 21:17:01,115 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 292 flow [2025-01-09 21:17:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-01-09 21:17:01,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:01,116 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] [2025-01-09 21:17:01,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:01,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:01,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:01,116 INFO L85 PathProgramCache]: Analyzing trace with hash 768850896, now seen corresponding path program 1 times [2025-01-09 21:17:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185201127] [2025-01-09 21:17:01,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:17:01,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:17:01,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185201127] [2025-01-09 21:17:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185201127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586172760] [2025-01-09 21:17:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:01,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:01,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:01,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-01-09 21:17:01,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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-01-09 21:17:01,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:01,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-01-09 21:17:01,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,251 INFO L124 PetriNetUnfolderBase]: 10/239 cut-off events. [2025-01-09 21:17:01,251 INFO L125 PetriNetUnfolderBase]: For 49/52 co-relation queries the response was YES. [2025-01-09 21:17:01,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 239 events. 10/239 cut-off events. For 49/52 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 745 event pairs, 7 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 59. Up to 42 conditions per place. [2025-01-09 21:17:01,252 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 18 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2025-01-09 21:17:01,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 123 transitions, 330 flow [2025-01-09 21:17:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2025-01-09 21:17:01,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8466257668711656 [2025-01-09 21:17:01,254 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 292 flow. Second operand 3 states and 414 transitions. [2025-01-09 21:17:01,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 123 transitions, 330 flow [2025-01-09 21:17:01,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:01,259 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 278 flow [2025-01-09 21:17:01,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-01-09 21:17:01,260 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -18 predicate places. [2025-01-09 21:17:01,260 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 278 flow [2025-01-09 21:17:01,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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-01-09 21:17:01,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:01,261 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] [2025-01-09 21:17:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:01,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:01,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash 244082582, now seen corresponding path program 1 times [2025-01-09 21:17:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959403566] [2025-01-09 21:17:01,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:01,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:17:01,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:17:01,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:01,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959403566] [2025-01-09 21:17:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959403566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:01,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:01,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539788076] [2025-01-09 21:17:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:01,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:01,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:01,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:01,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:01,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 163 [2025-01-09 21:17:01,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-01-09 21:17:01,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:01,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 163 [2025-01-09 21:17:01,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,377 INFO L124 PetriNetUnfolderBase]: 11/278 cut-off events. [2025-01-09 21:17:01,377 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:17:01,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 278 events. 11/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 976 event pairs, 3 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 285. Up to 28 conditions per place. [2025-01-09 21:17:01,378 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 11 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-01-09 21:17:01,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 306 flow [2025-01-09 21:17:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-01-09 21:17:01,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8813905930470347 [2025-01-09 21:17:01,380 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 278 flow. Second operand 3 states and 431 transitions. [2025-01-09 21:17:01,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 306 flow [2025-01-09 21:17:01,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:01,382 INFO L231 Difference]: Finished difference. Result has 123 places, 122 transitions, 276 flow [2025-01-09 21:17:01,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=123, PETRI_TRANSITIONS=122} [2025-01-09 21:17:01,383 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -19 predicate places. [2025-01-09 21:17:01,383 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 122 transitions, 276 flow [2025-01-09 21:17:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-01-09 21:17:01,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:01,383 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] [2025-01-09 21:17:01,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:01,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:01,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1587300180, now seen corresponding path program 1 times [2025-01-09 21:17:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527853785] [2025-01-09 21:17:01,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:01,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:17:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:17:01,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527853785] [2025-01-09 21:17:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527853785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:01,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:01,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071085571] [2025-01-09 21:17:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:01,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:01,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:01,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:01,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 163 [2025-01-09 21:17:01,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-01-09 21:17:01,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:01,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 163 [2025-01-09 21:17:01,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,506 INFO L124 PetriNetUnfolderBase]: 16/273 cut-off events. [2025-01-09 21:17:01,506 INFO L125 PetriNetUnfolderBase]: For 26/37 co-relation queries the response was YES. [2025-01-09 21:17:01,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 273 events. 16/273 cut-off events. For 26/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1042 event pairs, 7 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 259. Up to 50 conditions per place. [2025-01-09 21:17:01,507 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 17 selfloop transitions, 6 changer transitions 6/126 dead transitions. [2025-01-09 21:17:01,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 334 flow [2025-01-09 21:17:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2025-01-09 21:17:01,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650306748466258 [2025-01-09 21:17:01,509 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 276 flow. Second operand 3 states and 423 transitions. [2025-01-09 21:17:01,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 334 flow [2025-01-09 21:17:01,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 126 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:01,512 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 306 flow [2025-01-09 21:17:01,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2025-01-09 21:17:01,513 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -17 predicate places. [2025-01-09 21:17:01,513 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 306 flow [2025-01-09 21:17:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-01-09 21:17:01,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:01,513 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] [2025-01-09 21:17:01,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:01,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2036293428, now seen corresponding path program 1 times [2025-01-09 21:17:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757183107] [2025-01-09 21:17:01,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:01,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:17:01,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:17:01,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757183107] [2025-01-09 21:17:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757183107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:01,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:01,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:01,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481249] [2025-01-09 21:17:01,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:01,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:01,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:01,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:01,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-01-09 21:17:01,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-01-09 21:17:01,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:01,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-01-09 21:17:01,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:01,668 INFO L124 PetriNetUnfolderBase]: 31/329 cut-off events. [2025-01-09 21:17:01,668 INFO L125 PetriNetUnfolderBase]: For 85/89 co-relation queries the response was YES. [2025-01-09 21:17:01,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 329 events. 31/329 cut-off events. For 85/89 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1402 event pairs, 12 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 198. Up to 67 conditions per place. [2025-01-09 21:17:01,670 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 21 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2025-01-09 21:17:01,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 125 transitions, 376 flow [2025-01-09 21:17:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2025-01-09 21:17:01,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8568507157464212 [2025-01-09 21:17:01,671 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 306 flow. Second operand 3 states and 419 transitions. [2025-01-09 21:17:01,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 125 transitions, 376 flow [2025-01-09 21:17:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 125 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:01,674 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 336 flow [2025-01-09 21:17:01,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-01-09 21:17:01,675 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -21 predicate places. [2025-01-09 21:17:01,675 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 336 flow [2025-01-09 21:17:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-01-09 21:17:01,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:01,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:01,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:01,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:17:01,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash 100989333, now seen corresponding path program 1 times [2025-01-09 21:17:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684249887] [2025-01-09 21:17:01,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:01,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:17:01,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:17:01,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:01,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:17:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:17:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:17:01,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:17:01,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:17:01,733 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:17:01,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-01-09 21:17:01,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:17:01,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:17:01,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:17:01,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 13 remaining) [2025-01-09 21:17:01,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:01,737 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:01,760 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:01,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:01,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:01 BasicIcfg [2025-01-09 21:17:01,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:01,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:01,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:01,764 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:01,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:00" (3/4) ... [2025-01-09 21:17:01,766 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:17:01,800 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 21:17:01,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:01,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:01,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:01,832 INFO L158 Benchmark]: Toolchain (without parser) took 2474.60ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 106.6MB in the beginning and 238.1MB in the end (delta: -131.5MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:01,832 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:01,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.51ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 54.9MB in the end (delta: 51.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:01,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 51.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:01,833 INFO L158 Benchmark]: Boogie Preprocessor took 27.31ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 49.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:01,833 INFO L158 Benchmark]: RCFGBuilder took 371.58ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 95.1MB in the end (delta: -45.2MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:01,833 INFO L158 Benchmark]: TraceAbstraction took 1303.92ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 95.1MB in the beginning and 246.5MB in the end (delta: -151.4MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2025-01-09 21:17:01,833 INFO L158 Benchmark]: Witness Printer took 67.09ms. Allocated memory is still 369.1MB. Free memory was 246.5MB in the beginning and 238.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:01,834 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.51ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 54.9MB in the end (delta: 51.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 51.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.31ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 49.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.58ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 95.1MB in the end (delta: -45.2MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1303.92ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 95.1MB in the beginning and 246.5MB in the end (delta: -151.4MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * Witness Printer took 67.09ms. Allocated memory is still 369.1MB. Free memory was 246.5MB in the beginning and 238.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1; VAL [t1=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0] [L1726] CALL, EXPR 0 module_init() [L1705] 0 pdev = 1 VAL [mutex={3:0}, pdev=1, t1=0] [L1706] EXPR 0 pdev==1 [L1706] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={3:0}, pdev=1, t1=0] [L1706] RET 0 ldv_assert(pdev==1) [L1707] COND TRUE 0 __VERIFIER_nondet_int() VAL [mutex={3:0}, pdev=1, t1=0] [L1708] 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [mutex={3:0}, pdev=1, t1=-1] [L1708] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [\old(arg)={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1709] 0 return 0; VAL [\old(arg)={0:0}, \result=0, arg={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1726] RET, EXPR 0 module_init() [L1726] COND FALSE 0 !(module_init()!=0) VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1727] CALL 0 module_exit() [L1717] 0 void *status; VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=1, status={5:0}, t1=-1] [L1718] 0 pdev = 4 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=4, status={5:0}, t1=-1] [L1699] 1 pdev = 6 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] [L1718] 0 pdev = 4 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, status={5:0}, t1=-1] [L1699] 1 pdev = 6 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] Now there is a data race on ~pdev~0 between C: pdev = 4 [1718] and C: pdev = 6 [1699] - UnprovableResult [Line: 1705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 169 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 17 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:17:01,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)