./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/chl-word-symm.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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:29:46,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:29:46,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:29:46,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:29:46,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:29:46,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:29:46,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:29:46,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:29:46,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:29:46,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:29:46,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:29:46,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:29:46,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:29:46,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:46,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:29:46,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:29:46,783 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-02-06 09:29:47,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:29:47,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:29:47,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:29:47,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:29:47,019 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:29:47,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-02-06 09:29:48,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d307e46e8/30675a559ce744ab86ed887efadbea5e/FLAGdf4d1afc2 [2025-02-06 09:29:48,427 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:29:48,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-02-06 09:29:48,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d307e46e8/30675a559ce744ab86ed887efadbea5e/FLAGdf4d1afc2 [2025-02-06 09:29:48,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d307e46e8/30675a559ce744ab86ed887efadbea5e [2025-02-06 09:29:48,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:29:48,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:29:48,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:48,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:29:48,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:29:48,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:48,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2078f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48, skipping insertion in model container [2025-02-06 09:29:48,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:48,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:29:48,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:48,926 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:29:48,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:48,972 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:29:48,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48 WrapperNode [2025-02-06 09:29:48,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:48,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:48,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:29:48,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:29:48,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:48,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:48,999 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-02-06 09:29:48,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:49,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:29:49,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:29:49,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:29:49,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:29:49,021 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:29:49,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:29:49,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:29:49,022 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (1/1) ... [2025-02-06 09:29:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:49,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:29:49,056 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-06 09:29:49,061 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-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:29:49,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:29:49,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:29:49,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:29:49,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:29:49,077 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:29:49,154 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:29:49,156 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:29:49,637 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:29:49,637 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:29:49,660 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:29:49,660 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:29:49,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:49 BoogieIcfgContainer [2025-02-06 09:29:49,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:29:49,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:29:49,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:29:49,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:29:49,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:29:48" (1/3) ... [2025-02-06 09:29:49,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d522c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:49, skipping insertion in model container [2025-02-06 09:29:49,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:48" (2/3) ... [2025-02-06 09:29:49,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d522c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:49, skipping insertion in model container [2025-02-06 09:29:49,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:49" (3/3) ... [2025-02-06 09:29:49,667 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-02-06 09:29:49,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:29:49,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 450 locations, 1 initial locations, 4 loop locations, and 54 error locations. [2025-02-06 09:29:49,682 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:29:49,813 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:29:49,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 473 transitions, 960 flow [2025-02-06 09:29:49,984 INFO L124 PetriNetUnfolderBase]: 24/471 cut-off events. [2025-02-06 09:29:49,985 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:29:49,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 471 events. 24/471 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1105 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 290. Up to 3 conditions per place. [2025-02-06 09:29:49,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 473 transitions, 960 flow [2025-02-06 09:29:50,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 451 transitions, 914 flow [2025-02-06 09:29:50,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:29:50,016 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;@18d50811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:29:50,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-06 09:29:50,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:29:50,021 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 09:29:50,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:29:50,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:50,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:50,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:50,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1977631769, now seen corresponding path program 1 times [2025-02-06 09:29:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:50,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510291099] [2025-02-06 09:29:50,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:50,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:29:50,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:29:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:50,179 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-06 09:29:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510291099] [2025-02-06 09:29:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510291099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629208438] [2025-02-06 09:29:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:50,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:50,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:50,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:50,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-06 09:29:50,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 451 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:50,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:50,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-06 09:29:50,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:50,401 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2025-02-06 09:29:50,401 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:29:50,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3435 event pairs, 8 based on Foata normal form. 13/648 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2025-02-06 09:29:50,410 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2025-02-06 09:29:50,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2025-02-06 09:29:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2025-02-06 09:29:50,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9626497533474278 [2025-02-06 09:29:50,427 INFO L175 Difference]: Start difference. First operand has 436 places, 451 transitions, 914 flow. Second operand 3 states and 1366 transitions. [2025-02-06 09:29:50,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2025-02-06 09:29:50,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:29:50,442 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2025-02-06 09:29:50,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2025-02-06 09:29:50,449 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2025-02-06 09:29:50,449 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2025-02-06 09:29:50,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:50,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:50,450 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] [2025-02-06 09:29:50,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:29:50,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1683597137, now seen corresponding path program 1 times [2025-02-06 09:29:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56750391] [2025-02-06 09:29:50,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:50,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:29:50,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:29:50,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:50,511 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-06 09:29:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56750391] [2025-02-06 09:29:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56750391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446315126] [2025-02-06 09:29:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:50,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:50,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-06 09:29:50,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:50,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:50,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-06 09:29:50,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:50,673 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2025-02-06 09:29:50,674 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:29:50,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3396 event pairs, 8 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2025-02-06 09:29:50,678 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-02-06 09:29:50,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2025-02-06 09:29:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:50,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:50,681 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:50,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2025-02-06 09:29:50,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:50,686 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2025-02-06 09:29:50,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2025-02-06 09:29:50,688 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2025-02-06 09:29:50,688 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2025-02-06 09:29:50,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:50,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:50,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:50,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:29:50,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:50,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -473707422, now seen corresponding path program 1 times [2025-02-06 09:29:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:50,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-02-06 09:29:50,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:50,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:29:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:29:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:50,744 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-06 09:29:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953152650] [2025-02-06 09:29:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953152650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493419968] [2025-02-06 09:29:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:50,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:50,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:50,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:50,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-06 09:29:50,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-06 09:29:50,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:50,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-06 09:29:50,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:50,870 INFO L124 PetriNetUnfolderBase]: 37/756 cut-off events. [2025-02-06 09:29:50,870 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 09:29:50,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 756 events. 37/756 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3139 event pairs, 8 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 758. Up to 32 conditions per place. [2025-02-06 09:29:50,875 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-02-06 09:29:50,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2025-02-06 09:29:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-02-06 09:29:50,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-02-06 09:29:50,878 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2025-02-06 09:29:50,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2025-02-06 09:29:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:50,883 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2025-02-06 09:29:50,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2025-02-06 09:29:50,884 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-02-06 09:29:50,884 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2025-02-06 09:29:50,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-06 09:29:50,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:50,885 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] [2025-02-06 09:29:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:29:50,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash 203158289, now seen corresponding path program 1 times [2025-02-06 09:29:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907577723] [2025-02-06 09:29:50,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:50,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:29:50,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:29:50,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:50,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:50,940 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-06 09:29:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:50,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907577723] [2025-02-06 09:29:50,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907577723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:50,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:50,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188492706] [2025-02-06 09:29:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:50,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:50,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:50,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-06 09:29:50,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-06 09:29:50,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:50,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-06 09:29:50,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:51,075 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2025-02-06 09:29:51,075 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 09:29:51,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3188 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2025-02-06 09:29:51,083 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-02-06 09:29:51,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2025-02-06 09:29:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2025-02-06 09:29:51,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9556025369978859 [2025-02-06 09:29:51,086 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2025-02-06 09:29:51,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2025-02-06 09:29:51,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:51,093 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2025-02-06 09:29:51,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2025-02-06 09:29:51,094 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-02-06 09:29:51,094 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2025-02-06 09:29:51,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-06 09:29:51,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:51,095 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] [2025-02-06 09:29:51,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:29:51,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -379747242, now seen corresponding path program 1 times [2025-02-06 09:29:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033349742] [2025-02-06 09:29:51,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:51,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:29:51,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:29:51,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:51,134 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-06 09:29:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:51,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033349742] [2025-02-06 09:29:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033349742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649222867] [2025-02-06 09:29:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:51,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:51,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:51,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-02-06 09:29:51,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-06 09:29:51,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:51,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-02-06 09:29:51,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:51,324 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2025-02-06 09:29:51,324 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-06 09:29:51,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6801 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2025-02-06 09:29:51,335 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2025-02-06 09:29:51,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2025-02-06 09:29:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-02-06 09:29:51,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-02-06 09:29:51,338 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2025-02-06 09:29:51,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2025-02-06 09:29:51,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:51,346 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2025-02-06 09:29:51,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2025-02-06 09:29:51,349 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2025-02-06 09:29:51,351 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2025-02-06 09:29:51,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-06 09:29:51,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:51,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:51,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:29:51,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:51,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1401559208, now seen corresponding path program 1 times [2025-02-06 09:29:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:51,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343451766] [2025-02-06 09:29:51,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:29:51,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:29:51,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:51,988 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-06 09:29:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343451766] [2025-02-06 09:29:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343451766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:29:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288820090] [2025-02-06 09:29:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:51,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:29:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:29:51,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:52,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 473 [2025-02-06 09:29:52,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-06 09:29:52,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 473 [2025-02-06 09:29:52,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,670 INFO L124 PetriNetUnfolderBase]: 429/2642 cut-off events. [2025-02-06 09:29:52,670 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-02-06 09:29:52,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 2642 events. 429/2642 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19514 event pairs, 288 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 3309. Up to 691 conditions per place. [2025-02-06 09:29:52,684 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 52 selfloop transitions, 10 changer transitions 0/426 dead transitions. [2025-02-06 09:29:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 426 transitions, 982 flow [2025-02-06 09:29:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:29:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:29:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2025-02-06 09:29:52,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661028893587033 [2025-02-06 09:29:52,689 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 6 states and 2458 transitions. [2025-02-06 09:29:52,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 426 transitions, 982 flow [2025-02-06 09:29:52,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 426 transitions, 981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:52,695 INFO L231 Difference]: Finished difference. Result has 421 places, 426 transitions, 877 flow [2025-02-06 09:29:52,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=877, PETRI_PLACES=421, PETRI_TRANSITIONS=426} [2025-02-06 09:29:52,698 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -15 predicate places. [2025-02-06 09:29:52,699 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 426 transitions, 877 flow [2025-02-06 09:29:52,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 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-06 09:29:52,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:52,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:52,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:29:52,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1634125223, now seen corresponding path program 1 times [2025-02-06 09:29:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-02-06 09:29:52,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:52,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:29:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:29:52,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:52,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:52,738 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-06 09:29:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133228821] [2025-02-06 09:29:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133228821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597408204] [2025-02-06 09:29:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:52,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:52,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:52,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:52,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-06 09:29:52,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 426 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:52,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-06 09:29:52,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,817 INFO L124 PetriNetUnfolderBase]: 32/661 cut-off events. [2025-02-06 09:29:52,818 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-06 09:29:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 661 events. 32/661 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2482 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 675. Up to 28 conditions per place. [2025-02-06 09:29:52,823 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-02-06 09:29:52,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 901 flow [2025-02-06 09:29:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:52,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:52,826 INFO L175 Difference]: Start difference. First operand has 421 places, 426 transitions, 877 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:52,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 901 flow [2025-02-06 09:29:52,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 425 transitions, 881 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:52,831 INFO L231 Difference]: Finished difference. Result has 417 places, 425 transitions, 859 flow [2025-02-06 09:29:52,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=417, PETRI_TRANSITIONS=425} [2025-02-06 09:29:52,833 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -19 predicate places. [2025-02-06 09:29:52,833 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 425 transitions, 859 flow [2025-02-06 09:29:52,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:52,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:52,834 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-06 09:29:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:29:52,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 548041319, now seen corresponding path program 1 times [2025-02-06 09:29:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940046919] [2025-02-06 09:29:52,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:52,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:29:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:29:52,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:52,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:52,870 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-06 09:29:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940046919] [2025-02-06 09:29:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940046919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048259054] [2025-02-06 09:29:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:52,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:52,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:52,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:52,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 473 [2025-02-06 09:29:52,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 425 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-06 09:29:52,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 473 [2025-02-06 09:29:52,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,985 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-02-06 09:29:52,985 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-06 09:29:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5751 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1089. Up to 82 conditions per place. [2025-02-06 09:29:52,992 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-02-06 09:29:52,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 420 transitions, 879 flow [2025-02-06 09:29:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2025-02-06 09:29:52,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506694855532065 [2025-02-06 09:29:52,995 INFO L175 Difference]: Start difference. First operand has 417 places, 425 transitions, 859 flow. Second operand 3 states and 1349 transitions. [2025-02-06 09:29:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 420 transitions, 879 flow [2025-02-06 09:29:53,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,012 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2025-02-06 09:29:53,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2025-02-06 09:29:53,016 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-02-06 09:29:53,016 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2025-02-06 09:29:53,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 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-06 09:29:53,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:53,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:29:53,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1383691439, now seen corresponding path program 1 times [2025-02-06 09:29:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059619345] [2025-02-06 09:29:53,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:29:53,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:29:53,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,057 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-06 09:29:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059619345] [2025-02-06 09:29:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059619345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143969907] [2025-02-06 09:29:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 473 [2025-02-06 09:29:53,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:53,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 473 [2025-02-06 09:29:53,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,136 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2025-02-06 09:29:53,136 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-06 09:29:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2314 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-02-06 09:29:53,143 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-02-06 09:29:53,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2025-02-06 09:29:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:53,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:53,148 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:53,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2025-02-06 09:29:53,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:53,153 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2025-02-06 09:29:53,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2025-02-06 09:29:53,155 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2025-02-06 09:29:53,155 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2025-02-06 09:29:53,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:53,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,156 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] [2025-02-06 09:29:53,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:29:53,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash -798593511, now seen corresponding path program 1 times [2025-02-06 09:29:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-06 09:29:53,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 09:29:53,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 09:29:53,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,189 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-06 09:29:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456001830] [2025-02-06 09:29:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456001830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116268836] [2025-02-06 09:29:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-06 09:29:53,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:53,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-06 09:29:53,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,293 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2025-02-06 09:29:53,293 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:29:53,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6593 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2025-02-06 09:29:53,300 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-02-06 09:29:53,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2025-02-06 09:29:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:53,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:53,302 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:53,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2025-02-06 09:29:53,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,310 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2025-02-06 09:29:53,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2025-02-06 09:29:53,311 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-06 09:29:53,311 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2025-02-06 09:29:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:53,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:29:53,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1350811354, now seen corresponding path program 1 times [2025-02-06 09:29:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-02-06 09:29:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:29:53,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:29:53,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,345 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-06 09:29:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852433967] [2025-02-06 09:29:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852433967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936981879] [2025-02-06 09:29:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-06 09:29:53,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:53,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-06 09:29:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,463 INFO L124 PetriNetUnfolderBase]: 70/1083 cut-off events. [2025-02-06 09:29:53,463 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-02-06 09:29:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 1083 events. 70/1083 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6228 event pairs, 16 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1111. Up to 61 conditions per place. [2025-02-06 09:29:53,468 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-02-06 09:29:53,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2025-02-06 09:29:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:53,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:53,470 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:53,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2025-02-06 09:29:53,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:53,476 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2025-02-06 09:29:53,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2025-02-06 09:29:53,477 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-02-06 09:29:53,477 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2025-02-06 09:29:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:53,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,478 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] [2025-02-06 09:29:53,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:29:53,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1770409525, now seen corresponding path program 1 times [2025-02-06 09:29:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715685558] [2025-02-06 09:29:53,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 09:29:53,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 09:29:53,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,519 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-06 09:29:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715685558] [2025-02-06 09:29:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715685558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778979191] [2025-02-06 09:29:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:29:53,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:29:53,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:29:53,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,616 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2025-02-06 09:29:53,616 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-02-06 09:29:53,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4219 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2025-02-06 09:29:53,621 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-02-06 09:29:53,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2025-02-06 09:29:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 09:29:53,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-06 09:29:53,624 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2025-02-06 09:29:53,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2025-02-06 09:29:53,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:53,629 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2025-02-06 09:29:53,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2025-02-06 09:29:53,630 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-06 09:29:53,630 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2025-02-06 09:29:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:29:53,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,631 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] [2025-02-06 09:29:53,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:29:53,631 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash -889885005, now seen corresponding path program 1 times [2025-02-06 09:29:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620288434] [2025-02-06 09:29:53,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 09:29:53,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 09:29:53,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,681 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-06 09:29:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620288434] [2025-02-06 09:29:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620288434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:29:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233317480] [2025-02-06 09:29:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-06 09:29:53,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-06 09:29:53,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-06 09:29:53,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,758 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2025-02-06 09:29:53,759 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-06 09:29:53,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3828 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-02-06 09:29:53,763 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2025-02-06 09:29:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2025-02-06 09:29:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-02-06 09:29:53,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-02-06 09:29:53,766 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2025-02-06 09:29:53,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2025-02-06 09:29:53,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,771 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2025-02-06 09:29:53,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2025-02-06 09:29:53,773 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-02-06 09:29:53,773 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2025-02-06 09:29:53,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-06 09:29:53,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,774 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] [2025-02-06 09:29:53,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:29:53,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:53,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -419150337, now seen corresponding path program 1 times [2025-02-06 09:29:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965201785] [2025-02-06 09:29:53,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 09:29:53,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 09:29:53,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,815 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-06 09:29:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965201785] [2025-02-06 09:29:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965201785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602120665] [2025-02-06 09:29:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-06 09:29:53,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:53,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-06 09:29:53,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:54,003 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2025-02-06 09:29:54,003 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-02-06 09:29:54,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8597 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2025-02-06 09:29:54,017 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2025-02-06 09:29:54,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2025-02-06 09:29:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-06 09:29:54,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-02-06 09:29:54,021 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2025-02-06 09:29:54,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2025-02-06 09:29:54,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:54,028 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2025-02-06 09:29:54,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2025-02-06 09:29:54,029 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2025-02-06 09:29:54,029 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2025-02-06 09:29:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 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-06 09:29:54,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:54,030 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-06 09:29:54,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:29:54,031 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:54,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1207810903, now seen corresponding path program 1 times [2025-02-06 09:29:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819264911] [2025-02-06 09:29:54,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:54,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 09:29:54,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:29:54,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:54,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:54,073 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-06 09:29:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819264911] [2025-02-06 09:29:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819264911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80974648] [2025-02-06 09:29:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:54,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:29:54,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:29:54,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:54,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:29:54,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:54,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][279], [Black: 493#true, 485#(= |#race~n2~0| 0), 227#L102-10true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), 509#true, Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), 491#(= |#race~count1~0| 0), Black: 505#true, Black: 489#true, 473#(= |#race~n1~0| 0)]) [2025-02-06 09:29:54,177 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-02-06 09:29:54,177 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-02-06 09:29:54,177 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-02-06 09:29:54,177 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-02-06 09:29:54,181 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2025-02-06 09:29:54,181 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2025-02-06 09:29:54,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4463 event pairs, 6 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2025-02-06 09:29:54,187 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-06 09:29:54,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2025-02-06 09:29:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 09:29:54,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-06 09:29:54,190 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2025-02-06 09:29:54,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2025-02-06 09:29:54,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:54,196 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2025-02-06 09:29:54,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2025-02-06 09:29:54,197 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2025-02-06 09:29:54,197 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2025-02-06 09:29:54,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:29:54,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:54,198 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] [2025-02-06 09:29:54,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:29:54,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:54,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1150572990, now seen corresponding path program 1 times [2025-02-06 09:29:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768697639] [2025-02-06 09:29:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:54,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 09:29:54,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 09:29:54,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:54,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:54,249 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-06 09:29:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768697639] [2025-02-06 09:29:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768697639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:29:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593731325] [2025-02-06 09:29:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:54,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:54,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:54,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:54,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-06 09:29:54,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-06 09:29:54,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:54,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-06 09:29:54,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:54,372 INFO L124 PetriNetUnfolderBase]: 81/1037 cut-off events. [2025-02-06 09:29:54,372 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-02-06 09:29:54,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1037 events. 81/1037 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5434 event pairs, 12 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 86 conditions per place. [2025-02-06 09:29:54,377 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2025-02-06 09:29:54,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2025-02-06 09:29:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2025-02-06 09:29:54,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9640591966173362 [2025-02-06 09:29:54,379 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2025-02-06 09:29:54,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2025-02-06 09:29:54,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:54,384 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2025-02-06 09:29:54,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-02-06 09:29:54,384 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2025-02-06 09:29:54,384 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2025-02-06 09:29:54,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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-06 09:29:54,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:54,385 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] [2025-02-06 09:29:54,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:29:54,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:54,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1749233344, now seen corresponding path program 1 times [2025-02-06 09:29:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89876157] [2025-02-06 09:29:54,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:54,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 09:29:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 09:29:54,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:54,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:54,424 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-06 09:29:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89876157] [2025-02-06 09:29:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89876157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599348792] [2025-02-06 09:29:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:54,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:54,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:54,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:29:54,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:29:54,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:54,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:29:54,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:54,557 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2025-02-06 09:29:54,557 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-02-06 09:29:54,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7254 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2025-02-06 09:29:54,566 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-02-06 09:29:54,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2025-02-06 09:29:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 09:29:54,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-06 09:29:54,568 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2025-02-06 09:29:54,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2025-02-06 09:29:54,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:54,574 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2025-02-06 09:29:54,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-02-06 09:29:54,574 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2025-02-06 09:29:54,574 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2025-02-06 09:29:54,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:29:54,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:54,575 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] [2025-02-06 09:29:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:29:54,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:54,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash -28159579, now seen corresponding path program 1 times [2025-02-06 09:29:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:54,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361457708] [2025-02-06 09:29:54,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:54,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:29:54,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:29:54,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:54,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:54,729 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-06 09:29:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361457708] [2025-02-06 09:29:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361457708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:29:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906164881] [2025-02-06 09:29:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:29:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:54,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:29:54,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:29:55,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-06 09:29:55,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-06 09:29:55,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:55,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-06 09:29:55,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:55,314 INFO L124 PetriNetUnfolderBase]: 126/2072 cut-off events. [2025-02-06 09:29:55,314 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2025-02-06 09:29:55,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 2072 events. 126/2072 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14254 event pairs, 17 based on Foata normal form. 6/1858 useless extension candidates. Maximal degree in co-relation 2404. Up to 72 conditions per place. [2025-02-06 09:29:55,326 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2025-02-06 09:29:55,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 439 transitions, 1077 flow [2025-02-06 09:29:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:29:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:29:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2025-02-06 09:29:55,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916138125440451 [2025-02-06 09:29:55,335 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 12 states and 5200 transitions. [2025-02-06 09:29:55,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 439 transitions, 1077 flow [2025-02-06 09:29:55,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 439 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:55,342 INFO L231 Difference]: Finished difference. Result has 425 places, 422 transitions, 981 flow [2025-02-06 09:29:55,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=981, PETRI_PLACES=425, PETRI_TRANSITIONS=422} [2025-02-06 09:29:55,343 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-02-06 09:29:55,343 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 422 transitions, 981 flow [2025-02-06 09:29:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 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-06 09:29:55,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:55,344 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] [2025-02-06 09:29:55,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:29:55,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1273928095, now seen corresponding path program 1 times [2025-02-06 09:29:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535514286] [2025-02-06 09:29:55,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:55,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:29:55,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:29:55,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:55,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:55,381 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-06 09:29:55,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535514286] [2025-02-06 09:29:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535514286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794915199] [2025-02-06 09:29:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:55,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:55,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:55,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 473 [2025-02-06 09:29:55,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 422 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-06 09:29:55,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:55,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 473 [2025-02-06 09:29:55,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:55,619 INFO L124 PetriNetUnfolderBase]: 147/2144 cut-off events. [2025-02-06 09:29:55,620 INFO L125 PetriNetUnfolderBase]: For 55/59 co-relation queries the response was YES. [2025-02-06 09:29:55,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2144 events. 147/2144 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14690 event pairs, 12 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 2511. Up to 130 conditions per place. [2025-02-06 09:29:55,628 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 16 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-02-06 09:29:55,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 423 transitions, 1022 flow [2025-02-06 09:29:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-02-06 09:29:55,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9584214235377027 [2025-02-06 09:29:55,631 INFO L175 Difference]: Start difference. First operand has 425 places, 422 transitions, 981 flow. Second operand 3 states and 1360 transitions. [2025-02-06 09:29:55,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 423 transitions, 1022 flow [2025-02-06 09:29:55,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:55,639 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2025-02-06 09:29:55,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2025-02-06 09:29:55,640 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2025-02-06 09:29:55,640 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2025-02-06 09:29:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 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-06 09:29:55,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:55,641 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] [2025-02-06 09:29:55,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:29:55,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:55,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash 68317135, now seen corresponding path program 1 times [2025-02-06 09:29:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:55,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506699307] [2025-02-06 09:29:55,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 09:29:55,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 09:29:55,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:55,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:55,692 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-06 09:29:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:55,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506699307] [2025-02-06 09:29:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506699307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748436056] [2025-02-06 09:29:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:55,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:55,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:55,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:29:55,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:29:55,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:55,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:29:55,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:55,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][264], [Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 546#true, 491#(= |#race~count1~0| 0), Black: 489#true, 548#(= |#race~get2~0| 0), 550#true, 473#(= |#race~n1~0| 0), Black: 493#true, 227#L102-10true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 505#true, Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), 520#true, Black: 539#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2025-02-06 09:29:55,858 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-02-06 09:29:55,858 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-02-06 09:29:55,858 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-02-06 09:29:55,858 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-02-06 09:29:55,862 INFO L124 PetriNetUnfolderBase]: 114/1636 cut-off events. [2025-02-06 09:29:55,863 INFO L125 PetriNetUnfolderBase]: For 56/63 co-relation queries the response was YES. [2025-02-06 09:29:55,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1636 events. 114/1636 cut-off events. For 56/63 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10115 event pairs, 10 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 1952. Up to 96 conditions per place. [2025-02-06 09:29:55,876 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-02-06 09:29:55,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2025-02-06 09:29:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-02-06 09:29:55,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959830866807611 [2025-02-06 09:29:55,879 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2025-02-06 09:29:55,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2025-02-06 09:29:55,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:55,886 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2025-02-06 09:29:55,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-02-06 09:29:55,887 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2025-02-06 09:29:55,887 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2025-02-06 09:29:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:29:55,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:55,888 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] [2025-02-06 09:29:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:29:55,888 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -596954393, now seen corresponding path program 1 times [2025-02-06 09:29:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481490451] [2025-02-06 09:29:55,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:55,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:29:55,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:29:55,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:55,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:56,046 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-06 09:29:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481490451] [2025-02-06 09:29:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481490451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:56,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:29:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049985922] [2025-02-06 09:29:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:56,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:29:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:29:56,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:29:56,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-06 09:29:56,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-06 09:29:56,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:56,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-06 09:29:56,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:56,660 INFO L124 PetriNetUnfolderBase]: 123/1434 cut-off events. [2025-02-06 09:29:56,660 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2025-02-06 09:29:56,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1434 events. 123/1434 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8371 event pairs, 22 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 1838. Up to 159 conditions per place. [2025-02-06 09:29:56,681 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 48 selfloop transitions, 17 changer transitions 0/443 dead transitions. [2025-02-06 09:29:56,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 443 transitions, 1181 flow [2025-02-06 09:29:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:29:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:29:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4772 transitions. [2025-02-06 09:29:56,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171631750912935 [2025-02-06 09:29:56,691 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 11 states and 4772 transitions. [2025-02-06 09:29:56,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 443 transitions, 1181 flow [2025-02-06 09:29:56,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 443 transitions, 1177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:56,700 INFO L231 Difference]: Finished difference. Result has 436 places, 424 transitions, 1058 flow [2025-02-06 09:29:56,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1058, PETRI_PLACES=436, PETRI_TRANSITIONS=424} [2025-02-06 09:29:56,702 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 0 predicate places. [2025-02-06 09:29:56,702 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 424 transitions, 1058 flow [2025-02-06 09:29:56,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-06 09:29:56,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:56,704 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] [2025-02-06 09:29:56,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:29:56,705 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:56,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1831361245, now seen corresponding path program 1 times [2025-02-06 09:29:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:56,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-02-06 09:29:56,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 09:29:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 09:29:56,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:29:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-02-06 09:29:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349513331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:56,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:29:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772289134] [2025-02-06 09:29:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:56,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:29:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:56,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:29:56,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:29:57,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-06 09:29:57,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 424 transitions, 1058 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-06 09:29:57,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:57,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-06 09:29:57,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:57,751 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2025-02-06 09:29:57,751 INFO L125 PetriNetUnfolderBase]: For 206/235 co-relation queries the response was YES. [2025-02-06 09:29:57,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 2781 events. 189/2781 cut-off events. For 206/235 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20666 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3607. Up to 129 conditions per place. [2025-02-06 09:29:57,773 INFO L140 encePairwiseOnDemand]: 457/473 looper letters, 50 selfloop transitions, 21 changer transitions 0/449 dead transitions. [2025-02-06 09:29:57,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 449 transitions, 1303 flow [2025-02-06 09:29:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:29:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:29:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2025-02-06 09:29:57,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154334038054969 [2025-02-06 09:29:57,780 INFO L175 Difference]: Start difference. First operand has 436 places, 424 transitions, 1058 flow. Second operand 11 states and 4763 transitions. [2025-02-06 09:29:57,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 449 transitions, 1303 flow [2025-02-06 09:29:57,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 449 transitions, 1282 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 09:29:57,790 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1191 flow [2025-02-06 09:29:57,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1191, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-02-06 09:29:57,792 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 8 predicate places. [2025-02-06 09:29:57,792 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1191 flow [2025-02-06 09:29:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 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-06 09:29:57,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:57,794 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] [2025-02-06 09:29:57,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:29:57,795 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -46960097, now seen corresponding path program 1 times [2025-02-06 09:29:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176867935] [2025-02-06 09:29:57,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:29:57,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:29:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:29:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176867935] [2025-02-06 09:29:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176867935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:29:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090496466] [2025-02-06 09:29:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:57,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:29:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:57,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:29:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:29:58,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2025-02-06 09:29:58,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-06 09:29:58,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2025-02-06 09:29:58,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,490 INFO L124 PetriNetUnfolderBase]: 162/1951 cut-off events. [2025-02-06 09:29:58,490 INFO L125 PetriNetUnfolderBase]: For 294/299 co-relation queries the response was YES. [2025-02-06 09:29:58,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1951 events. 162/1951 cut-off events. For 294/299 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12698 event pairs, 25 based on Foata normal form. 8/1815 useless extension candidates. Maximal degree in co-relation 2695. Up to 164 conditions per place. [2025-02-06 09:29:58,505 INFO L140 encePairwiseOnDemand]: 456/473 looper letters, 44 selfloop transitions, 24 changer transitions 0/455 dead transitions. [2025-02-06 09:29:58,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 455 transitions, 1402 flow [2025-02-06 09:29:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:29:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:29:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2025-02-06 09:29:58,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145525017618041 [2025-02-06 09:29:58,513 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1191 flow. Second operand 12 states and 5191 transitions. [2025-02-06 09:29:58,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 455 transitions, 1402 flow [2025-02-06 09:29:58,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 455 transitions, 1398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:58,523 INFO L231 Difference]: Finished difference. Result has 458 places, 447 transitions, 1327 flow [2025-02-06 09:29:58,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1327, PETRI_PLACES=458, PETRI_TRANSITIONS=447} [2025-02-06 09:29:58,525 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2025-02-06 09:29:58,525 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 447 transitions, 1327 flow [2025-02-06 09:29:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 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-06 09:29:58,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,526 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-06 09:29:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:29:58,527 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:58,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1815725443, now seen corresponding path program 1 times [2025-02-06 09:29:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-02-06 09:29:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 09:29:58,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 09:29:58,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:58,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:58,565 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-06 09:29:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-02-06 09:29:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53343035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:58,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:58,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:29:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604502615] [2025-02-06 09:29:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:58,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:58,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:58,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-06 09:29:58,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 447 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-06 09:29:58,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-06 09:29:58,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,893 INFO L124 PetriNetUnfolderBase]: 145/2656 cut-off events. [2025-02-06 09:29:58,893 INFO L125 PetriNetUnfolderBase]: For 496/503 co-relation queries the response was YES. [2025-02-06 09:29:58,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 2656 events. 145/2656 cut-off events. For 496/503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19465 event pairs, 17 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 3556. Up to 77 conditions per place. [2025-02-06 09:29:58,917 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-02-06 09:29:58,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 452 transitions, 1374 flow [2025-02-06 09:29:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-02-06 09:29:58,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-02-06 09:29:58,919 INFO L175 Difference]: Start difference. First operand has 458 places, 447 transitions, 1327 flow. Second operand 3 states and 1372 transitions. [2025-02-06 09:29:58,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 452 transitions, 1374 flow [2025-02-06 09:29:58,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 452 transitions, 1357 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:29:58,929 INFO L231 Difference]: Finished difference. Result has 456 places, 449 transitions, 1330 flow [2025-02-06 09:29:58,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=456, PETRI_TRANSITIONS=449} [2025-02-06 09:29:58,930 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 20 predicate places. [2025-02-06 09:29:58,931 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 449 transitions, 1330 flow [2025-02-06 09:29:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-06 09:29:58,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,931 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-06 09:29:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:29:58,931 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:58,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash -753244587, now seen corresponding path program 2 times [2025-02-06 09:29:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813268786] [2025-02-06 09:29:58,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:29:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:58,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 1 equivalence classes. [2025-02-06 09:29:58,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 09:29:58,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:29:58,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:58,974 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-06 09:29:58,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:58,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813268786] [2025-02-06 09:29:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813268786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:29:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198122026] [2025-02-06 09:29:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:58,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:58,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:58,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:58,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 473 [2025-02-06 09:29:58,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 449 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-06 09:29:58,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 473 [2025-02-06 09:29:58,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:59,233 INFO L124 PetriNetUnfolderBase]: 139/2631 cut-off events. [2025-02-06 09:29:59,234 INFO L125 PetriNetUnfolderBase]: For 669/689 co-relation queries the response was YES. [2025-02-06 09:29:59,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3771 conditions, 2631 events. 139/2631 cut-off events. For 669/689 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19168 event pairs, 13 based on Foata normal form. 13/2478 useless extension candidates. Maximal degree in co-relation 3675. Up to 72 conditions per place. [2025-02-06 09:29:59,247 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 17 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-02-06 09:29:59,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 454 transitions, 1385 flow [2025-02-06 09:29:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2025-02-06 09:29:59,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966878083157153 [2025-02-06 09:29:59,249 INFO L175 Difference]: Start difference. First operand has 456 places, 449 transitions, 1330 flow. Second operand 3 states and 1372 transitions. [2025-02-06 09:29:59,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 454 transitions, 1385 flow [2025-02-06 09:29:59,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 454 transitions, 1383 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:59,259 INFO L231 Difference]: Finished difference. Result has 459 places, 451 transitions, 1352 flow [2025-02-06 09:29:59,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=459, PETRI_TRANSITIONS=451} [2025-02-06 09:29:59,260 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 23 predicate places. [2025-02-06 09:29:59,260 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 451 transitions, 1352 flow [2025-02-06 09:29:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 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-06 09:29:59,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:59,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:29:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:29:59,261 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1726207523, now seen corresponding path program 1 times [2025-02-06 09:29:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720093375] [2025-02-06 09:29:59,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 09:29:59,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 09:29:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:59,297 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-06 09:29:59,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:59,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720093375] [2025-02-06 09:29:59,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720093375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:59,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667484888] [2025-02-06 09:29:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:59,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:59,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-06 09:29:59,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 451 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 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-06 09:29:59,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:59,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-06 09:29:59,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:59,533 INFO L124 PetriNetUnfolderBase]: 126/2491 cut-off events. [2025-02-06 09:29:59,534 INFO L125 PetriNetUnfolderBase]: For 548/590 co-relation queries the response was YES. [2025-02-06 09:29:59,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 2491 events. 126/2491 cut-off events. For 548/590 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17832 event pairs, 10 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 3523. Up to 74 conditions per place. [2025-02-06 09:29:59,554 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 12 selfloop transitions, 1 changer transitions 0/448 dead transitions. [2025-02-06 09:29:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 448 transitions, 1372 flow [2025-02-06 09:29:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-02-06 09:29:59,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-02-06 09:29:59,556 INFO L175 Difference]: Start difference. First operand has 459 places, 451 transitions, 1352 flow. Second operand 3 states and 1357 transitions. [2025-02-06 09:29:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 448 transitions, 1372 flow [2025-02-06 09:29:59,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 448 transitions, 1366 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:59,567 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 1342 flow [2025-02-06 09:29:59,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1342, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2025-02-06 09:29:59,568 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 21 predicate places. [2025-02-06 09:29:59,568 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 1342 flow [2025-02-06 09:29:59,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 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-06 09:29:59,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:59,570 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] [2025-02-06 09:29:59,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:29:59,570 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:59,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash -724322148, now seen corresponding path program 1 times [2025-02-06 09:29:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:59,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487363406] [2025-02-06 09:29:59,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:29:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:29:59,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:59,601 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-06 09:29:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:59,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487363406] [2025-02-06 09:29:59,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487363406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:59,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:59,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164237560] [2025-02-06 09:29:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:59,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:59,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:59,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:59,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 473 [2025-02-06 09:29:59,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:59,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:59,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 473 [2025-02-06 09:29:59,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:59,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1175] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][271], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), 491#(= |#race~count1~0| 0), 473#(= |#race~n1~0| 0), Black: 582#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 581#(<= ~n2~0 0), Black: 595#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 601#true, Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), Black: 539#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 632#(= ~count2~0 ~count1~0), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, Black: 620#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 548#(= |#race~get2~0| 0), Black: 606#(<= ~n2~0 0), Black: 607#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 493#true, 227#L102-10true, Black: 627#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 630#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 635#true, Black: 558#(<= ~n1~0 0), Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 520#true]) [2025-02-06 09:29:59,867 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2025-02-06 09:29:59,867 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-06 09:29:59,867 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-02-06 09:29:59,867 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-02-06 09:29:59,871 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2025-02-06 09:29:59,871 INFO L125 PetriNetUnfolderBase]: For 421/447 co-relation queries the response was YES. [2025-02-06 09:29:59,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 2358 events. 128/2358 cut-off events. For 421/447 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16492 event pairs, 10 based on Foata normal form. 9/2240 useless extension candidates. Maximal degree in co-relation 3266. Up to 99 conditions per place. [2025-02-06 09:29:59,888 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 6 selfloop transitions, 0 changer transitions 86/447 dead transitions. [2025-02-06 09:29:59,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 447 transitions, 1368 flow [2025-02-06 09:29:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:29:59,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:29:59,890 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 1342 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:29:59,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 447 transitions, 1368 flow [2025-02-06 09:29:59,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 447 transitions, 1367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:59,898 INFO L231 Difference]: Finished difference. Result has 455 places, 361 transitions, 932 flow [2025-02-06 09:29:59,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=455, PETRI_TRANSITIONS=361} [2025-02-06 09:29:59,899 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, 19 predicate places. [2025-02-06 09:29:59,899 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 361 transitions, 932 flow [2025-02-06 09:29:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-06 09:29:59,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:59,900 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] [2025-02-06 09:29:59,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:29:59,900 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:29:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1826257537, now seen corresponding path program 1 times [2025-02-06 09:29:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117971916] [2025-02-06 09:29:59,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 09:29:59,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 09:29:59,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117971916] [2025-02-06 09:30:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117971916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:00,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:00,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465890004] [2025-02-06 09:30:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:00,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:00,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:00,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:00,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:00,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-06 09:30:00,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 361 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-06 09:30:00,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:00,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-06 09:30:00,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:00,763 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2025-02-06 09:30:00,763 INFO L125 PetriNetUnfolderBase]: For 209/210 co-relation queries the response was YES. [2025-02-06 09:30:00,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1368 events. 85/1368 cut-off events. For 209/210 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8413 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 1958. Up to 43 conditions per place. [2025-02-06 09:30:00,774 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2025-02-06 09:30:00,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 364 transitions, 1008 flow [2025-02-06 09:30:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-06 09:30:00,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-06 09:30:00,777 INFO L175 Difference]: Start difference. First operand has 455 places, 361 transitions, 932 flow. Second operand 6 states and 2637 transitions. [2025-02-06 09:30:00,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 364 transitions, 1008 flow [2025-02-06 09:30:00,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 364 transitions, 908 flow, removed 24 selfloop flow, removed 26 redundant places. [2025-02-06 09:30:00,783 INFO L231 Difference]: Finished difference. Result has 374 places, 360 transitions, 851 flow [2025-02-06 09:30:00,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=374, PETRI_TRANSITIONS=360} [2025-02-06 09:30:00,785 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-02-06 09:30:00,787 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 360 transitions, 851 flow [2025-02-06 09:30:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-06 09:30:00,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:00,789 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] [2025-02-06 09:30:00,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:30:00,789 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:30:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1274001725, now seen corresponding path program 1 times [2025-02-06 09:30:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357723586] [2025-02-06 09:30:00,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 09:30:00,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 09:30:00,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357723586] [2025-02-06 09:30:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357723586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892404502] [2025-02-06 09:30:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:01,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:01,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-06 09:30:01,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 360 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-06 09:30:01,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-06 09:30:01,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,634 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2025-02-06 09:30:01,635 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-02-06 09:30:01,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1146 events. 89/1146 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6510 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1516. Up to 66 conditions per place. [2025-02-06 09:30:01,642 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2025-02-06 09:30:01,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 363 transitions, 923 flow [2025-02-06 09:30:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-06 09:30:01,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-06 09:30:01,646 INFO L175 Difference]: Start difference. First operand has 374 places, 360 transitions, 851 flow. Second operand 6 states and 2637 transitions. [2025-02-06 09:30:01,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 363 transitions, 923 flow [2025-02-06 09:30:01,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 363 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:30:01,671 INFO L231 Difference]: Finished difference. Result has 374 places, 359 transitions, 857 flow [2025-02-06 09:30:01,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=374, PETRI_TRANSITIONS=359} [2025-02-06 09:30:01,672 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2025-02-06 09:30:01,672 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 359 transitions, 857 flow [2025-02-06 09:30:01,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-06 09:30:01,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,674 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] [2025-02-06 09:30:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:30:01,674 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:30:01,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1809978341, now seen corresponding path program 1 times [2025-02-06 09:30:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-02-06 09:30:01,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 09:30:01,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 09:30:01,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827030066] [2025-02-06 09:30:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827030066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121045417] [2025-02-06 09:30:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:01,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:02,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-06 09:30:02,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 359 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-06 09:30:02,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-06 09:30:02,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,508 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2025-02-06 09:30:02,508 INFO L125 PetriNetUnfolderBase]: For 52/53 co-relation queries the response was YES. [2025-02-06 09:30:02,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1333 events. 79/1333 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8006 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1740. Up to 42 conditions per place. [2025-02-06 09:30:02,516 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2025-02-06 09:30:02,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 361 transitions, 927 flow [2025-02-06 09:30:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-06 09:30:02,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-06 09:30:02,519 INFO L175 Difference]: Start difference. First operand has 374 places, 359 transitions, 857 flow. Second operand 6 states and 2637 transitions. [2025-02-06 09:30:02,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 361 transitions, 927 flow [2025-02-06 09:30:02,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:30:02,523 INFO L231 Difference]: Finished difference. Result has 373 places, 357 transitions, 856 flow [2025-02-06 09:30:02,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=373, PETRI_TRANSITIONS=357} [2025-02-06 09:30:02,525 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -63 predicate places. [2025-02-06 09:30:02,525 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 357 transitions, 856 flow [2025-02-06 09:30:02,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 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-06 09:30:02,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,526 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] [2025-02-06 09:30:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:30:02,526 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:30:02,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1802929831, now seen corresponding path program 1 times [2025-02-06 09:30:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910407160] [2025-02-06 09:30:02,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 09:30:02,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 09:30:02,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910407160] [2025-02-06 09:30:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910407160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29997125] [2025-02-06 09:30:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:02,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:03,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 473 [2025-02-06 09:30:03,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 357 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-06 09:30:03,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 473 [2025-02-06 09:30:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,439 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2025-02-06 09:30:03,439 INFO L125 PetriNetUnfolderBase]: For 90/93 co-relation queries the response was YES. [2025-02-06 09:30:03,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1120 events. 84/1120 cut-off events. For 90/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6165 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1496. Up to 61 conditions per place. [2025-02-06 09:30:03,446 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2025-02-06 09:30:03,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 359 transitions, 926 flow [2025-02-06 09:30:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2025-02-06 09:30:03,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291754756871036 [2025-02-06 09:30:03,448 INFO L175 Difference]: Start difference. First operand has 373 places, 357 transitions, 856 flow. Second operand 6 states and 2637 transitions. [2025-02-06 09:30:03,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 359 transitions, 926 flow [2025-02-06 09:30:03,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 359 transitions, 914 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:03,454 INFO L231 Difference]: Finished difference. Result has 371 places, 355 transitions, 852 flow [2025-02-06 09:30:03,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=371, PETRI_TRANSITIONS=355} [2025-02-06 09:30:03,456 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -65 predicate places. [2025-02-06 09:30:03,456 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 355 transitions, 852 flow [2025-02-06 09:30:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 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-06 09:30:03,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:03,458 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-06 09:30:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:30:03,458 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:30:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 720081319, now seen corresponding path program 1 times [2025-02-06 09:30:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096173601] [2025-02-06 09:30:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 09:30:03,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 09:30:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:03,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096173601] [2025-02-06 09:30:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096173601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296434314] [2025-02-06 09:30:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:03,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:03,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:03,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:03,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:30:03,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 355 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:30:03,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:30:03,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,617 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2025-02-06 09:30:03,618 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-02-06 09:30:03,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1173 events. 66/1173 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6328 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1485. Up to 36 conditions per place. [2025-02-06 09:30:03,625 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-02-06 09:30:03,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 355 transitions, 871 flow [2025-02-06 09:30:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-02-06 09:30:03,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95630725863284 [2025-02-06 09:30:03,628 INFO L175 Difference]: Start difference. First operand has 371 places, 355 transitions, 852 flow. Second operand 3 states and 1357 transitions. [2025-02-06 09:30:03,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 355 transitions, 871 flow [2025-02-06 09:30:03,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 355 transitions, 859 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:03,633 INFO L231 Difference]: Finished difference. Result has 367 places, 354 transitions, 842 flow [2025-02-06 09:30:03,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=367, PETRI_TRANSITIONS=354} [2025-02-06 09:30:03,633 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2025-02-06 09:30:03,634 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 354 transitions, 842 flow [2025-02-06 09:30:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-06 09:30:03,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:03,634 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] [2025-02-06 09:30:03,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:30:03,635 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:30:03,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1012247990, now seen corresponding path program 1 times [2025-02-06 09:30:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808696753] [2025-02-06 09:30:03,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:30:03,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:30:03,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:03,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808696753] [2025-02-06 09:30:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808696753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:03,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:03,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765427345] [2025-02-06 09:30:03,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:03,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:03,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:03,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:03,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:03,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 473 [2025-02-06 09:30:03,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 354 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:30:03,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 473 [2025-02-06 09:30:03,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1114] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][263], [Black: 514#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 646#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 491#(= |#race~count1~0| 0), Black: 653#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 473#(= |#race~n1~0| 0), 158#L100true, 638#true, Black: 587#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 601#true, 632#(= ~count2~0 ~count1~0), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, 548#(= |#race~get2~0| 0), 10#L77true, Black: 493#true, 667#true, Black: 627#(not (= ~count2~0 ~count1~0)), 670#true, 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 630#true, Black: 505#true, 520#true]) [2025-02-06 09:30:03,808 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-02-06 09:30:03,808 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-06 09:30:03,808 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-02-06 09:30:03,808 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-02-06 09:30:03,808 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2025-02-06 09:30:03,808 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-02-06 09:30:03,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1014 events. 65/1014 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4957 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1275. Up to 44 conditions per place. [2025-02-06 09:30:03,814 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-02-06 09:30:03,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 354 transitions, 863 flow [2025-02-06 09:30:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2025-02-06 09:30:03,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9570119802677942 [2025-02-06 09:30:03,816 INFO L175 Difference]: Start difference. First operand has 367 places, 354 transitions, 842 flow. Second operand 3 states and 1358 transitions. [2025-02-06 09:30:03,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 354 transitions, 863 flow [2025-02-06 09:30:03,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 354 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:03,822 INFO L231 Difference]: Finished difference. Result has 366 places, 0 transitions, 0 flow [2025-02-06 09:30:03,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=366, PETRI_TRANSITIONS=0} [2025-02-06 09:30:03,823 INFO L279 CegarLoopForPetriNet]: 436 programPoint places, -70 predicate places. [2025-02-06 09:30:03,823 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 0 transitions, 0 flow [2025-02-06 09:30:03,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 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-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-02-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-02-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-02-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-02-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-02-06 09:30:03,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-02-06 09:30:03,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-02-06 09:30:03,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-02-06 09:30:03,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-02-06 09:30:03,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-02-06 09:30:03,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-02-06 09:30:03,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-02-06 09:30:03,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:30:03,833 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 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-06 09:30:03,839 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:30:03,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:30:03,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:30:03 BasicIcfg [2025-02-06 09:30:03,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:30:03,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:30:03,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:30:03,845 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:30:03,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:49" (3/4) ... [2025-02-06 09:30:03,846 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:30:03,849 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:30:03,849 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:30:03,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 09:30:03,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:30:03,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:30:03,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:30:03,923 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:30:03,923 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:30:03,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:30:03,925 INFO L158 Benchmark]: Toolchain (without parser) took 15170.22ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 106.1MB in the beginning and 203.5MB in the end (delta: -97.4MB). Peak memory consumption was 305.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:03,925 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:03,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.75ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:30:03,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:03,927 INFO L158 Benchmark]: Boogie Preprocessor took 21.10ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:03,927 INFO L158 Benchmark]: IcfgBuilder took 639.75ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 51.9MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 09:30:03,928 INFO L158 Benchmark]: TraceAbstraction took 14181.59ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 50.8MB in the beginning and 211.9MB in the end (delta: -161.1MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. [2025-02-06 09:30:03,928 INFO L158 Benchmark]: Witness Printer took 78.99ms. Allocated memory is still 545.3MB. Free memory was 211.9MB in the beginning and 203.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:03,929 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.75ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.63ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.10ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 88.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 639.75ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 51.9MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14181.59ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 50.8MB in the beginning and 211.9MB in the end (delta: -161.1MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. * Witness Printer took 78.99ms. Allocated memory is still 545.3MB. Free memory was 211.9MB in the beginning and 203.5MB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 49]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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 5 procedures, 668 locations, 94 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: 14.0s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3926 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2410 mSDsluCounter, 3823 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3492 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5505 IncrementalHoareTripleChecker+Invalid, 6134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 331 mSDtfsCounter, 5505 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1352occurred in iteration=25, InterpolantAutomatonStates: 148, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4403 ConstructedInterpolants, 0 QuantifiedInterpolants, 5761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 14/14 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:30:03,947 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