./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/17_szymanski.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/pthread-ext/17_szymanski.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 9d000bd3a81a7401f4ccb21c2696e2644e9236d2ccbd2094291c987ec91aaa92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:04:52,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:04:52,723 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:04:52,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:04:52,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:04:52,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:04:52,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:04:52,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:04:52,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:04:52,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:04:52,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:04:52,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:04:52,767 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:04:52,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:04:52,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:04:52,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:04:52,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:04:52,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:04:52,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:04:52,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:52,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:52,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:52,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:04:52,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:04:52,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:04:52,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:52,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:04:52,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:04:52,773 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 -> 9d000bd3a81a7401f4ccb21c2696e2644e9236d2ccbd2094291c987ec91aaa92 [2025-01-09 21:04:53,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:04:53,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:04:53,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:04:53,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:04:53,046 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:04:53,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/17_szymanski.i [2025-01-09 21:04:54,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a32b22adb/2b28413a4c3a4245ab6e93e51eb49797/FLAG34cf05906 [2025-01-09 21:04:54,564 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:04:54,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/17_szymanski.i [2025-01-09 21:04:54,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a32b22adb/2b28413a4c3a4245ab6e93e51eb49797/FLAG34cf05906 [2025-01-09 21:04:54,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a32b22adb/2b28413a4c3a4245ab6e93e51eb49797 [2025-01-09 21:04:54,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:04:54,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:04:54,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:54,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:04:54,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:04:54,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef915b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54, skipping insertion in model container [2025-01-09 21:04:54,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:04:54,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:54,828 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:04:54,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:04:54,887 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:04:54,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54 WrapperNode [2025-01-09 21:04:54,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:04:54,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:54,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:04:54,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:04:54,893 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:04:54" (1/1) ... [2025-01-09 21:04:54,901 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:04:54" (1/1) ... [2025-01-09 21:04:54,917 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2025-01-09 21:04:54,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:04:54,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:04:54,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:04:54,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:04:54,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:04:54,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:04:54,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:04:54,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:04:54,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (1/1) ... [2025-01-09 21:04:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:04:54,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:04:54,982 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:04:54,984 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:04:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:04:55,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:04:55,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:04:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:04:55,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:04:55,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:04:55,005 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:04:55,084 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:04:55,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:04:55,223 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:04:55,224 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:04:55,232 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:04:55,232 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 21:04:55,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:55 BoogieIcfgContainer [2025-01-09 21:04:55,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:04:55,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:04:55,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:04:55,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:04:55,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:04:54" (1/3) ... [2025-01-09 21:04:55,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913de9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:55, skipping insertion in model container [2025-01-09 21:04:55,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:04:54" (2/3) ... [2025-01-09 21:04:55,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7913de9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:04:55, skipping insertion in model container [2025-01-09 21:04:55,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:55" (3/3) ... [2025-01-09 21:04:55,240 INFO L128 eAbstractionObserver]: Analyzing ICFG 17_szymanski.i [2025-01-09 21:04:55,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:04:55,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 17_szymanski.i that has 2 procedures, 182 locations, 1 initial locations, 10 loop locations, and 26 error locations. [2025-01-09 21:04:55,251 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:04:55,296 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:04:55,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 207 transitions, 418 flow [2025-01-09 21:04:55,371 INFO L124 PetriNetUnfolderBase]: 26/206 cut-off events. [2025-01-09 21:04:55,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 206 events. 26/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 531 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2025-01-09 21:04:55,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 207 transitions, 418 flow [2025-01-09 21:04:55,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 206 transitions, 415 flow [2025-01-09 21:04:55,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:04:55,402 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;@d43f6ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:04:55,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 21:04:55,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:04:55,409 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:04:55,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:04:55,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,410 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] [2025-01-09 21:04:55,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:55,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1320014846, now seen corresponding path program 1 times [2025-01-09 21:04:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672096736] [2025-01-09 21:04:55,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:04:55,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:04:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,532 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:04:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672096736] [2025-01-09 21:04:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672096736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058756943] [2025-01-09 21:04:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 207 [2025-01-09 21:04:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 206 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:04:55,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 207 [2025-01-09 21:04:55,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:55,761 INFO L124 PetriNetUnfolderBase]: 134/864 cut-off events. [2025-01-09 21:04:55,761 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:04:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 864 events. 134/864 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4973 event pairs, 41 based on Foata normal form. 78/721 useless extension candidates. Maximal degree in co-relation 1000. Up to 134 conditions per place. [2025-01-09 21:04:55,770 INFO L140 encePairwiseOnDemand]: 183/207 looper letters, 15 selfloop transitions, 9 changer transitions 0/185 dead transitions. [2025-01-09 21:04:55,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 185 transitions, 421 flow [2025-01-09 21:04:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2025-01-09 21:04:55,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194847020933977 [2025-01-09 21:04:55,782 INFO L175 Difference]: Start difference. First operand has 184 places, 206 transitions, 415 flow. Second operand 3 states and 571 transitions. [2025-01-09 21:04:55,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 185 transitions, 421 flow [2025-01-09 21:04:55,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 185 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:04:55,790 INFO L231 Difference]: Finished difference. Result has 170 places, 185 transitions, 426 flow [2025-01-09 21:04:55,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=170, PETRI_TRANSITIONS=185} [2025-01-09 21:04:55,795 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places. [2025-01-09 21:04:55,795 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 185 transitions, 426 flow [2025-01-09 21:04:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:04:55,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:55,795 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:04:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:04:55,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 158847095, now seen corresponding path program 1 times [2025-01-09 21:04:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272081472] [2025-01-09 21:04:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:55,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:04:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:04:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:55,832 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:04:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272081472] [2025-01-09 21:04:55,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272081472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:55,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:55,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059940009] [2025-01-09 21:04:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:55,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:55,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:55,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:55,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 207 [2025-01-09 21:04:55,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 185 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:04:55,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:55,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 207 [2025-01-09 21:04:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,083 INFO L124 PetriNetUnfolderBase]: 420/2444 cut-off events. [2025-01-09 21:04:56,083 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-09 21:04:56,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 2444 events. 420/2444 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19534 event pairs, 12 based on Foata normal form. 0/1866 useless extension candidates. Maximal degree in co-relation 3187. Up to 216 conditions per place. [2025-01-09 21:04:56,096 INFO L140 encePairwiseOnDemand]: 184/207 looper letters, 24 selfloop transitions, 17 changer transitions 0/202 dead transitions. [2025-01-09 21:04:56,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 202 transitions, 542 flow [2025-01-09 21:04:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2025-01-09 21:04:56,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824476650563607 [2025-01-09 21:04:56,099 INFO L175 Difference]: Start difference. First operand has 170 places, 185 transitions, 426 flow. Second operand 3 states and 548 transitions. [2025-01-09 21:04:56,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 202 transitions, 542 flow [2025-01-09 21:04:56,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 202 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:56,105 INFO L231 Difference]: Finished difference. Result has 172 places, 202 transitions, 556 flow [2025-01-09 21:04:56,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=172, PETRI_TRANSITIONS=202} [2025-01-09 21:04:56,106 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2025-01-09 21:04:56,106 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 202 transitions, 556 flow [2025-01-09 21:04:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:04:56,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,106 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] [2025-01-09 21:04:56,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:04:56,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:56,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,107 INFO L85 PathProgramCache]: Analyzing trace with hash 835104160, now seen corresponding path program 1 times [2025-01-09 21:04:56,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081226905] [2025-01-09 21:04:56,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:04:56,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:04:56,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,147 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:04:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081226905] [2025-01-09 21:04:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081226905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649712330] [2025-01-09 21:04:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 207 [2025-01-09 21:04:56,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 202 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:04:56,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 207 [2025-01-09 21:04:56,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,410 INFO L124 PetriNetUnfolderBase]: 513/2744 cut-off events. [2025-01-09 21:04:56,410 INFO L125 PetriNetUnfolderBase]: For 501/566 co-relation queries the response was YES. [2025-01-09 21:04:56,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 2744 events. 513/2744 cut-off events. For 501/566 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 22155 event pairs, 23 based on Foata normal form. 3/2133 useless extension candidates. Maximal degree in co-relation 4120. Up to 399 conditions per place. [2025-01-09 21:04:56,423 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 26 selfloop transitions, 16 changer transitions 0/216 dead transitions. [2025-01-09 21:04:56,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 216 transitions, 704 flow [2025-01-09 21:04:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2025-01-09 21:04:56,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776167471819646 [2025-01-09 21:04:56,425 INFO L175 Difference]: Start difference. First operand has 172 places, 202 transitions, 556 flow. Second operand 3 states and 545 transitions. [2025-01-09 21:04:56,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 216 transitions, 704 flow [2025-01-09 21:04:56,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 216 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:56,434 INFO L231 Difference]: Finished difference. Result has 174 places, 216 transitions, 668 flow [2025-01-09 21:04:56,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=174, PETRI_TRANSITIONS=216} [2025-01-09 21:04:56,435 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2025-01-09 21:04:56,435 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 216 transitions, 668 flow [2025-01-09 21:04:56,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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:04:56,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,436 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] [2025-01-09 21:04:56,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:04:56,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:56,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 614393708, now seen corresponding path program 1 times [2025-01-09 21:04:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759269361] [2025-01-09 21:04:56,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:56,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:56,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,468 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:04:56,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759269361] [2025-01-09 21:04:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759269361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315814148] [2025-01-09 21:04:56,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 207 [2025-01-09 21:04:56,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 216 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:04:56,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 207 [2025-01-09 21:04:56,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:56,735 INFO L124 PetriNetUnfolderBase]: 692/3362 cut-off events. [2025-01-09 21:04:56,735 INFO L125 PetriNetUnfolderBase]: For 629/656 co-relation queries the response was YES. [2025-01-09 21:04:56,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 3362 events. 692/3362 cut-off events. For 629/656 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 28815 event pairs, 74 based on Foata normal form. 3/2585 useless extension candidates. Maximal degree in co-relation 5181. Up to 448 conditions per place. [2025-01-09 21:04:56,753 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 21 selfloop transitions, 9 changer transitions 0/224 dead transitions. [2025-01-09 21:04:56,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 224 transitions, 756 flow [2025-01-09 21:04:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2025-01-09 21:04:56,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856682769726248 [2025-01-09 21:04:56,758 INFO L175 Difference]: Start difference. First operand has 174 places, 216 transitions, 668 flow. Second operand 3 states and 550 transitions. [2025-01-09 21:04:56,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 224 transitions, 756 flow [2025-01-09 21:04:56,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 224 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:56,765 INFO L231 Difference]: Finished difference. Result has 176 places, 224 transitions, 718 flow [2025-01-09 21:04:56,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=176, PETRI_TRANSITIONS=224} [2025-01-09 21:04:56,766 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -8 predicate places. [2025-01-09 21:04:56,766 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 224 transitions, 718 flow [2025-01-09 21:04:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:04:56,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:56,767 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] [2025-01-09 21:04:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:04:56,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2137967015, now seen corresponding path program 1 times [2025-01-09 21:04:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482708865] [2025-01-09 21:04:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:04:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:04:56,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:56,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:04:56,827 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:04:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:04:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482708865] [2025-01-09 21:04:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482708865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:04:56,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:04:56,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:04:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310054419] [2025-01-09 21:04:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:04:56,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:04:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:04:56,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:04:56,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:04:56,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 207 [2025-01-09 21:04:56,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 224 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:04:56,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:04:56,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 207 [2025-01-09 21:04:56,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:04:57,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([365] L708-1-->L708-2: Formula: (= |v_ULTIMATE.start_thr2_#t~nondet11#1_4| |v_#race~flag2~0_25|) InVars {ULTIMATE.start_thr2_#t~nondet11#1=|v_ULTIMATE.start_thr2_#t~nondet11#1_4|} OutVars{#race~flag2~0=|v_#race~flag2~0_25|, ULTIMATE.start_thr2_#t~nondet11#1=|v_ULTIMATE.start_thr2_#t~nondet11#1_4|} AuxVars[] AssignedVars[#race~flag2~0][87], [Black: 195#(= |#race~flag2~0| 0), 165#L708-2true, Black: 200#(= |ULTIMATE.start_thr2_#t~nondet10#1| |#race~flag2~0|), 210#(= |#race~flag1~0| 0), 53#L689-2true, 186#true, 203#true, Black: 205#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 190#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2025-01-09 21:04:57,183 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:04:57,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L690-1-->L690-2: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork0_#t~nondet4#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet4#1=|v_thr1Thread1of1ForFork0_#t~nondet4#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet4#1=|v_thr1Thread1of1ForFork0_#t~nondet4#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][86], [208#true, 147#L707-2true, 205#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), Black: 193#true, Black: 200#(= |ULTIMATE.start_thr2_#t~nondet10#1| |#race~flag2~0|), 186#true, 163#L690-2true, Black: 190#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), Black: 203#true]) [2025-01-09 21:04:57,198 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-01-09 21:04:57,198 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,198 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,198 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 21:04:57,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([558] L692-2-->L692-3: Formula: (= |v_thr1Thread1of1ForFork0_#t~nondet5#1_3| |v_#race~flag1~0_10|) InVars {thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet5#1=|v_thr1Thread1of1ForFork0_#t~nondet5#1_3|, #race~flag1~0=|v_#race~flag1~0_10|} AuxVars[] AssignedVars[#race~flag1~0][142], [177#L692-3true, 208#true, 147#L707-2true, Black: 193#true, Black: 200#(= |ULTIMATE.start_thr2_#t~nondet10#1| |#race~flag2~0|), 186#true, Black: 205#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 203#true, Black: 190#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2025-01-09 21:04:57,231 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:04:57,231 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,231 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,231 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([559] L695-1-->L695-2: Formula: (= |v_thr1Thread1of1ForFork0_#t~nondet6#1_3| |v_#race~flag1~0_13|) InVars {thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} OutVars{#race~flag1~0=|v_#race~flag1~0_13|, thr1Thread1of1ForFork0_#t~nondet6#1=|v_thr1Thread1of1ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~flag1~0][141], [208#true, 147#L707-2true, Black: 193#true, Black: 200#(= |ULTIMATE.start_thr2_#t~nondet10#1| |#race~flag2~0|), 186#true, Black: 205#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 203#true, Black: 190#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 10#L695-2true]) [2025-01-09 21:04:57,232 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:04:57,232 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,232 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,232 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([365] L708-1-->L708-2: Formula: (= |v_ULTIMATE.start_thr2_#t~nondet11#1_4| |v_#race~flag2~0_25|) InVars {ULTIMATE.start_thr2_#t~nondet11#1=|v_ULTIMATE.start_thr2_#t~nondet11#1_4|} OutVars{#race~flag2~0=|v_#race~flag2~0_25|, ULTIMATE.start_thr2_#t~nondet11#1=|v_ULTIMATE.start_thr2_#t~nondet11#1_4|} AuxVars[] AssignedVars[#race~flag2~0][87], [Black: 195#(= |#race~flag2~0| 0), 110#L691-2true, 165#L708-2true, 210#(= |#race~flag1~0| 0), Black: 200#(= |ULTIMATE.start_thr2_#t~nondet10#1| |#race~flag2~0|), 186#true, Black: 205#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet4#1|), 203#true, Black: 190#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|)]) [2025-01-09 21:04:57,240 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-01-09 21:04:57,240 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,240 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,241 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 21:04:57,339 INFO L124 PetriNetUnfolderBase]: 1386/5775 cut-off events. [2025-01-09 21:04:57,339 INFO L125 PetriNetUnfolderBase]: For 2096/2181 co-relation queries the response was YES. [2025-01-09 21:04:57,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10011 conditions, 5775 events. 1386/5775 cut-off events. For 2096/2181 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 53800 event pairs, 37 based on Foata normal form. 12/4566 useless extension candidates. Maximal degree in co-relation 9985. Up to 713 conditions per place. [2025-01-09 21:04:57,364 INFO L140 encePairwiseOnDemand]: 184/207 looper letters, 36 selfloop transitions, 29 changer transitions 0/253 dead transitions. [2025-01-09 21:04:57,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 253 transitions, 984 flow [2025-01-09 21:04:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:04:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:04:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2025-01-09 21:04:57,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8824476650563607 [2025-01-09 21:04:57,366 INFO L175 Difference]: Start difference. First operand has 176 places, 224 transitions, 718 flow. Second operand 3 states and 548 transitions. [2025-01-09 21:04:57,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 253 transitions, 984 flow [2025-01-09 21:04:57,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 253 transitions, 928 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-01-09 21:04:57,374 INFO L231 Difference]: Finished difference. Result has 178 places, 253 transitions, 984 flow [2025-01-09 21:04:57,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=178, PETRI_TRANSITIONS=253} [2025-01-09 21:04:57,375 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -6 predicate places. [2025-01-09 21:04:57,375 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 253 transitions, 984 flow [2025-01-09 21:04:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:04:57,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:04:57,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:04:57,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:04:57,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:04:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1933731254, now seen corresponding path program 1 times [2025-01-09 21:04:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:04:57,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120938863] [2025-01-09 21:04:57,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:04:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:04:57,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:04:57,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:04:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:57,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:04:57,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:04:57,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:04:57,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:04:57,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:04:57,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:04:57,414 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:04:57,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (39 of 40 remaining) [2025-01-09 21:04:57,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-01-09 21:04:57,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-01-09 21:04:57,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-01-09 21:04:57,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-01-09 21:04:57,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-01-09 21:04:57,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-01-09 21:04:57,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-01-09 21:04:57,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 40 remaining) [2025-01-09 21:04:57,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-01-09 21:04:57,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-01-09 21:04:57,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-01-09 21:04:57,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-01-09 21:04:57,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-01-09 21:04:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:04:57,422 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:04:57,446 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:04:57,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:04:57,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:04:57 BasicIcfg [2025-01-09 21:04:57,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:04:57,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:04:57,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:04:57,455 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:04:57,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:04:55" (3/4) ... [2025-01-09 21:04:57,456 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:04:57,513 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-01-09 21:04:57,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:04:57,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:04:57,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:04:57,558 INFO L158 Benchmark]: Toolchain (without parser) took 2956.58ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.8MB in the beginning and 270.6MB in the end (delta: -147.8MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-01-09 21:04:57,559 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:57,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.29ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 102.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:04:57,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.61ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 101.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:57,560 INFO L158 Benchmark]: Boogie Preprocessor took 27.56ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 100.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:57,560 INFO L158 Benchmark]: RCFGBuilder took 286.61ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 82.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:04:57,561 INFO L158 Benchmark]: TraceAbstraction took 2219.93ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 81.8MB in the beginning and 274.4MB in the end (delta: -192.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2025-01-09 21:04:57,561 INFO L158 Benchmark]: Witness Printer took 102.79ms. Allocated memory is still 377.5MB. Free memory was 274.4MB in the beginning and 270.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:04:57,561 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.29ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 102.8MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.61ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 101.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.56ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 100.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 286.61ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 82.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2219.93ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 81.8MB in the beginning and 274.4MB in the end (delta: -192.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 102.79ms. Allocated memory is still 377.5MB. Free memory was 274.4MB in the beginning and 270.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 689]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L685] 0 int x; VAL [flag1=0, flag2=0, x=0] [L724] 0 pthread_t t; VAL [flag1=0, flag2=0, x=0] [L725] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [flag1=0, flag2=0, t=-1, x=0] [L726] CALL 0 thr2(0) [L706] 0 flag2 = 1 VAL [\old(arg)={0:0}, arg={0:0}, flag1=0, flag2=1, x=0] [L688] 1 flag1 = 1 VAL [\old(arg)={0:0}, arg={0:0}, flag1=1, flag2=1, x=0] [L689] 1 flag2 >= 3 VAL [\old(arg)={0:0}, arg={0:0}, flag1=1, flag2=1, x=0] [L706] 0 flag2 = 1 VAL [\old(arg)={0:0}, arg={0:0}, flag1=1, flag2=1, x=0] [L689] 1 flag2 >= 3 VAL [\old(arg)={0:0}, arg={0:0}, flag1=1, flag2=1, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [706] and C: flag2 >= 3 [689] - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: 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, 260 locations, 40 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: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 53 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=984occurred in iteration=5, InterpolantAutomatonStates: 15, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:04:57,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)