./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.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/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:10,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:10,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:10,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:10,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:10,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:10,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:10,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:10,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:10,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:10,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:10,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:10,115 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:10,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:10,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:10,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:10,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:10,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:10,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:10,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:10,116 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-03-14 01:42:10,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:10,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:10,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:10,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:10,330 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:10,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-14 01:42:11,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919cf8ac/6fab594d9e024293b0d41a8fb3f1735b/FLAG4a60e1af7 [2025-03-14 01:42:11,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:11,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-14 01:42:11,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919cf8ac/6fab594d9e024293b0d41a8fb3f1735b/FLAG4a60e1af7 [2025-03-14 01:42:11,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f919cf8ac/6fab594d9e024293b0d41a8fb3f1735b [2025-03-14 01:42:11,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:11,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:11,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:11,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:11,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:11,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:11" (1/1) ... [2025-03-14 01:42:11,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591c1caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:11, skipping insertion in model container [2025-03-14 01:42:11,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:11" (1/1) ... [2025-03-14 01:42:11,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:12,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:12,052 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:12,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:12,088 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:12,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12 WrapperNode [2025-03-14 01:42:12,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:12,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:12,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:12,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:12,095 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:42:12" (1/1) ... [2025-03-14 01:42:12,100 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:42:12" (1/1) ... [2025-03-14 01:42:12,117 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 213 [2025-03-14 01:42:12,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:12,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:12,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:12,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:12,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,132 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:12,138 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:12,138 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:12,138 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:12,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (1/1) ... [2025-03-14 01:42:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:12,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:12,175 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:42:12,179 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:42:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:12,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:12,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:42:12,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:42:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:42:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:42:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-14 01:42:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-14 01:42:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-14 01:42:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-14 01:42:12,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:12,199 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:42:12,282 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:12,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:12,715 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:12,716 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:12,716 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:12,738 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:12,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:12 BoogieIcfgContainer [2025-03-14 01:42:12,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:12,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:12,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:12,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:12,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:11" (1/3) ... [2025-03-14 01:42:12,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765993f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:12, skipping insertion in model container [2025-03-14 01:42:12,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:12" (2/3) ... [2025-03-14 01:42:12,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765993f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:12, skipping insertion in model container [2025-03-14 01:42:12,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:12" (3/3) ... [2025-03-14 01:42:12,747 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-03-14 01:42:12,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:12,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 392 locations, 1 initial locations, 6 loop locations, and 61 error locations. [2025-03-14 01:42:12,760 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:12,871 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-14 01:42:12,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 410 places, 415 transitions, 872 flow [2025-03-14 01:42:13,032 INFO L124 PetriNetUnfolderBase]: 24/409 cut-off events. [2025-03-14 01:42:13,034 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:42:13,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 409 events. 24/409 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 851 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2025-03-14 01:42:13,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 415 transitions, 872 flow [2025-03-14 01:42:13,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 382 transitions, 800 flow [2025-03-14 01:42:13,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:13,072 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;@2742a384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:13,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2025-03-14 01:42:13,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:13,081 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-14 01:42:13,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:13,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:13,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2002030325, now seen corresponding path program 1 times [2025-03-14 01:42:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683821032] [2025-03-14 01:42:13,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:42:13,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:42:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,255 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:42:13,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683821032] [2025-03-14 01:42:13,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683821032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785072966] [2025-03-14 01:42:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:13,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:13,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:13,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:13,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:13,477 INFO L124 PetriNetUnfolderBase]: 40/509 cut-off events. [2025-03-14 01:42:13,477 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:42:13,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 509 events. 40/509 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1843 event pairs, 20 based on Foata normal form. 91/490 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2025-03-14 01:42:13,487 INFO L140 encePairwiseOnDemand]: 405/415 looper letters, 22 selfloop transitions, 2 changer transitions 1/374 dead transitions. [2025-03-14 01:42:13,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 374 transitions, 832 flow [2025-03-14 01:42:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:13,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:13,508 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 800 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:13,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 374 transitions, 832 flow [2025-03-14 01:42:13,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 808 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-14 01:42:13,523 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 762 flow [2025-03-14 01:42:13,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2025-03-14 01:42:13,528 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -11 predicate places. [2025-03-14 01:42:13,528 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 762 flow [2025-03-14 01:42:13,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:13,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:13,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:13,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1769995577, now seen corresponding path program 1 times [2025-03-14 01:42:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248330743] [2025-03-14 01:42:13,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:42:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:42:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,596 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:42:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248330743] [2025-03-14 01:42:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248330743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521378015] [2025-03-14 01:42:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:13,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:13,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:13,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:13,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:13,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:13,788 INFO L124 PetriNetUnfolderBase]: 40/507 cut-off events. [2025-03-14 01:42:13,788 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:42:13,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 507 events. 40/507 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1771 event pairs, 20 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2025-03-14 01:42:13,795 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-14 01:42:13,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 808 flow [2025-03-14 01:42:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:13,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:13,799 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 762 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 808 flow [2025-03-14 01:42:13,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:13,807 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 760 flow [2025-03-14 01:42:13,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-03-14 01:42:13,808 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -13 predicate places. [2025-03-14 01:42:13,809 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 760 flow [2025-03-14 01:42:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:13,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:13,810 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] [2025-03-14 01:42:13,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:13,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2038313335, now seen corresponding path program 1 times [2025-03-14 01:42:13,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:13,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260566283] [2025-03-14 01:42:13,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:13,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:42:13,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:42:13,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:13,876 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:42:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260566283] [2025-03-14 01:42:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260566283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:13,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383556639] [2025-03-14 01:42:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:13,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:13,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:13,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:13,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:13,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:13,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:13,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,037 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2025-03-14 01:42:14,037 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 488 events. 40/488 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1622 event pairs, 20 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 539. Up to 68 conditions per place. [2025-03-14 01:42:14,043 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-03-14 01:42:14,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 371 transitions, 806 flow [2025-03-14 01:42:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:14,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:14,048 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 760 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:14,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 371 transitions, 806 flow [2025-03-14 01:42:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,056 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 758 flow [2025-03-14 01:42:14,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-03-14 01:42:14,057 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -14 predicate places. [2025-03-14 01:42:14,057 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 758 flow [2025-03-14 01:42:14,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:14,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:14,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash -451948295, now seen corresponding path program 1 times [2025-03-14 01:42:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37107914] [2025-03-14 01:42:14,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:42:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:42:14,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,117 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:42:14,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37107914] [2025-03-14 01:42:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37107914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817222215] [2025-03-14 01:42:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:14,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:14,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,263 INFO L124 PetriNetUnfolderBase]: 40/469 cut-off events. [2025-03-14 01:42:14,263 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:14,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 469 events. 40/469 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1413 event pairs, 20 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 509. Up to 68 conditions per place. [2025-03-14 01:42:14,270 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-14 01:42:14,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 370 transitions, 804 flow [2025-03-14 01:42:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:14,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:14,274 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 758 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:14,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 370 transitions, 804 flow [2025-03-14 01:42:14,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 370 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,280 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 756 flow [2025-03-14 01:42:14,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-03-14 01:42:14,281 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -15 predicate places. [2025-03-14 01:42:14,281 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 756 flow [2025-03-14 01:42:14,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,285 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] [2025-03-14 01:42:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:14,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1921284778, now seen corresponding path program 1 times [2025-03-14 01:42:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871543187] [2025-03-14 01:42:14,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:42:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:42:14,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,328 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:42:14,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871543187] [2025-03-14 01:42:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871543187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829003384] [2025-03-14 01:42:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:14,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:14,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,466 INFO L124 PetriNetUnfolderBase]: 40/450 cut-off events. [2025-03-14 01:42:14,466 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:14,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 450 events. 40/450 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1225 event pairs, 20 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 479. Up to 68 conditions per place. [2025-03-14 01:42:14,471 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-03-14 01:42:14,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 369 transitions, 802 flow [2025-03-14 01:42:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:14,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:14,474 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 756 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:14,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 369 transitions, 802 flow [2025-03-14 01:42:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 369 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,478 INFO L231 Difference]: Finished difference. Result has 363 places, 369 transitions, 754 flow [2025-03-14 01:42:14,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=363, PETRI_TRANSITIONS=369} [2025-03-14 01:42:14,479 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -16 predicate places. [2025-03-14 01:42:14,479 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 369 transitions, 754 flow [2025-03-14 01:42:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,480 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] [2025-03-14 01:42:14,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:14,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -586448743, now seen corresponding path program 1 times [2025-03-14 01:42:14,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592563411] [2025-03-14 01:42:14,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:42:14,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:42:14,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,531 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:42:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592563411] [2025-03-14 01:42:14,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592563411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550010361] [2025-03-14 01:42:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 415 [2025-03-14 01:42:14,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 369 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 415 [2025-03-14 01:42:14,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:14,661 INFO L124 PetriNetUnfolderBase]: 40/431 cut-off events. [2025-03-14 01:42:14,661 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:42:14,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 431 events. 40/431 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1076 event pairs, 20 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 449. Up to 68 conditions per place. [2025-03-14 01:42:14,669 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 22 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-03-14 01:42:14,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 368 transitions, 800 flow [2025-03-14 01:42:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:14,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:14,672 INFO L175 Difference]: Start difference. First operand has 363 places, 369 transitions, 754 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:14,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 368 transitions, 800 flow [2025-03-14 01:42:14,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 368 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:14,679 INFO L231 Difference]: Finished difference. Result has 362 places, 368 transitions, 752 flow [2025-03-14 01:42:14,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=362, PETRI_TRANSITIONS=368} [2025-03-14 01:42:14,681 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -17 predicate places. [2025-03-14 01:42:14,681 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 368 transitions, 752 flow [2025-03-14 01:42:14,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 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:42:14,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:14,682 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] [2025-03-14 01:42:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:14,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1989434589, now seen corresponding path program 1 times [2025-03-14 01:42:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997672640] [2025-03-14 01:42:14,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:42:14,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:42:14,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:14,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:14,718 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:42:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997672640] [2025-03-14 01:42:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997672640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:14,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:14,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899437558] [2025-03-14 01:42:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:14,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:14,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:14,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 415 [2025-03-14 01:42:14,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 368 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:42:14,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:14,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 415 [2025-03-14 01:42:14,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,347 INFO L124 PetriNetUnfolderBase]: 758/4767 cut-off events. [2025-03-14 01:42:15,347 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-14 01:42:15,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4767 events. 758/4767 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46261 event pairs, 387 based on Foata normal form. 0/3500 useless extension candidates. Maximal degree in co-relation 5709. Up to 942 conditions per place. [2025-03-14 01:42:15,406 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 27 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2025-03-14 01:42:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 367 transitions, 808 flow [2025-03-14 01:42:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2025-03-14 01:42:15,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927710843373494 [2025-03-14 01:42:15,409 INFO L175 Difference]: Start difference. First operand has 362 places, 368 transitions, 752 flow. Second operand 3 states and 1155 transitions. [2025-03-14 01:42:15,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 367 transitions, 808 flow [2025-03-14 01:42:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 367 transitions, 804 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:15,415 INFO L231 Difference]: Finished difference. Result has 361 places, 367 transitions, 750 flow [2025-03-14 01:42:15,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=361, PETRI_TRANSITIONS=367} [2025-03-14 01:42:15,416 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -18 predicate places. [2025-03-14 01:42:15,416 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 367 transitions, 750 flow [2025-03-14 01:42:15,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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:42:15,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,416 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] [2025-03-14 01:42:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:15,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 713904940, now seen corresponding path program 1 times [2025-03-14 01:42:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394646560] [2025-03-14 01:42:15,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-14 01:42:15,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 01:42:15,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,487 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:42:15,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394646560] [2025-03-14 01:42:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394646560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411023383] [2025-03-14 01:42:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:15,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 367 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:15,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,578 INFO L124 PetriNetUnfolderBase]: 55/497 cut-off events. [2025-03-14 01:42:15,579 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:42:15,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 497 events. 55/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1880 event pairs, 30 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 569. Up to 90 conditions per place. [2025-03-14 01:42:15,584 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/367 dead transitions. [2025-03-14 01:42:15,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 819 flow [2025-03-14 01:42:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-03-14 01:42:15,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-03-14 01:42:15,587 INFO L175 Difference]: Start difference. First operand has 361 places, 367 transitions, 750 flow. Second operand 3 states and 1160 transitions. [2025-03-14 01:42:15,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 819 flow [2025-03-14 01:42:15,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:15,594 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 747 flow [2025-03-14 01:42:15,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=747, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2025-03-14 01:42:15,596 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -23 predicate places. [2025-03-14 01:42:15,596 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 747 flow [2025-03-14 01:42:15,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,597 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] [2025-03-14 01:42:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:15,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:15,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1132106152, now seen corresponding path program 1 times [2025-03-14 01:42:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140098960] [2025-03-14 01:42:15,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-14 01:42:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-14 01:42:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,632 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:42:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140098960] [2025-03-14 01:42:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140098960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10111642] [2025-03-14 01:42:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:15,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:15,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,733 INFO L124 PetriNetUnfolderBase]: 55/492 cut-off events. [2025-03-14 01:42:15,734 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:42:15,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 492 events. 55/492 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1799 event pairs, 30 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 552. Up to 90 conditions per place. [2025-03-14 01:42:15,738 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 29 selfloop transitions, 3 changer transitions 0/362 dead transitions. [2025-03-14 01:42:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 362 transitions, 816 flow [2025-03-14 01:42:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2025-03-14 01:42:15,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317269076305221 [2025-03-14 01:42:15,740 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 747 flow. Second operand 3 states and 1160 transitions. [2025-03-14 01:42:15,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 362 transitions, 816 flow [2025-03-14 01:42:15,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 362 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:15,744 INFO L231 Difference]: Finished difference. Result has 352 places, 357 transitions, 745 flow [2025-03-14 01:42:15,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=352, PETRI_TRANSITIONS=357} [2025-03-14 01:42:15,746 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -27 predicate places. [2025-03-14 01:42:15,746 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 357 transitions, 745 flow [2025-03-14 01:42:15,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,747 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] [2025-03-14 01:42:15,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:15,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:15,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 104110205, now seen corresponding path program 1 times [2025-03-14 01:42:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205063934] [2025-03-14 01:42:15,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:42:15,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:42:15,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,800 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:42:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205063934] [2025-03-14 01:42:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205063934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606802648] [2025-03-14 01:42:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:15,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 357 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:15,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:15,905 INFO L124 PetriNetUnfolderBase]: 66/657 cut-off events. [2025-03-14 01:42:15,906 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:42:15,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 657 events. 66/657 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2909 event pairs, 5 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 729. Up to 95 conditions per place. [2025-03-14 01:42:15,913 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 32 selfloop transitions, 3 changer transitions 0/360 dead transitions. [2025-03-14 01:42:15,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 360 transitions, 829 flow [2025-03-14 01:42:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-14 01:42:15,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934136546184739 [2025-03-14 01:42:15,915 INFO L175 Difference]: Start difference. First operand has 352 places, 357 transitions, 745 flow. Second operand 3 states and 1163 transitions. [2025-03-14 01:42:15,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 360 transitions, 829 flow [2025-03-14 01:42:15,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 360 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:15,919 INFO L231 Difference]: Finished difference. Result has 348 places, 352 transitions, 743 flow [2025-03-14 01:42:15,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=348, PETRI_TRANSITIONS=352} [2025-03-14 01:42:15,920 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -31 predicate places. [2025-03-14 01:42:15,920 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 352 transitions, 743 flow [2025-03-14 01:42:15,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:15,921 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] [2025-03-14 01:42:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:15,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1267585298, now seen corresponding path program 1 times [2025-03-14 01:42:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047463562] [2025-03-14 01:42:15,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:15,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:42:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:42:15,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:15,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:15,963 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:42:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047463562] [2025-03-14 01:42:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047463562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:15,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:15,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86744186] [2025-03-14 01:42:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:15,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:15,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:15,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:15,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:15,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:15,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 352 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:15,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:15,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:15,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:16,098 INFO L124 PetriNetUnfolderBase]: 105/1026 cut-off events. [2025-03-14 01:42:16,098 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:42:16,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1026 events. 105/1026 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5802 event pairs, 40 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 896. Up to 154 conditions per place. [2025-03-14 01:42:16,109 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 34 selfloop transitions, 3 changer transitions 0/357 dead transitions. [2025-03-14 01:42:16,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 357 transitions, 837 flow [2025-03-14 01:42:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:16,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:16,112 INFO L175 Difference]: Start difference. First operand has 348 places, 352 transitions, 743 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:16,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 357 transitions, 837 flow [2025-03-14 01:42:16,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 357 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:16,115 INFO L231 Difference]: Finished difference. Result has 344 places, 347 transitions, 741 flow [2025-03-14 01:42:16,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=344, PETRI_TRANSITIONS=347} [2025-03-14 01:42:16,116 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -35 predicate places. [2025-03-14 01:42:16,117 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 347 transitions, 741 flow [2025-03-14 01:42:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:16,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:16,117 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] [2025-03-14 01:42:16,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:16,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:16,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1265673336, now seen corresponding path program 1 times [2025-03-14 01:42:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600696851] [2025-03-14 01:42:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:16,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:42:16,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:42:16,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:16,138 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:42:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600696851] [2025-03-14 01:42:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600696851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572663414] [2025-03-14 01:42:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:16,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:16,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:16,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:16,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 347 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:16,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:16,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:16,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:16,325 INFO L124 PetriNetUnfolderBase]: 199/1421 cut-off events. [2025-03-14 01:42:16,325 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-14 01:42:16,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1421 events. 199/1421 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9644 event pairs, 98 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1436. Up to 302 conditions per place. [2025-03-14 01:42:16,343 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 0/351 dead transitions. [2025-03-14 01:42:16,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 351 transitions, 830 flow [2025-03-14 01:42:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2025-03-14 01:42:16,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349397590361446 [2025-03-14 01:42:16,345 INFO L175 Difference]: Start difference. First operand has 344 places, 347 transitions, 741 flow. Second operand 3 states and 1164 transitions. [2025-03-14 01:42:16,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 351 transitions, 830 flow [2025-03-14 01:42:16,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:16,350 INFO L231 Difference]: Finished difference. Result has 340 places, 342 transitions, 739 flow [2025-03-14 01:42:16,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=340, PETRI_TRANSITIONS=342} [2025-03-14 01:42:16,351 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -39 predicate places. [2025-03-14 01:42:16,351 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 342 transitions, 739 flow [2025-03-14 01:42:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:16,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:16,351 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] [2025-03-14 01:42:16,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:16,351 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1621220618, now seen corresponding path program 1 times [2025-03-14 01:42:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138969369] [2025-03-14 01:42:16,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:16,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-14 01:42:16,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-14 01:42:16,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:16,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:16,385 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:42:16,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:16,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138969369] [2025-03-14 01:42:16,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138969369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:16,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510916279] [2025-03-14 01:42:16,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:16,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:16,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:16,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:16,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 415 [2025-03-14 01:42:16,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 342 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:16,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:16,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 415 [2025-03-14 01:42:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:16,574 INFO L124 PetriNetUnfolderBase]: 175/1141 cut-off events. [2025-03-14 01:42:16,574 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-14 01:42:16,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 1141 events. 175/1141 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6543 event pairs, 82 based on Foata normal form. 1/1044 useless extension candidates. Maximal degree in co-relation 912. Up to 269 conditions per place. [2025-03-14 01:42:16,584 INFO L140 encePairwiseOnDemand]: 406/415 looper letters, 33 selfloop transitions, 3 changer transitions 8/348 dead transitions. [2025-03-14 01:42:16,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 348 transitions, 836 flow [2025-03-14 01:42:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2025-03-14 01:42:16,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9357429718875502 [2025-03-14 01:42:16,587 INFO L175 Difference]: Start difference. First operand has 340 places, 342 transitions, 739 flow. Second operand 3 states and 1165 transitions. [2025-03-14 01:42:16,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 348 transitions, 836 flow [2025-03-14 01:42:16,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 348 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:16,591 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 721 flow [2025-03-14 01:42:16,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2025-03-14 01:42:16,592 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -43 predicate places. [2025-03-14 01:42:16,592 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 721 flow [2025-03-14 01:42:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 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:42:16,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:16,593 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] [2025-03-14 01:42:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:42:16,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:16,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash -237916019, now seen corresponding path program 1 times [2025-03-14 01:42:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056639245] [2025-03-14 01:42:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:16,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:42:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:42:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:16,630 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:42:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056639245] [2025-03-14 01:42:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056639245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:16,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119438871] [2025-03-14 01:42:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:16,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:16,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:16,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 415 [2025-03-14 01:42:16,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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:42:16,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:16,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 415 [2025-03-14 01:42:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:22,870 INFO L124 PetriNetUnfolderBase]: 17906/60994 cut-off events. [2025-03-14 01:42:22,870 INFO L125 PetriNetUnfolderBase]: For 1608/1608 co-relation queries the response was YES. [2025-03-14 01:42:23,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89458 conditions, 60994 events. 17906/60994 cut-off events. For 1608/1608 co-relation queries the response was YES. Maximal size of possible extension queue 2231. Compared 865652 event pairs, 8762 based on Foata normal form. 1/52738 useless extension candidates. Maximal degree in co-relation 34103. Up to 21614 conditions per place. [2025-03-14 01:42:23,750 INFO L140 encePairwiseOnDemand]: 397/415 looper letters, 29 selfloop transitions, 6 changer transitions 58/328 dead transitions. [2025-03-14 01:42:23,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 818 flow [2025-03-14 01:42:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-03-14 01:42:23,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076305220883534 [2025-03-14 01:42:23,754 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2025-03-14 01:42:23,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 818 flow [2025-03-14 01:42:23,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 328 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:23,904 INFO L231 Difference]: Finished difference. Result has 319 places, 265 transitions, 619 flow [2025-03-14 01:42:23,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=319, PETRI_TRANSITIONS=265} [2025-03-14 01:42:23,906 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -60 predicate places. [2025-03-14 01:42:23,906 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 265 transitions, 619 flow [2025-03-14 01:42:23,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 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:42:23,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:23,907 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:42:23,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:42:23,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1615565994, now seen corresponding path program 1 times [2025-03-14 01:42:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:23,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780360925] [2025-03-14 01:42:23,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:23,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:42:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:42:23,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:23,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780360925] [2025-03-14 01:42:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780360925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:23,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926825616] [2025-03-14 01:42:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:23,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:23,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:23,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 265 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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:42:23,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:23,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:23,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:24,941 INFO L124 PetriNetUnfolderBase]: 1604/7454 cut-off events. [2025-03-14 01:42:24,941 INFO L125 PetriNetUnfolderBase]: For 33/49 co-relation queries the response was YES. [2025-03-14 01:42:24,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10493 conditions, 7454 events. 1604/7454 cut-off events. For 33/49 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81517 event pairs, 362 based on Foata normal form. 0/6272 useless extension candidates. Maximal degree in co-relation 5435. Up to 1748 conditions per place. [2025-03-14 01:42:25,013 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-03-14 01:42:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 269 transitions, 684 flow [2025-03-14 01:42:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:25,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:25,017 INFO L175 Difference]: Start difference. First operand has 319 places, 265 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:25,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 269 transitions, 684 flow [2025-03-14 01:42:25,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 269 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:25,024 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 621 flow [2025-03-14 01:42:25,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2025-03-14 01:42:25,025 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -111 predicate places. [2025-03-14 01:42:25,026 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 621 flow [2025-03-14 01:42:25,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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:42:25,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:25,026 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:42:25,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:42:25,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1018735590, now seen corresponding path program 1 times [2025-03-14 01:42:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398048573] [2025-03-14 01:42:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:42:25,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:42:25,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:25,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:25,061 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:42:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398048573] [2025-03-14 01:42:25,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398048573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:25,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:25,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:25,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102965828] [2025-03-14 01:42:25,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:25,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:25,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:25,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:25,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:42:25,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:25,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:25,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:26,484 INFO L124 PetriNetUnfolderBase]: 3074/12904 cut-off events. [2025-03-14 01:42:26,484 INFO L125 PetriNetUnfolderBase]: For 257/273 co-relation queries the response was YES. [2025-03-14 01:42:26,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19339 conditions, 12904 events. 3074/12904 cut-off events. For 257/273 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 155165 event pairs, 939 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 18739. Up to 2739 conditions per place. [2025-03-14 01:42:26,642 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-14 01:42:26,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 268 transitions, 686 flow [2025-03-14 01:42:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:26,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:26,644 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 621 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:26,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 268 transitions, 686 flow [2025-03-14 01:42:26,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 268 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:26,651 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 619 flow [2025-03-14 01:42:26,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2025-03-14 01:42:26,652 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -112 predicate places. [2025-03-14 01:42:26,652 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 619 flow [2025-03-14 01:42:26,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:42:26,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:26,653 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, 1, 1, 1, 1, 1] [2025-03-14 01:42:26,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:26,653 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:26,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:26,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1075491917, now seen corresponding path program 1 times [2025-03-14 01:42:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043125001] [2025-03-14 01:42:26,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:42:26,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:42:26,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:26,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:26,688 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:42:26,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043125001] [2025-03-14 01:42:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043125001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:26,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:26,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804277341] [2025-03-14 01:42:26,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:26,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:26,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:26,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:26,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:26,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:26,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:42:26,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:26,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:26,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:27,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, 465#true, 454#true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-03-14 01:42:27,219 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,219 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,219 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:42:27,219 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-14 01:42:27,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,220 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,220 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,220 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:42:27,220 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-14 01:42:27,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, 348#thread1ENTRYtrue, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2025-03-14 01:42:27,225 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,225 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:42:27,225 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-14 01:42:27,225 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2025-03-14 01:42:27,360 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,360 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-14 01:42:27,360 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,360 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:42:27,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 286#L107-1true, 465#true, 454#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,361 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-03-14 01:42:27,361 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-14 01:42:27,361 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:42:27,361 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-14 01:42:27,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, 286#L107-1true, Black: 454#true, 465#true, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,388 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,389 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-14 01:42:27,389 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, 348#thread1ENTRYtrue, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,393 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,393 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,393 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,393 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-14 01:42:27,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 465#true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,443 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 465#true, 454#true, 87#thread5ENTRYtrue, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-03-14 01:42:27,443 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-14 01:42:27,443 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:42:27,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 446#true]) [2025-03-14 01:42:27,444 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,444 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,444 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,444 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2025-03-14 01:42:27,448 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,448 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:42:27,448 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,448 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-03-14 01:42:27,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,540 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-14 01:42:27,540 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-14 01:42:27,540 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,540 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-14 01:42:27,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 286#L107-1true, 465#true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,541 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-14 01:42:27,541 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-14 01:42:27,541 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,541 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-14 01:42:27,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,563 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,563 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,563 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,563 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,591 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 465#true, 454#true, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2025-03-14 01:42:27,591 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:27,591 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true, 446#true]) [2025-03-14 01:42:27,592 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,592 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,592 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,592 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,620 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,620 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,620 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,620 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,620 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,621 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,621 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 348#thread1ENTRYtrue, Black: 458#true, 363#L108-1true, 87#thread5ENTRYtrue, 460#(= |#race~n~0| 0), Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,623 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-14 01:42:27,623 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-14 01:42:27,623 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-14 01:42:27,623 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-14 01:42:27,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:27,694 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,694 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,694 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,694 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 348#thread1ENTRYtrue, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,696 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,696 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:27,696 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:27,696 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, Black: 458#true, 87#thread5ENTRYtrue, 363#L108-1true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,736 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,736 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,736 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, 87#thread5ENTRYtrue, Black: 458#true, 460#(= |#race~n~0| 0), 185#L41-2true, Black: 434#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,737 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-03-14 01:42:27,737 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:27,737 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:27,737 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:27,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L57-4-->L57-2: Formula: (= |v_#race~n~0_8| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_8|} AuxVars[] AssignedVars[#race~n~0][153], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 465#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:27,787 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-14 01:42:27,787 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:27,787 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-14 01:42:27,787 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-14 01:42:27,899 INFO L124 PetriNetUnfolderBase]: 2742/11065 cut-off events. [2025-03-14 01:42:27,899 INFO L125 PetriNetUnfolderBase]: For 467/483 co-relation queries the response was YES. [2025-03-14 01:42:27,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16991 conditions, 11065 events. 2742/11065 cut-off events. For 467/483 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 129568 event pairs, 823 based on Foata normal form. 0/9761 useless extension candidates. Maximal degree in co-relation 15815. Up to 2363 conditions per place. [2025-03-14 01:42:28,048 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-03-14 01:42:28,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 684 flow [2025-03-14 01:42:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:28,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:28,050 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 619 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 684 flow [2025-03-14 01:42:28,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 267 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:28,058 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 617 flow [2025-03-14 01:42:28,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2025-03-14 01:42:28,059 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -113 predicate places. [2025-03-14 01:42:28,059 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 617 flow [2025-03-14 01:42:28,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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:42:28,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:28,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:28,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:42:28,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:28,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1828664474, now seen corresponding path program 1 times [2025-03-14 01:42:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:28,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576255331] [2025-03-14 01:42:28,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:28,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-14 01:42:28,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:42:28,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:28,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:28,096 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:42:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576255331] [2025-03-14 01:42:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576255331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533819746] [2025-03-14 01:42:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:28,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:28,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:28,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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:42:28,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:28,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:28,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true]) [2025-03-14 01:42:28,985 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2025-03-14 01:42:28,985 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:28,985 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, 44#thread6ENTRYtrue, Black: 450#true, 145#L57-2true, 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:29,111 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 145#L57-2true, Black: 454#true, 173#L81-2true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:29,111 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-14 01:42:29,111 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-14 01:42:29,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, 157#thread2ENTRYtrue, Black: 454#true, 363#L108-1true, Black: 458#true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, Black: 438#true, 335#L65-2true, 468#true, Black: 442#true]) [2025-03-14 01:42:29,145 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-03-14 01:42:29,145 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-14 01:42:29,145 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-14 01:42:29,145 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-14 01:42:29,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L65-4-->L65-2: Formula: (= |v_#race~n~0_33| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_33|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 446#true, Black: 450#true, 44#thread6ENTRYtrue, 145#L57-2true, Black: 454#true, Black: 458#true, 363#L108-1true, 460#(= |#race~n~0| 0), 396#L73-2true, 185#L41-2true, Black: 434#true, 471#true, 335#L65-2true, Black: 438#true, 468#true, Black: 442#true, 163#L49-2true]) [2025-03-14 01:42:29,228 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-03-14 01:42:29,228 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-14 01:42:29,228 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-14 01:42:29,228 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-14 01:42:29,315 INFO L124 PetriNetUnfolderBase]: 2274/8999 cut-off events. [2025-03-14 01:42:29,316 INFO L125 PetriNetUnfolderBase]: For 515/537 co-relation queries the response was YES. [2025-03-14 01:42:29,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13701 conditions, 8999 events. 2274/8999 cut-off events. For 515/537 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 100391 event pairs, 686 based on Foata normal form. 2/7866 useless extension candidates. Maximal degree in co-relation 12799. Up to 1997 conditions per place. [2025-03-14 01:42:29,445 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-03-14 01:42:29,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 266 transitions, 682 flow [2025-03-14 01:42:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:29,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:29,447 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 617 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 266 transitions, 682 flow [2025-03-14 01:42:29,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:29,454 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 615 flow [2025-03-14 01:42:29,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2025-03-14 01:42:29,454 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -114 predicate places. [2025-03-14 01:42:29,455 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 615 flow [2025-03-14 01:42:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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:42:29,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:29,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:29,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:42:29,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -607329139, now seen corresponding path program 1 times [2025-03-14 01:42:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093406034] [2025-03-14 01:42:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:29,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:42:29,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:42:29,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:29,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:29,494 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:42:29,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093406034] [2025-03-14 01:42:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093406034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218893373] [2025-03-14 01:42:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:29,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:29,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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:42:29,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:29,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:29,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:30,556 INFO L124 PetriNetUnfolderBase]: 1885/7637 cut-off events. [2025-03-14 01:42:30,557 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2025-03-14 01:42:30,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11549 conditions, 7637 events. 1885/7637 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 82123 event pairs, 568 based on Foata normal form. 5/6733 useless extension candidates. Maximal degree in co-relation 10750. Up to 1778 conditions per place. [2025-03-14 01:42:30,676 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 24 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-03-14 01:42:30,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 680 flow [2025-03-14 01:42:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:30,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:30,678 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 615 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 680 flow [2025-03-14 01:42:30,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 265 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:30,686 INFO L231 Difference]: Finished difference. Result has 264 places, 260 transitions, 613 flow [2025-03-14 01:42:30,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=264, PETRI_TRANSITIONS=260} [2025-03-14 01:42:30,686 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -115 predicate places. [2025-03-14 01:42:30,686 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 260 transitions, 613 flow [2025-03-14 01:42:30,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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:42:30,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:30,687 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, 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:42:30,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:42:30,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2025-03-14 01:42:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2011585436, now seen corresponding path program 1 times [2025-03-14 01:42:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:30,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316162139] [2025-03-14 01:42:30,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:30,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:42:30,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:42:30,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:30,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:30,735 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:42:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316162139] [2025-03-14 01:42:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316162139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:30,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:30,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:30,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812415368] [2025-03-14 01:42:30,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:30,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:30,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:30,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:30,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 415 [2025-03-14 01:42:30,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 260 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:42:30,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:30,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 415 [2025-03-14 01:42:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:31,498 INFO L124 PetriNetUnfolderBase]: 1313/5788 cut-off events. [2025-03-14 01:42:31,498 INFO L125 PetriNetUnfolderBase]: For 224/252 co-relation queries the response was YES. [2025-03-14 01:42:31,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8341 conditions, 5788 events. 1313/5788 cut-off events. For 224/252 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58597 event pairs, 333 based on Foata normal form. 4/5075 useless extension candidates. Maximal degree in co-relation 7649. Up to 1400 conditions per place. [2025-03-14 01:42:31,552 INFO L140 encePairwiseOnDemand]: 412/415 looper letters, 0 selfloop transitions, 0 changer transitions 264/264 dead transitions. [2025-03-14 01:42:31,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 678 flow [2025-03-14 01:42:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-14 01:42:31,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413654618473896 [2025-03-14 01:42:31,554 INFO L175 Difference]: Start difference. First operand has 264 places, 260 transitions, 613 flow. Second operand 3 states and 1172 transitions. [2025-03-14 01:42:31,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 678 flow [2025-03-14 01:42:31,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:31,560 INFO L231 Difference]: Finished difference. Result has 263 places, 0 transitions, 0 flow [2025-03-14 01:42:31,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=415, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=263, PETRI_TRANSITIONS=0} [2025-03-14 01:42:31,560 INFO L279 CegarLoopForPetriNet]: 379 programPoint places, -116 predicate places. [2025-03-14 01:42:31,560 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 0 transitions, 0 flow [2025-03-14 01:42:31,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:42:31,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2025-03-14 01:42:31,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2025-03-14 01:42:31,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2025-03-14 01:42:31,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2025-03-14 01:42:31,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 97 remaining) [2025-03-14 01:42:31,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (41 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (40 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2025-03-14 01:42:31,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2025-03-14 01:42:31,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2025-03-14 01:42:31,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2025-03-14 01:42:31,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2025-03-14 01:42:31,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2025-03-14 01:42:31,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2025-03-14 01:42:31,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2025-03-14 01:42:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:42:31,569 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:31,573 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:31,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:31,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:31 BasicIcfg [2025-03-14 01:42:31,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:31,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:31,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:31,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:31,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:12" (3/4) ... [2025-03-14 01:42:31,581 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-03-14 01:42:31,584 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-03-14 01:42:31,589 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-14 01:42:31,589 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-14 01:42:31,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-14 01:42:31,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:31,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:31,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:31,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:31,668 INFO L158 Benchmark]: Toolchain (without parser) took 19792.46ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 106.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-03-14 01:42:31,668 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:31,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.47ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:31,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:31,669 INFO L158 Benchmark]: Boogie Preprocessor took 18.53ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.3MB in the end (delta: 974.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:31,670 INFO L158 Benchmark]: IcfgBuilder took 601.40ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 61.9MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:42:31,670 INFO L158 Benchmark]: TraceAbstraction took 18838.02ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 61.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-14 01:42:31,670 INFO L158 Benchmark]: Witness Printer took 88.06ms. Allocated memory is still 4.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:31,672 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.47ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.53ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.3MB in the end (delta: 974.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 601.40ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 61.9MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18838.02ms. Allocated memory was 142.6MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 61.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 88.06ms. Allocated memory is still 4.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 58]: 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: 92]: 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: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 82]: 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 13 procedures, 536 locations, 97 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: 18.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 209 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 60, 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.7s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:31,691 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