./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:46:05,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:46:06,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:46:06,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:46:06,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:46:06,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:46:06,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:46:06,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:46:06,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:46:06,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:46:06,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:46:06,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:46:06,041 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:46:06,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:46:06,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:46:06,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:46:06,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:46:06,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:06,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:46:06,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:46:06,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:46:06,043 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/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 -> 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 [2025-03-14 01:46:06,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:46:06,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:46:06,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:46:06,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:46:06,286 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:46:06,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 01:46:07,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb3b9d1d/0581e9b7206043b6b4cdb2b686c2479c/FLAGdeda5ff28 [2025-03-14 01:46:07,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:46:07,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 01:46:07,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb3b9d1d/0581e9b7206043b6b4cdb2b686c2479c/FLAGdeda5ff28 [2025-03-14 01:46:07,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb3b9d1d/0581e9b7206043b6b4cdb2b686c2479c [2025-03-14 01:46:07,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:46:07,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:46:07,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:07,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:46:07,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:46:07,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a2d94c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07, skipping insertion in model container [2025-03-14 01:46:07,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:46:07,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:07,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:46:07,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:07,954 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:46:07,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07 WrapperNode [2025-03-14 01:46:07,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:07,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:07,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:46:07,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:46:07,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,980 INFO L138 Inliner]: procedures = 23, calls = 21, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 125 [2025-03-14 01:46:07,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:07,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:46:07,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:46:07,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:46:07,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,995 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:07,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:46:08,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:46:08,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:46:08,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:46:08,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (1/1) ... [2025-03-14 01:46:08,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:08,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:46:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:46:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:46:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:46:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:46:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:46:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:46:08,047 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:46:08,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:46:08,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:46:08,415 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:46:08,416 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:46:08,416 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:46:08,448 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:46:08,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:08 BoogieIcfgContainer [2025-03-14 01:46:08,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:46:08,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:46:08,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:46:08,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:46:08,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:46:07" (1/3) ... [2025-03-14 01:46:08,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0cf4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:08, skipping insertion in model container [2025-03-14 01:46:08,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:07" (2/3) ... [2025-03-14 01:46:08,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0cf4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:08, skipping insertion in model container [2025-03-14 01:46:08,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:08" (3/3) ... [2025-03-14 01:46:08,456 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-14 01:46:08,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:46:08,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 228 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-03-14 01:46:08,469 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:46:08,543 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:46:08,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 241 transitions, 503 flow [2025-03-14 01:46:08,646 INFO L124 PetriNetUnfolderBase]: 14/238 cut-off events. [2025-03-14 01:46:08,648 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:46:08,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 238 events. 14/238 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 308 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 191. Up to 3 conditions per place. [2025-03-14 01:46:08,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 241 transitions, 503 flow [2025-03-14 01:46:08,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 221 transitions, 460 flow [2025-03-14 01:46:08,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:46:08,678 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;@3c70198d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:46:08,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-14 01:46:08,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:46:08,687 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:46:08,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:46:08,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:08,689 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] [2025-03-14 01:46:08,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -811326325, now seen corresponding path program 1 times [2025-03-14 01:46:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395294640] [2025-03-14 01:46:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:08,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:46:08,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:46:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395294640] [2025-03-14 01:46:08,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395294640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:08,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:08,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652052794] [2025-03-14 01:46:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:08,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:08,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:08,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:08,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 241 [2025-03-14 01:46:08,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-03-14 01:46:08,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:08,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 241 [2025-03-14 01:46:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,068 INFO L124 PetriNetUnfolderBase]: 201/926 cut-off events. [2025-03-14 01:46:09,068 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-14 01:46:09,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 926 events. 201/926 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5488 event pairs, 132 based on Foata normal form. 4/794 useless extension candidates. Maximal degree in co-relation 1089. Up to 305 conditions per place. [2025-03-14 01:46:09,079 INFO L140 encePairwiseOnDemand]: 231/241 looper letters, 21 selfloop transitions, 2 changer transitions 4/213 dead transitions. [2025-03-14 01:46:09,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 490 flow [2025-03-14 01:46:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-14 01:46:09,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017980636237898 [2025-03-14 01:46:09,100 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 460 flow. Second operand 3 states and 652 transitions. [2025-03-14 01:46:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 490 flow [2025-03-14 01:46:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 213 transitions, 478 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:46:09,108 INFO L231 Difference]: Finished difference. Result has 213 places, 209 transitions, 428 flow [2025-03-14 01:46:09,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=213, PETRI_TRANSITIONS=209} [2025-03-14 01:46:09,113 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -5 predicate places. [2025-03-14 01:46:09,113 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 209 transitions, 428 flow [2025-03-14 01:46:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-03-14 01:46:09,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,114 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-03-14 01:46:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:46:09,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1633625838, now seen corresponding path program 1 times [2025-03-14 01:46:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877395108] [2025-03-14 01:46:09,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:46:09,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:46:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877395108] [2025-03-14 01:46:09,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877395108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:09,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:09,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644596634] [2025-03-14 01:46:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:09,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:09,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 241 [2025-03-14 01:46:09,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 209 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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-03-14 01:46:09,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:09,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 241 [2025-03-14 01:46:09,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,424 INFO L124 PetriNetUnfolderBase]: 391/1353 cut-off events. [2025-03-14 01:46:09,424 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 01:46:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1353 events. 391/1353 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8995 event pairs, 261 based on Foata normal form. 1/1169 useless extension candidates. Maximal degree in co-relation 1911. Up to 554 conditions per place. [2025-03-14 01:46:09,437 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 22 selfloop transitions, 1 changer transitions 2/203 dead transitions. [2025-03-14 01:46:09,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 203 transitions, 464 flow [2025-03-14 01:46:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-03-14 01:46:09,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8755186721991701 [2025-03-14 01:46:09,440 INFO L175 Difference]: Start difference. First operand has 213 places, 209 transitions, 428 flow. Second operand 3 states and 633 transitions. [2025-03-14 01:46:09,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 203 transitions, 464 flow [2025-03-14 01:46:09,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:09,445 INFO L231 Difference]: Finished difference. Result has 203 places, 201 transitions, 410 flow [2025-03-14 01:46:09,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=203, PETRI_TRANSITIONS=201} [2025-03-14 01:46:09,447 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -15 predicate places. [2025-03-14 01:46:09,447 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 201 transitions, 410 flow [2025-03-14 01:46:09,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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-03-14 01:46:09,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,448 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] [2025-03-14 01:46:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:46:09,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1386034105, now seen corresponding path program 1 times [2025-03-14 01:46:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126286845] [2025-03-14 01:46:09,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:46:09,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:46:09,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126286845] [2025-03-14 01:46:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126286845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98692710] [2025-03-14 01:46:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:09,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:09,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:09,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 241 [2025-03-14 01:46:09,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 201 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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-03-14 01:46:09,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 241 [2025-03-14 01:46:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,688 INFO L124 PetriNetUnfolderBase]: 163/887 cut-off events. [2025-03-14 01:46:09,689 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2025-03-14 01:46:09,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 887 events. 163/887 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5101 event pairs, 100 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 1094. Up to 214 conditions per place. [2025-03-14 01:46:09,697 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 17 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-03-14 01:46:09,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 446 flow [2025-03-14 01:46:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2025-03-14 01:46:09,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9031811894882434 [2025-03-14 01:46:09,699 INFO L175 Difference]: Start difference. First operand has 203 places, 201 transitions, 410 flow. Second operand 3 states and 653 transitions. [2025-03-14 01:46:09,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 446 flow [2025-03-14 01:46:09,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 200 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:09,702 INFO L231 Difference]: Finished difference. Result has 201 places, 200 transitions, 411 flow [2025-03-14 01:46:09,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=201, PETRI_TRANSITIONS=200} [2025-03-14 01:46:09,704 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -17 predicate places. [2025-03-14 01:46:09,704 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 200 transitions, 411 flow [2025-03-14 01:46:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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-03-14 01:46:09,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,705 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, 1, 1, 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-03-14 01:46:09,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:46:09,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:09,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1158122848, now seen corresponding path program 1 times [2025-03-14 01:46:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977668475] [2025-03-14 01:46:09,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:46:09,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:46:09,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:09,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:09,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977668475] [2025-03-14 01:46:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977668475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:09,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875941610] [2025-03-14 01:46:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:09,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:09,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:09,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:09,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 241 [2025-03-14 01:46:09,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 200 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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-03-14 01:46:09,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:09,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 241 [2025-03-14 01:46:09,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:09,902 INFO L124 PetriNetUnfolderBase]: 144/717 cut-off events. [2025-03-14 01:46:09,902 INFO L125 PetriNetUnfolderBase]: For 26/27 co-relation queries the response was YES. [2025-03-14 01:46:09,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 717 events. 144/717 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3815 event pairs, 91 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 909. Up to 203 conditions per place. [2025-03-14 01:46:09,907 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 17 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-03-14 01:46:09,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 199 transitions, 447 flow [2025-03-14 01:46:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2025-03-14 01:46:09,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9031811894882434 [2025-03-14 01:46:09,909 INFO L175 Difference]: Start difference. First operand has 201 places, 200 transitions, 411 flow. Second operand 3 states and 653 transitions. [2025-03-14 01:46:09,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 199 transitions, 447 flow [2025-03-14 01:46:09,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 199 transitions, 443 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:09,911 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 409 flow [2025-03-14 01:46:09,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-03-14 01:46:09,915 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -18 predicate places. [2025-03-14 01:46:09,915 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 409 flow [2025-03-14 01:46:09,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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-03-14 01:46:09,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:09,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:46:09,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:46:09,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:09,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1848026761, now seen corresponding path program 1 times [2025-03-14 01:46:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602791729] [2025-03-14 01:46:09,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:09,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:46:09,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:46:09,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:09,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602791729] [2025-03-14 01:46:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602791729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523402527] [2025-03-14 01:46:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:10,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:10,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-03-14 01:46:10,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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-03-14 01:46:10,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:10,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-03-14 01:46:10,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:10,127 INFO L124 PetriNetUnfolderBase]: 232/1200 cut-off events. [2025-03-14 01:46:10,128 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2025-03-14 01:46:10,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1200 events. 232/1200 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 8077 event pairs, 81 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 1504. Up to 165 conditions per place. [2025-03-14 01:46:10,136 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 19 selfloop transitions, 2 changer transitions 2/204 dead transitions. [2025-03-14 01:46:10,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 467 flow [2025-03-14 01:46:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-14 01:46:10,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9183955739972337 [2025-03-14 01:46:10,138 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 409 flow. Second operand 3 states and 664 transitions. [2025-03-14 01:46:10,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 467 flow [2025-03-14 01:46:10,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 204 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:10,143 INFO L231 Difference]: Finished difference. Result has 198 places, 195 transitions, 400 flow [2025-03-14 01:46:10,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=198, PETRI_TRANSITIONS=195} [2025-03-14 01:46:10,144 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -20 predicate places. [2025-03-14 01:46:10,145 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 195 transitions, 400 flow [2025-03-14 01:46:10,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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-03-14 01:46:10,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:10,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:46:10,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:46:10,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:10,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2132239530, now seen corresponding path program 1 times [2025-03-14 01:46:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835849648] [2025-03-14 01:46:10,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:10,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-14 01:46:10,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-14 01:46:10,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:10,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835849648] [2025-03-14 01:46:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835849648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85924265] [2025-03-14 01:46:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:10,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:10,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:10,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-03-14 01:46:10,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-03-14 01:46:10,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:10,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-03-14 01:46:10,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:10,292 INFO L124 PetriNetUnfolderBase]: 243/924 cut-off events. [2025-03-14 01:46:10,293 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 01:46:10,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 924 events. 243/924 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5377 event pairs, 44 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1306. Up to 348 conditions per place. [2025-03-14 01:46:10,297 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 22 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-14 01:46:10,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 201 transitions, 464 flow [2025-03-14 01:46:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-14 01:46:10,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197786998616874 [2025-03-14 01:46:10,299 INFO L175 Difference]: Start difference. First operand has 198 places, 195 transitions, 400 flow. Second operand 3 states and 665 transitions. [2025-03-14 01:46:10,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 201 transitions, 464 flow [2025-03-14 01:46:10,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 201 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:10,302 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 406 flow [2025-03-14 01:46:10,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2025-03-14 01:46:10,304 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -23 predicate places. [2025-03-14 01:46:10,304 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 406 flow [2025-03-14 01:46:10,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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-03-14 01:46:10,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:10,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:46:10,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:46:10,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:10,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1531793707, now seen corresponding path program 1 times [2025-03-14 01:46:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86180119] [2025-03-14 01:46:10,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:10,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:46:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:46:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86180119] [2025-03-14 01:46:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86180119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241760166] [2025-03-14 01:46:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:10,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:10,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:10,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:10,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-03-14 01:46:10,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-03-14 01:46:10,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:10,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-03-14 01:46:10,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:10,484 INFO L124 PetriNetUnfolderBase]: 331/1162 cut-off events. [2025-03-14 01:46:10,484 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-14 01:46:10,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 1162 events. 331/1162 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7347 event pairs, 90 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1644. Up to 443 conditions per place. [2025-03-14 01:46:10,490 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 20 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-03-14 01:46:10,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 199 transitions, 461 flow [2025-03-14 01:46:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-03-14 01:46:10,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91701244813278 [2025-03-14 01:46:10,492 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 406 flow. Second operand 3 states and 663 transitions. [2025-03-14 01:46:10,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 199 transitions, 461 flow [2025-03-14 01:46:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 199 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:10,495 INFO L231 Difference]: Finished difference. Result has 196 places, 195 transitions, 416 flow [2025-03-14 01:46:10,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=196, PETRI_TRANSITIONS=195} [2025-03-14 01:46:10,497 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -22 predicate places. [2025-03-14 01:46:10,497 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 195 transitions, 416 flow [2025-03-14 01:46:10,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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-03-14 01:46:10,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:10,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:46:10,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:46:10,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:46:10,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 967072318, now seen corresponding path program 1 times [2025-03-14 01:46:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877173548] [2025-03-14 01:46:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:10,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:46:10,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:46:10,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:10,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877173548] [2025-03-14 01:46:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877173548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:10,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135858112] [2025-03-14 01:46:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:10,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:10,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:10,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:10,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 241 [2025-03-14 01:46:10,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 195 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-03-14 01:46:10,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:10,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 241 [2025-03-14 01:46:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:10,722 INFO L124 PetriNetUnfolderBase]: 401/1718 cut-off events. [2025-03-14 01:46:10,722 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-14 01:46:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1718 events. 401/1718 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12553 event pairs, 166 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2356. Up to 379 conditions per place. [2025-03-14 01:46:10,730 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 0 selfloop transitions, 0 changer transitions 201/201 dead transitions. [2025-03-14 01:46:10,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 201 transitions, 476 flow [2025-03-14 01:46:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-03-14 01:46:10,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91701244813278 [2025-03-14 01:46:10,732 INFO L175 Difference]: Start difference. First operand has 196 places, 195 transitions, 416 flow. Second operand 3 states and 663 transitions. [2025-03-14 01:46:10,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 201 transitions, 476 flow [2025-03-14 01:46:10,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 201 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:10,734 INFO L231 Difference]: Finished difference. Result has 197 places, 0 transitions, 0 flow [2025-03-14 01:46:10,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=197, PETRI_TRANSITIONS=0} [2025-03-14 01:46:10,738 INFO L279 CegarLoopForPetriNet]: 218 programPoint places, -21 predicate places. [2025-03-14 01:46:10,738 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 0 transitions, 0 flow [2025-03-14 01:46:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-03-14 01:46:10,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2025-03-14 01:46:10,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-03-14 01:46:10,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-03-14 01:46:10,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-03-14 01:46:10,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2025-03-14 01:46:10,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-03-14 01:46:10,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-03-14 01:46:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:46:10,744 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:10,748 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:46:10,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:46:10,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:46:10 BasicIcfg [2025-03-14 01:46:10,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:46:10,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:46:10,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:46:10,752 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:46:10,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:08" (3/4) ... [2025-03-14 01:46:10,754 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:46:10,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:46:10,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:46:10,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:46:10,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-14 01:46:10,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:46:10,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:46:10,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:46:10,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:46:10,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:46:10,819 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:46:10,820 INFO L158 Benchmark]: Toolchain (without parser) took 3071.13ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.1MB in the beginning and 229.0MB in the end (delta: -122.9MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.67ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.17ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: Boogie Preprocessor took 18.19ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.6MB in the end (delta: 943.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: IcfgBuilder took 448.78ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 68.8MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,820 INFO L158 Benchmark]: TraceAbstraction took 2300.98ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 68.2MB in the beginning and 234.5MB in the end (delta: -166.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,821 INFO L158 Benchmark]: Witness Printer took 66.90ms. Allocated memory is still 318.8MB. Free memory was 234.5MB in the beginning and 229.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:46:10,822 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.67ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 93.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.17ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.19ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.6MB in the end (delta: 943.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 448.78ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 68.8MB in the end (delta: 21.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2300.98ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 68.2MB in the beginning and 234.5MB in the end (delta: -166.3MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 66.90ms. Allocated memory is still 318.8MB. Free memory was 234.5MB in the beginning and 229.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 300 locations, 28 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.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 68 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=0, InterpolantAutomatonStates: 24, 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.4s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:46:10,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: TRUE