./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:39:57,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:39:57,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:39:57,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:39:57,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:39:57,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:39:57,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:39:57,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:39:57,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:39:57,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:39:57,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:39:57,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:39:57,883 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:39:57,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:39:57,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:39:57,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:39:57,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:39:57,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:39:57,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:39:57,887 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-02-08 05:39:58,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:39:58,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:39:58,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:39:58,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:39:58,212 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:39:58,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-02-08 05:39:59,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffb5ec88a/1010bf3d5200425dab3209f403ab422f/FLAGcdc216694 [2025-02-08 05:39:59,854 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:39:59,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-02-08 05:39:59,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffb5ec88a/1010bf3d5200425dab3209f403ab422f/FLAGcdc216694 [2025-02-08 05:39:59,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ffb5ec88a/1010bf3d5200425dab3209f403ab422f [2025-02-08 05:39:59,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:39:59,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:39:59,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:39:59,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:39:59,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:39:59,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:59" (1/1) ... [2025-02-08 05:39:59,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6853e689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:39:59, skipping insertion in model container [2025-02-08 05:39:59,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:39:59" (1/1) ... [2025-02-08 05:39:59,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:00,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:00,113 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:00,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:00,188 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:00,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00 WrapperNode [2025-02-08 05:40:00,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:00,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:00,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:00,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:00,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,259 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 694 [2025-02-08 05:40:00,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:00,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:00,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:00,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:00,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:00,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:00,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:00,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:00,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (1/1) ... [2025-02-08 05:40:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:00,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:40:00,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:40:00,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:00,409 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:00,550 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:00,552 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:01,524 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:01,525 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:02,059 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:02,059 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:02,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:02 BoogieIcfgContainer [2025-02-08 05:40:02,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:02,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:02,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:02,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:02,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:39:59" (1/3) ... [2025-02-08 05:40:02,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a52f371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:02, skipping insertion in model container [2025-02-08 05:40:02,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:00" (2/3) ... [2025-02-08 05:40:02,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a52f371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:02, skipping insertion in model container [2025-02-08 05:40:02,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:02" (3/3) ... [2025-02-08 05:40:02,068 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-02-08 05:40:02,082 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:02,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 453 locations, 1 initial locations, 6 loop locations, and 113 error locations. [2025-02-08 05:40:02,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:02,233 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:02,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 468 transitions, 957 flow [2025-02-08 05:40:02,464 INFO L124 PetriNetUnfolderBase]: 16/465 cut-off events. [2025-02-08 05:40:02,467 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:02,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 465 events. 16/465 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 785 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 410. Up to 2 conditions per place. [2025-02-08 05:40:02,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 468 transitions, 957 flow [2025-02-08 05:40:02,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 443 places, 448 transitions, 914 flow [2025-02-08 05:40:02,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:02,539 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;@739b914c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:02,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 204 error locations. [2025-02-08 05:40:02,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:02,550 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-02-08 05:40:02,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:02,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:02,551 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] [2025-02-08 05:40:02,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash -164470845, now seen corresponding path program 1 times [2025-02-08 05:40:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:02,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926929467] [2025-02-08 05:40:02,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:02,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:40:02,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:40:02,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:02,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926929467] [2025-02-08 05:40:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926929467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031159896] [2025-02-08 05:40:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:02,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:02,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:02,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:02,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:02,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 448 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:02,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:02,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,179 INFO L124 PetriNetUnfolderBase]: 145/851 cut-off events. [2025-02-08 05:40:03,180 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-08 05:40:03,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 851 events. 145/851 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3605 event pairs, 72 based on Foata normal form. 98/863 useless extension candidates. Maximal degree in co-relation 764. Up to 217 conditions per place. [2025-02-08 05:40:03,188 INFO L140 encePairwiseOnDemand]: 368/468 looper letters, 18 selfloop transitions, 2 changer transitions 6/350 dead transitions. [2025-02-08 05:40:03,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 350 transitions, 758 flow [2025-02-08 05:40:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2025-02-08 05:40:03,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8254985754985755 [2025-02-08 05:40:03,213 INFO L175 Difference]: Start difference. First operand has 443 places, 448 transitions, 914 flow. Second operand 3 states and 1159 transitions. [2025-02-08 05:40:03,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 350 transitions, 758 flow [2025-02-08 05:40:03,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 350 transitions, 746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:03,232 INFO L231 Difference]: Finished difference. Result has 350 places, 344 transitions, 698 flow [2025-02-08 05:40:03,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=350, PETRI_TRANSITIONS=344} [2025-02-08 05:40:03,241 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -93 predicate places. [2025-02-08 05:40:03,241 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 344 transitions, 698 flow [2025-02-08 05:40:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,242 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] [2025-02-08 05:40:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:03,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash 674534893, now seen corresponding path program 1 times [2025-02-08 05:40:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548950158] [2025-02-08 05:40:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:40:03,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:40:03,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548950158] [2025-02-08 05:40:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548950158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794110867] [2025-02-08 05:40:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:03,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:03,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:03,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:03,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:03,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,610 INFO L124 PetriNetUnfolderBase]: 145/844 cut-off events. [2025-02-08 05:40:03,611 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:03,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 844 events. 145/844 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3612 event pairs, 72 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1049. Up to 217 conditions per place. [2025-02-08 05:40:03,620 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-08 05:40:03,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 343 transitions, 736 flow [2025-02-08 05:40:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:03,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:03,625 INFO L175 Difference]: Start difference. First operand has 350 places, 344 transitions, 698 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:03,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 343 transitions, 736 flow [2025-02-08 05:40:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 343 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:03,639 INFO L231 Difference]: Finished difference. Result has 343 places, 343 transitions, 696 flow [2025-02-08 05:40:03,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=343, PETRI_TRANSITIONS=343} [2025-02-08 05:40:03,641 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -100 predicate places. [2025-02-08 05:40:03,641 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 343 transitions, 696 flow [2025-02-08 05:40:03,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,642 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] [2025-02-08 05:40:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:03,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash 262687891, now seen corresponding path program 1 times [2025-02-08 05:40:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475559509] [2025-02-08 05:40:03,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:40:03,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:40:03,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475559509] [2025-02-08 05:40:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475559509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916266242] [2025-02-08 05:40:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:03,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:03,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 343 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:03,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:03,947 INFO L124 PetriNetUnfolderBase]: 145/843 cut-off events. [2025-02-08 05:40:03,947 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:40:03,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 843 events. 145/843 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3611 event pairs, 72 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1040. Up to 217 conditions per place. [2025-02-08 05:40:03,952 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:40:03,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 342 transitions, 734 flow [2025-02-08 05:40:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:03,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:03,956 INFO L175 Difference]: Start difference. First operand has 343 places, 343 transitions, 696 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:03,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 342 transitions, 734 flow [2025-02-08 05:40:03,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 342 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:03,962 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 694 flow [2025-02-08 05:40:03,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2025-02-08 05:40:03,963 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-02-08 05:40:03,963 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 694 flow [2025-02-08 05:40:03,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:03,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:03,964 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] [2025-02-08 05:40:03,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:03,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:03,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 910911615, now seen corresponding path program 1 times [2025-02-08 05:40:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962792515] [2025-02-08 05:40:03,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:03,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:03,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:40:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:40:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962792515] [2025-02-08 05:40:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962792515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045758058] [2025-02-08 05:40:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:04,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:04,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:04,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:04,267 INFO L124 PetriNetUnfolderBase]: 171/844 cut-off events. [2025-02-08 05:40:04,267 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:40:04,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 844 events. 171/844 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3433 event pairs, 27 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1075. Up to 202 conditions per place. [2025-02-08 05:40:04,272 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 25 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-08 05:40:04,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 771 flow [2025-02-08 05:40:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:04,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2025-02-08 05:40:04,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76994301994302 [2025-02-08 05:40:04,276 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 694 flow. Second operand 3 states and 1081 transitions. [2025-02-08 05:40:04,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 771 flow [2025-02-08 05:40:04,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:04,282 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 698 flow [2025-02-08 05:40:04,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2025-02-08 05:40:04,283 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-02-08 05:40:04,284 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 698 flow [2025-02-08 05:40:04,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:04,284 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] [2025-02-08 05:40:04,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:04,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:04,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -599232817, now seen corresponding path program 1 times [2025-02-08 05:40:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:04,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459390978] [2025-02-08 05:40:04,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:04,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:40:04,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:40:04,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:04,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459390978] [2025-02-08 05:40:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459390978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352275599] [2025-02-08 05:40:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:04,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:04,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:04,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:04,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:04,566 INFO L124 PetriNetUnfolderBase]: 162/914 cut-off events. [2025-02-08 05:40:04,566 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-02-08 05:40:04,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 914 events. 162/914 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4171 event pairs, 86 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 465. Up to 247 conditions per place. [2025-02-08 05:40:04,575 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-08 05:40:04,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 736 flow [2025-02-08 05:40:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:04,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:04,578 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 698 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:04,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 736 flow [2025-02-08 05:40:04,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 341 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:04,602 INFO L231 Difference]: Finished difference. Result has 342 places, 341 transitions, 698 flow [2025-02-08 05:40:04,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=342, PETRI_TRANSITIONS=341} [2025-02-08 05:40:04,605 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-02-08 05:40:04,605 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 341 transitions, 698 flow [2025-02-08 05:40:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:04,607 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] [2025-02-08 05:40:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:04,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:04,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1859146432, now seen corresponding path program 1 times [2025-02-08 05:40:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065706724] [2025-02-08 05:40:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:40:04,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:40:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065706724] [2025-02-08 05:40:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065706724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740225966] [2025-02-08 05:40:04,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:04,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:04,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:04,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 341 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:04,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:04,862 INFO L124 PetriNetUnfolderBase]: 162/913 cut-off events. [2025-02-08 05:40:04,863 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:40:04,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 913 events. 162/913 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4162 event pairs, 86 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1146. Up to 245 conditions per place. [2025-02-08 05:40:04,868 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 17 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2025-02-08 05:40:04,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 340 transitions, 732 flow [2025-02-08 05:40:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-02-08 05:40:04,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-02-08 05:40:04,871 INFO L175 Difference]: Start difference. First operand has 342 places, 341 transitions, 698 flow. Second operand 3 states and 1071 transitions. [2025-02-08 05:40:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 340 transitions, 732 flow [2025-02-08 05:40:04,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 340 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:04,876 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 694 flow [2025-02-08 05:40:04,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2025-02-08 05:40:04,878 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-02-08 05:40:04,878 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 694 flow [2025-02-08 05:40:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:04,879 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] [2025-02-08 05:40:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:04,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2116482943, now seen corresponding path program 1 times [2025-02-08 05:40:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950216410] [2025-02-08 05:40:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:04,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:40:04,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:40:04,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:04,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950216410] [2025-02-08 05:40:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950216410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897021332] [2025-02-08 05:40:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:04,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:04,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:04,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:04,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:04,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:04,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:04,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:05,208 INFO L124 PetriNetUnfolderBase]: 162/912 cut-off events. [2025-02-08 05:40:05,208 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:40:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 912 events. 162/912 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4155 event pairs, 86 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1146. Up to 247 conditions per place. [2025-02-08 05:40:05,215 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 18 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-02-08 05:40:05,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 339 transitions, 732 flow [2025-02-08 05:40:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:05,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:05,218 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 694 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:05,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 339 transitions, 732 flow [2025-02-08 05:40:05,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:05,223 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 695 flow [2025-02-08 05:40:05,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2025-02-08 05:40:05,225 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-02-08 05:40:05,225 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 695 flow [2025-02-08 05:40:05,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:05,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:05,226 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] [2025-02-08 05:40:05,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:05,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1640091114, now seen corresponding path program 1 times [2025-02-08 05:40:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395476367] [2025-02-08 05:40:05,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:40:05,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:40:05,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395476367] [2025-02-08 05:40:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395476367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:05,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144101809] [2025-02-08 05:40:05,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:05,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:05,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:05,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:06,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 468 [2025-02-08 05:40:06,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 468 [2025-02-08 05:40:06,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:06,284 INFO L124 PetriNetUnfolderBase]: 162/909 cut-off events. [2025-02-08 05:40:06,284 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:40:06,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 909 events. 162/909 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4161 event pairs, 86 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1180. Up to 268 conditions per place. [2025-02-08 05:40:06,293 INFO L140 encePairwiseOnDemand]: 450/468 looper letters, 39 selfloop transitions, 15 changer transitions 0/336 dead transitions. [2025-02-08 05:40:06,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 336 transitions, 797 flow [2025-02-08 05:40:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1934 transitions. [2025-02-08 05:40:06,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6887464387464387 [2025-02-08 05:40:06,298 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 695 flow. Second operand 6 states and 1934 transitions. [2025-02-08 05:40:06,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 336 transitions, 797 flow [2025-02-08 05:40:06,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 336 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:06,306 INFO L231 Difference]: Finished difference. Result has 341 places, 336 transitions, 715 flow [2025-02-08 05:40:06,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=341, PETRI_TRANSITIONS=336} [2025-02-08 05:40:06,307 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-02-08 05:40:06,307 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 336 transitions, 715 flow [2025-02-08 05:40:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:06,309 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] [2025-02-08 05:40:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:06,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:06,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 4554662, now seen corresponding path program 1 times [2025-02-08 05:40:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:06,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737925362] [2025-02-08 05:40:06,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:06,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:06,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:40:06,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:40:06,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:06,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737925362] [2025-02-08 05:40:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737925362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662894295] [2025-02-08 05:40:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:06,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:06,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:06,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:06,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 336 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:06,576 INFO L124 PetriNetUnfolderBase]: 162/908 cut-off events. [2025-02-08 05:40:06,576 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:40:06,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 908 events. 162/908 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4147 event pairs, 86 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1171. Up to 248 conditions per place. [2025-02-08 05:40:06,582 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-02-08 05:40:06,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 755 flow [2025-02-08 05:40:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:06,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:06,585 INFO L175 Difference]: Start difference. First operand has 341 places, 336 transitions, 715 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:06,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 755 flow [2025-02-08 05:40:06,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 725 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:06,592 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 687 flow [2025-02-08 05:40:06,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2025-02-08 05:40:06,594 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-02-08 05:40:06,594 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 687 flow [2025-02-08 05:40:06,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:06,595 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] [2025-02-08 05:40:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:06,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1605083652, now seen corresponding path program 1 times [2025-02-08 05:40:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86197020] [2025-02-08 05:40:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:40:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:40:06,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86197020] [2025-02-08 05:40:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86197020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495609530] [2025-02-08 05:40:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:06,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:06,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:06,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:06,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:06,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:06,891 INFO L124 PetriNetUnfolderBase]: 221/1065 cut-off events. [2025-02-08 05:40:06,891 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 05:40:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1065 events. 221/1065 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5478 event pairs, 70 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 1399. Up to 172 conditions per place. [2025-02-08 05:40:06,898 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 28 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-02-08 05:40:06,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 346 transitions, 776 flow [2025-02-08 05:40:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2025-02-08 05:40:06,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706552706552706 [2025-02-08 05:40:06,901 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 687 flow. Second operand 3 states and 1082 transitions. [2025-02-08 05:40:06,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 346 transitions, 776 flow [2025-02-08 05:40:06,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 346 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:06,907 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 691 flow [2025-02-08 05:40:06,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2025-02-08 05:40:06,908 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-02-08 05:40:06,908 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 691 flow [2025-02-08 05:40:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:06,909 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] [2025-02-08 05:40:06,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:06,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2141654368, now seen corresponding path program 1 times [2025-02-08 05:40:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823528416] [2025-02-08 05:40:06,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:06,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:40:06,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:40:06,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:06,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:06,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823528416] [2025-02-08 05:40:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823528416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732771949] [2025-02-08 05:40:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:06,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:06,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:06,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:07,196 INFO L124 PetriNetUnfolderBase]: 221/1048 cut-off events. [2025-02-08 05:40:07,197 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 05:40:07,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1048 events. 221/1048 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5371 event pairs, 138 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1451. Up to 337 conditions per place. [2025-02-08 05:40:07,203 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-02-08 05:40:07,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 334 transitions, 731 flow [2025-02-08 05:40:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:07,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:07,206 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 691 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:07,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 334 transitions, 731 flow [2025-02-08 05:40:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 334 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:07,212 INFO L231 Difference]: Finished difference. Result has 337 places, 334 transitions, 691 flow [2025-02-08 05:40:07,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=334} [2025-02-08 05:40:07,213 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-02-08 05:40:07,213 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 334 transitions, 691 flow [2025-02-08 05:40:07,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:07,214 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] [2025-02-08 05:40:07,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:07,215 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:07,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1351048652, now seen corresponding path program 1 times [2025-02-08 05:40:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837281965] [2025-02-08 05:40:07,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 05:40:07,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 05:40:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837281965] [2025-02-08 05:40:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837281965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:07,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107779809] [2025-02-08 05:40:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:07,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:07,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:07,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:07,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:07,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 334 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:07,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:07,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:07,514 INFO L124 PetriNetUnfolderBase]: 221/1047 cut-off events. [2025-02-08 05:40:07,515 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-08 05:40:07,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1047 events. 221/1047 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5384 event pairs, 138 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1430. Up to 338 conditions per place. [2025-02-08 05:40:07,522 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2025-02-08 05:40:07,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 333 transitions, 733 flow [2025-02-08 05:40:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:07,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:07,526 INFO L175 Difference]: Start difference. First operand has 337 places, 334 transitions, 691 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 333 transitions, 733 flow [2025-02-08 05:40:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 333 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:07,532 INFO L231 Difference]: Finished difference. Result has 336 places, 333 transitions, 689 flow [2025-02-08 05:40:07,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=336, PETRI_TRANSITIONS=333} [2025-02-08 05:40:07,535 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -107 predicate places. [2025-02-08 05:40:07,535 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 333 transitions, 689 flow [2025-02-08 05:40:07,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:07,536 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] [2025-02-08 05:40:07,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:07,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash -496610055, now seen corresponding path program 1 times [2025-02-08 05:40:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:07,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114876558] [2025-02-08 05:40:07,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:07,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:40:07,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:40:07,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114876558] [2025-02-08 05:40:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114876558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:07,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:07,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:07,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651921869] [2025-02-08 05:40:07,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:07,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:07,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:07,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:07,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:07,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 333 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:07,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:07,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:07,853 INFO L124 PetriNetUnfolderBase]: 221/1046 cut-off events. [2025-02-08 05:40:07,853 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 05:40:07,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 1046 events. 221/1046 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5390 event pairs, 138 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1427. Up to 335 conditions per place. [2025-02-08 05:40:07,860 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 18 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2025-02-08 05:40:07,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 332 transitions, 725 flow [2025-02-08 05:40:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-02-08 05:40:07,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-02-08 05:40:07,863 INFO L175 Difference]: Start difference. First operand has 336 places, 333 transitions, 689 flow. Second operand 3 states and 1071 transitions. [2025-02-08 05:40:07,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 332 transitions, 725 flow [2025-02-08 05:40:07,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 332 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:07,869 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 685 flow [2025-02-08 05:40:07,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=335, PETRI_TRANSITIONS=332} [2025-02-08 05:40:07,870 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-02-08 05:40:07,870 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 685 flow [2025-02-08 05:40:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:07,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:07,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:07,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:07,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1295992506, now seen corresponding path program 1 times [2025-02-08 05:40:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:07,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109313488] [2025-02-08 05:40:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:07,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:40:07,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:40:07,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:07,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109313488] [2025-02-08 05:40:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109313488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:07,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713155995] [2025-02-08 05:40:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:07,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:07,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:07,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:07,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 332 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:07,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:07,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:07,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:08,129 INFO L124 PetriNetUnfolderBase]: 221/1045 cut-off events. [2025-02-08 05:40:08,130 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-08 05:40:08,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 1045 events. 221/1045 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5401 event pairs, 138 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1426. Up to 337 conditions per place. [2025-02-08 05:40:08,135 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 19 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-02-08 05:40:08,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 725 flow [2025-02-08 05:40:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:08,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:08,139 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 685 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:08,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 725 flow [2025-02-08 05:40:08,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 331 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:08,143 INFO L231 Difference]: Finished difference. Result has 335 places, 331 transitions, 686 flow [2025-02-08 05:40:08,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=335, PETRI_TRANSITIONS=331} [2025-02-08 05:40:08,144 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-02-08 05:40:08,144 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 331 transitions, 686 flow [2025-02-08 05:40:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:08,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:08,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1186917260, now seen corresponding path program 1 times [2025-02-08 05:40:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964353948] [2025-02-08 05:40:08,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:40:08,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:40:08,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:08,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:08,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964353948] [2025-02-08 05:40:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964353948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026422876] [2025-02-08 05:40:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:08,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:08,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:08,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 331 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:08,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:08,414 INFO L124 PetriNetUnfolderBase]: 221/1044 cut-off events. [2025-02-08 05:40:08,414 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-08 05:40:08,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 1044 events. 221/1044 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5368 event pairs, 138 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1428. Up to 338 conditions per place. [2025-02-08 05:40:08,424 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-02-08 05:40:08,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 330 transitions, 728 flow [2025-02-08 05:40:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:08,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:08,427 INFO L175 Difference]: Start difference. First operand has 335 places, 331 transitions, 686 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:08,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 330 transitions, 728 flow [2025-02-08 05:40:08,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 330 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:08,432 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 684 flow [2025-02-08 05:40:08,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2025-02-08 05:40:08,433 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-02-08 05:40:08,433 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 684 flow [2025-02-08 05:40:08,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:08,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:08,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:08,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1302980264, now seen corresponding path program 1 times [2025-02-08 05:40:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714717057] [2025-02-08 05:40:08,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:08,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 05:40:08,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 05:40:08,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:08,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714717057] [2025-02-08 05:40:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714717057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058394499] [2025-02-08 05:40:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:08,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:08,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:08,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:08,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:08,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:08,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:08,729 INFO L124 PetriNetUnfolderBase]: 223/1027 cut-off events. [2025-02-08 05:40:08,729 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-02-08 05:40:08,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1027 events. 223/1027 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4990 event pairs, 32 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1430. Up to 253 conditions per place. [2025-02-08 05:40:08,737 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 30 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-08 05:40:08,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 342 transitions, 784 flow [2025-02-08 05:40:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2025-02-08 05:40:08,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7706552706552706 [2025-02-08 05:40:08,740 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 684 flow. Second operand 3 states and 1082 transitions. [2025-02-08 05:40:08,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 342 transitions, 784 flow [2025-02-08 05:40:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 342 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:08,745 INFO L231 Difference]: Finished difference. Result has 334 places, 330 transitions, 688 flow [2025-02-08 05:40:08,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=330} [2025-02-08 05:40:08,746 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-02-08 05:40:08,746 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 330 transitions, 688 flow [2025-02-08 05:40:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:08,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:08,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:08,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash -9503587, now seen corresponding path program 1 times [2025-02-08 05:40:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044827146] [2025-02-08 05:40:08,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:08,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:40:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:40:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044827146] [2025-02-08 05:40:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044827146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:08,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083662607] [2025-02-08 05:40:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:08,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:08,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:08,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:08,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 330 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:08,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:08,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:08,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:09,037 INFO L124 PetriNetUnfolderBase]: 223/1089 cut-off events. [2025-02-08 05:40:09,037 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-02-08 05:40:09,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 1089 events. 223/1089 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5657 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1591. Up to 352 conditions per place. [2025-02-08 05:40:09,043 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-02-08 05:40:09,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 329 transitions, 730 flow [2025-02-08 05:40:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:09,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:09,046 INFO L175 Difference]: Start difference. First operand has 334 places, 330 transitions, 688 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:09,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 329 transitions, 730 flow [2025-02-08 05:40:09,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 329 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:09,052 INFO L231 Difference]: Finished difference. Result has 334 places, 329 transitions, 688 flow [2025-02-08 05:40:09,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=334, PETRI_TRANSITIONS=329} [2025-02-08 05:40:09,053 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-02-08 05:40:09,053 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 329 transitions, 688 flow [2025-02-08 05:40:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:09,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:09,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:09,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 94823553, now seen corresponding path program 1 times [2025-02-08 05:40:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165913808] [2025-02-08 05:40:09,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:40:09,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:40:09,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:09,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165913808] [2025-02-08 05:40:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165913808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:09,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299010377] [2025-02-08 05:40:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:09,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:09,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:09,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 468 [2025-02-08 05:40:09,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 329 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:09,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 468 [2025-02-08 05:40:09,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:09,339 INFO L124 PetriNetUnfolderBase]: 223/1088 cut-off events. [2025-02-08 05:40:09,340 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-02-08 05:40:09,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 1088 events. 223/1088 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5682 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1560. Up to 353 conditions per place. [2025-02-08 05:40:09,347 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 21 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-02-08 05:40:09,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 328 transitions, 732 flow [2025-02-08 05:40:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:09,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2025-02-08 05:40:09,350 INFO L175 Difference]: Start difference. First operand has 334 places, 329 transitions, 688 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 328 transitions, 732 flow [2025-02-08 05:40:09,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:09,357 INFO L231 Difference]: Finished difference. Result has 333 places, 328 transitions, 686 flow [2025-02-08 05:40:09,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=333, PETRI_TRANSITIONS=328} [2025-02-08 05:40:09,358 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -110 predicate places. [2025-02-08 05:40:09,358 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 328 transitions, 686 flow [2025-02-08 05:40:09,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:09,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:09,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:09,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:09,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1504421043, now seen corresponding path program 1 times [2025-02-08 05:40:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092738915] [2025-02-08 05:40:09,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:09,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:40:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:40:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:09,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:09,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092738915] [2025-02-08 05:40:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092738915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076454578] [2025-02-08 05:40:09,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:09,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:09,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:09,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:09,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 328 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:09,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:09,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:09,731 INFO L124 PetriNetUnfolderBase]: 223/1087 cut-off events. [2025-02-08 05:40:09,731 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-02-08 05:40:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 1087 events. 223/1087 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5714 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1557. Up to 350 conditions per place. [2025-02-08 05:40:09,739 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 19 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2025-02-08 05:40:09,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 724 flow [2025-02-08 05:40:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-02-08 05:40:09,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2025-02-08 05:40:09,743 INFO L175 Difference]: Start difference. First operand has 333 places, 328 transitions, 686 flow. Second operand 3 states and 1071 transitions. [2025-02-08 05:40:09,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 724 flow [2025-02-08 05:40:09,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:09,750 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 682 flow [2025-02-08 05:40:09,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-02-08 05:40:09,751 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-02-08 05:40:09,751 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 682 flow [2025-02-08 05:40:09,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:09,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:40:09,753 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1806911713, now seen corresponding path program 1 times [2025-02-08 05:40:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070374971] [2025-02-08 05:40:09,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:09,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 05:40:09,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 05:40:09,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:09,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070374971] [2025-02-08 05:40:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070374971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:09,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637276557] [2025-02-08 05:40:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:09,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:09,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:09,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:09,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:09,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:10,072 INFO L124 PetriNetUnfolderBase]: 223/1086 cut-off events. [2025-02-08 05:40:10,073 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-02-08 05:40:10,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 1086 events. 223/1086 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5708 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1556. Up to 352 conditions per place. [2025-02-08 05:40:10,080 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-02-08 05:40:10,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 326 transitions, 724 flow [2025-02-08 05:40:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:10,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:10,083 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 682 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:10,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 326 transitions, 724 flow [2025-02-08 05:40:10,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 326 transitions, 723 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:10,089 INFO L231 Difference]: Finished difference. Result has 332 places, 326 transitions, 683 flow [2025-02-08 05:40:10,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=683, PETRI_PLACES=332, PETRI_TRANSITIONS=326} [2025-02-08 05:40:10,090 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-02-08 05:40:10,090 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 326 transitions, 683 flow [2025-02-08 05:40:10,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:10,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:10,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:40:10,091 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 768600042, now seen corresponding path program 1 times [2025-02-08 05:40:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385199783] [2025-02-08 05:40:10,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:40:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:40:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385199783] [2025-02-08 05:40:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385199783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:10,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:10,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:10,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108695207] [2025-02-08 05:40:10,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:10,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:10,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:10,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:10,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:10,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 326 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:10,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:10,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:10,363 INFO L124 PetriNetUnfolderBase]: 223/1085 cut-off events. [2025-02-08 05:40:10,363 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-02-08 05:40:10,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 1085 events. 223/1085 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5707 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1557. Up to 352 conditions per place. [2025-02-08 05:40:10,371 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2025-02-08 05:40:10,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 325 transitions, 725 flow [2025-02-08 05:40:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:10,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:10,374 INFO L175 Difference]: Start difference. First operand has 332 places, 326 transitions, 683 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:10,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 325 transitions, 725 flow [2025-02-08 05:40:10,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 325 transitions, 721 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:10,379 INFO L231 Difference]: Finished difference. Result has 331 places, 325 transitions, 681 flow [2025-02-08 05:40:10,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=331, PETRI_TRANSITIONS=325} [2025-02-08 05:40:10,380 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -112 predicate places. [2025-02-08 05:40:10,380 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 325 transitions, 681 flow [2025-02-08 05:40:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:10,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:10,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:40:10,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:10,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2066623350, now seen corresponding path program 1 times [2025-02-08 05:40:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986940060] [2025-02-08 05:40:10,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:10,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:40:10,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:40:10,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:10,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986940060] [2025-02-08 05:40:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986940060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148317933] [2025-02-08 05:40:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:10,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 468 [2025-02-08 05:40:10,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 325 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:10,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 468 [2025-02-08 05:40:10,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:10,650 INFO L124 PetriNetUnfolderBase]: 223/1084 cut-off events. [2025-02-08 05:40:10,650 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-02-08 05:40:10,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 1084 events. 223/1084 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5705 event pairs, 146 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1556. Up to 352 conditions per place. [2025-02-08 05:40:10,662 INFO L140 encePairwiseOnDemand]: 465/468 looper letters, 20 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-02-08 05:40:10,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 324 transitions, 723 flow [2025-02-08 05:40:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2025-02-08 05:40:10,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578347578347578 [2025-02-08 05:40:10,666 INFO L175 Difference]: Start difference. First operand has 331 places, 325 transitions, 681 flow. Second operand 3 states and 1064 transitions. [2025-02-08 05:40:10,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 324 transitions, 723 flow [2025-02-08 05:40:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 324 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:10,671 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 679 flow [2025-02-08 05:40:10,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2025-02-08 05:40:10,672 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -113 predicate places. [2025-02-08 05:40:10,672 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 679 flow [2025-02-08 05:40:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:10,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:10,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:40:10,673 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-02-08 05:40:10,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2009821733, now seen corresponding path program 1 times [2025-02-08 05:40:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:10,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378684024] [2025-02-08 05:40:10,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:10,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:40:10,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:40:10,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:10,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378684024] [2025-02-08 05:40:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378684024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047735990] [2025-02-08 05:40:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:10,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:10,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:10,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 468 [2025-02-08 05:40:10,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:10,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 468 [2025-02-08 05:40:10,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:10,976 INFO L124 PetriNetUnfolderBase]: 223/1076 cut-off events. [2025-02-08 05:40:10,976 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-02-08 05:40:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1076 events. 223/1076 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5643 event pairs, 146 based on Foata normal form. 8/1013 useless extension candidates. Maximal degree in co-relation 1552. Up to 350 conditions per place. [2025-02-08 05:40:10,981 INFO L140 encePairwiseOnDemand]: 466/468 looper letters, 0 selfloop transitions, 0 changer transitions 323/323 dead transitions. [2025-02-08 05:40:10,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 323 transitions, 715 flow [2025-02-08 05:40:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1070 transitions. [2025-02-08 05:40:10,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7621082621082621 [2025-02-08 05:40:10,983 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 679 flow. Second operand 3 states and 1070 transitions. [2025-02-08 05:40:10,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 323 transitions, 715 flow [2025-02-08 05:40:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 323 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:10,987 INFO L231 Difference]: Finished difference. Result has 329 places, 0 transitions, 0 flow [2025-02-08 05:40:10,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=329, PETRI_TRANSITIONS=0} [2025-02-08 05:40:10,988 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -114 predicate places. [2025-02-08 05:40:10,988 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 0 transitions, 0 flow [2025-02-08 05:40:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:10,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (203 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (202 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (201 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (200 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (199 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (198 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (197 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (196 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (194 of 204 remaining) [2025-02-08 05:40:10,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (193 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (192 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (191 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (190 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (189 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (188 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (187 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (186 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (185 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (184 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (182 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (181 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (180 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (179 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (178 of 204 remaining) [2025-02-08 05:40:10,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (177 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (176 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (175 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (174 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (173 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (172 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (171 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (170 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (169 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (168 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (167 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (166 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (165 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 204 remaining) [2025-02-08 05:40:10,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (162 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (160 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (158 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (157 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (156 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (155 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (154 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (153 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (152 of 204 remaining) [2025-02-08 05:40:10,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (151 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (149 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (148 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (147 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (146 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (145 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (144 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (143 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (142 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (141 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (140 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (139 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (138 of 204 remaining) [2025-02-08 05:40:10,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (137 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (136 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (135 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (134 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (133 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (132 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 204 remaining) [2025-02-08 05:40:10,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (130 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (125 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (123 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (122 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (121 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (120 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (119 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (118 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (117 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (116 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (115 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (114 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (113 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (112 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (111 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (110 of 204 remaining) [2025-02-08 05:40:10,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (109 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (108 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (107 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (106 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (103 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (102 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (101 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (100 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (99 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (98 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (97 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (96 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (95 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (94 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (93 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (92 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (91 of 204 remaining) [2025-02-08 05:40:10,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (87 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (86 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (85 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (84 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (83 of 204 remaining) [2025-02-08 05:40:11,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (82 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (81 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (80 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (79 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (78 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (77 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (76 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (75 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (74 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (73 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (72 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (71 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (70 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (69 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (68 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (67 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (66 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (65 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (64 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (63 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (62 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (60 of 204 remaining) [2025-02-08 05:40:11,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (59 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (58 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (56 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (55 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (54 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (52 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (43 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (42 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (40 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (39 of 204 remaining) [2025-02-08 05:40:11,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (38 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (37 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (36 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (35 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (34 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (33 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (32 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (31 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (29 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (28 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (26 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (21 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (20 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (19 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 204 remaining) [2025-02-08 05:40:11,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 204 remaining) [2025-02-08 05:40:11,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 204 remaining) [2025-02-08 05:40:11,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:40:11,006 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, 1, 1, 1] [2025-02-08 05:40:11,013 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:11,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:11,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:11 BasicIcfg [2025-02-08 05:40:11,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:11,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:11,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:11,021 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:11,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:02" (3/4) ... [2025-02-08 05:40:11,023 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:11,026 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:11,026 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:11,026 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:11,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 05:40:11,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:11,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:11,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:11,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:11,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:11,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:11,127 INFO L158 Benchmark]: Toolchain (without parser) took 11238.12ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 112.4MB in the beginning and 370.0MB in the end (delta: -257.6MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. [2025-02-08 05:40:11,127 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:11,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:11,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.13ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 93.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:11,130 INFO L158 Benchmark]: Boogie Preprocessor took 69.84ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:11,130 INFO L158 Benchmark]: IcfgBuilder took 1728.89ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 98.6MB in the end (delta: -8.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2025-02-08 05:40:11,130 INFO L158 Benchmark]: TraceAbstraction took 8958.79ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 98.6MB in the beginning and 378.4MB in the end (delta: -279.8MB). Peak memory consumption was 327.5MB. Max. memory is 16.1GB. [2025-02-08 05:40:11,130 INFO L158 Benchmark]: Witness Printer took 105.56ms. Allocated memory is still 545.3MB. Free memory was 378.4MB in the beginning and 370.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:11,132 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.63ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.8MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.13ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 93.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.84ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 90.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1728.89ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 98.6MB in the end (delta: -8.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8958.79ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 98.6MB in the beginning and 378.4MB in the end (delta: -279.8MB). Peak memory consumption was 327.5MB. Max. memory is 16.1GB. * Witness Printer took 105.56ms. Allocated memory is still 545.3MB. Free memory was 378.4MB in the beginning and 370.0MB 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 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: 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: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 579 locations, 204 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: 8.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 159 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=914occurred in iteration=0, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2788 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 113 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:11,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE