./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:52,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:52,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:52,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:52,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:52,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:52,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:52,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:52,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:52,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:52,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:52,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:52,448 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:52,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:52,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:52,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:52,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:52,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:52,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:52,453 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f [2025-03-04 06:57:52,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:52,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:52,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:52,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:52,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:52,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2025-03-04 06:57:53,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8faa0812/bc4463262a044a2dbe5a50867c994a7c/FLAG012b66206 [2025-03-04 06:57:54,112 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:54,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2025-03-04 06:57:54,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8faa0812/bc4463262a044a2dbe5a50867c994a7c/FLAG012b66206 [2025-03-04 06:57:54,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8faa0812/bc4463262a044a2dbe5a50867c994a7c [2025-03-04 06:57:54,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:54,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:54,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:54,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:54,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:54,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54, skipping insertion in model container [2025-03-04 06:57:54,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:54,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:54,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:54,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:54,797 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:54,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54 WrapperNode [2025-03-04 06:57:54,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:54,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:54,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:54,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:54,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,852 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-03-04 06:57:54,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:54,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:54,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:54,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:54,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:54,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:54,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:54,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:54,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (1/1) ... [2025-03-04 06:57:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:54,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:54,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:57:54,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-03-04 06:57:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:57:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:57:54,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:54,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:54,941 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:55,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:55,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:55,457 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:55,457 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:55,497 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:55,497 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:55,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:55 BoogieIcfgContainer [2025-03-04 06:57:55,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:55,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:55,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:55,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:55,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:54" (1/3) ... [2025-03-04 06:57:55,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bada33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:55, skipping insertion in model container [2025-03-04 06:57:55,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:54" (2/3) ... [2025-03-04 06:57:55,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bada33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:55, skipping insertion in model container [2025-03-04 06:57:55,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:55" (3/3) ... [2025-03-04 06:57:55,508 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-2.i [2025-03-04 06:57:55,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:55,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-race-2.i that has 3 procedures, 386 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-03-04 06:57:55,521 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:55,597 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:57:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 467 transitions, 948 flow [2025-03-04 06:57:55,821 INFO L124 PetriNetUnfolderBase]: 19/586 cut-off events. [2025-03-04 06:57:55,824 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:57:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 586 events. 19/586 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 979 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 374. Up to 6 conditions per place. [2025-03-04 06:57:55,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 467 transitions, 948 flow [2025-03-04 06:57:55,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 395 transitions, 800 flow [2025-03-04 06:57:55,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:55,863 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;@6d0a144b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:55,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-04 06:57:55,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:55,880 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2025-03-04 06:57:55,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:55,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:55,881 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] [2025-03-04 06:57:55,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1663180944, now seen corresponding path program 1 times [2025-03-04 06:57:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504588694] [2025-03-04 06:57:55,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:55,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:55,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 06:57:56,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 06:57:56,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:56,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504588694] [2025-03-04 06:57:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504588694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651304865] [2025-03-04 06:57:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:56,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:56,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:56,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:56,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-04 06:57:56,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:56,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:56,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-04 06:57:56,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:56,970 INFO L124 PetriNetUnfolderBase]: 654/4276 cut-off events. [2025-03-04 06:57:56,971 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:57:56,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 4276 events. 654/4276 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33137 event pairs, 489 based on Foata normal form. 182/3765 useless extension candidates. Maximal degree in co-relation 5080. Up to 1006 conditions per place. [2025-03-04 06:57:56,999 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-03-04 06:57:56,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 842 flow [2025-03-04 06:57:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-03-04 06:57:57,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-03-04 06:57:57,019 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 800 flow. Second operand 3 states and 1303 transitions. [2025-03-04 06:57:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 842 flow [2025-03-04 06:57:57,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:57,034 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 783 flow [2025-03-04 06:57:57,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2025-03-04 06:57:57,040 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -3 predicate places. [2025-03-04 06:57:57,041 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 783 flow [2025-03-04 06:57:57,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:57,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:57,042 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-03-04 06:57:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:57,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 878921608, now seen corresponding path program 1 times [2025-03-04 06:57:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-04 06:57:57,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:57,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:57:57,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:57:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:57,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-03-04 06:57:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:57,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-04 06:57:57,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:57,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:57,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066857713] [2025-03-04 06:57:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:57,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:57,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:57,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:57,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 467 [2025-03-04 06:57:57,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:57,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:57,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 467 [2025-03-04 06:57:57,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:57,805 INFO L124 PetriNetUnfolderBase]: 760/4471 cut-off events. [2025-03-04 06:57:57,805 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:57:57,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 4471 events. 760/4471 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34822 event pairs, 564 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 5528. Up to 1180 conditions per place. [2025-03-04 06:57:57,826 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-03-04 06:57:57,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 833 flow [2025-03-04 06:57:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-04 06:57:57,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100642398286938 [2025-03-04 06:57:57,829 INFO L175 Difference]: Start difference. First operand has 388 places, 385 transitions, 783 flow. Second operand 3 states and 1275 transitions. [2025-03-04 06:57:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 833 flow [2025-03-04 06:57:57,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:57,834 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 767 flow [2025-03-04 06:57:57,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2025-03-04 06:57:57,835 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-04 06:57:57,835 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 767 flow [2025-03-04 06:57:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:57,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:57,836 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] [2025-03-04 06:57:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:57,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -345381808, now seen corresponding path program 1 times [2025-03-04 06:57:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75659987] [2025-03-04 06:57:57,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:57,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 06:57:57,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 06:57:57,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:57,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75659987] [2025-03-04 06:57:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75659987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714088975] [2025-03-04 06:57:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:57,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:57,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:57,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 467 [2025-03-04 06:57:57,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:57,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:57,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 467 [2025-03-04 06:57:57,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:58,450 INFO L124 PetriNetUnfolderBase]: 709/4509 cut-off events. [2025-03-04 06:57:58,451 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 06:57:58,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5643 conditions, 4509 events. 709/4509 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 36431 event pairs, 546 based on Foata normal form. 0/3831 useless extension candidates. Maximal degree in co-relation 5486. Up to 1102 conditions per place. [2025-03-04 06:57:58,481 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-04 06:57:58,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 817 flow [2025-03-04 06:57:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2025-03-04 06:57:58,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314775160599572 [2025-03-04 06:57:58,484 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 767 flow. Second operand 3 states and 1305 transitions. [2025-03-04 06:57:58,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 817 flow [2025-03-04 06:57:58,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:58,490 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2025-03-04 06:57:58,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2025-03-04 06:57:58,491 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-04 06:57:58,491 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2025-03-04 06:57:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:58,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:58,492 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-03-04 06:57:58,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:58,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:58,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -9108242, now seen corresponding path program 1 times [2025-03-04 06:57:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898122169] [2025-03-04 06:57:58,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:58,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 06:57:58,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 06:57:58,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:58,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:58,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898122169] [2025-03-04 06:57:58,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898122169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:58,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085287944] [2025-03-04 06:57:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:58,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:58,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:58,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:58,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-04 06:57:58,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:58,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:58,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-04 06:57:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:59,312 INFO L124 PetriNetUnfolderBase]: 835/4382 cut-off events. [2025-03-04 06:57:59,313 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:57:59,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 4382 events. 835/4382 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33687 event pairs, 605 based on Foata normal form. 0/3744 useless extension candidates. Maximal degree in co-relation 5523. Up to 1258 conditions per place. [2025-03-04 06:57:59,337 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-04 06:57:59,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 818 flow [2025-03-04 06:57:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-03-04 06:57:59,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2025-03-04 06:57:59,340 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1302 transitions. [2025-03-04 06:57:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 818 flow [2025-03-04 06:57:59,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:59,345 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2025-03-04 06:57:59,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2025-03-04 06:57:59,347 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -12 predicate places. [2025-03-04 06:57:59,347 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2025-03-04 06:57:59,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:59,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:59,348 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] [2025-03-04 06:57:59,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:59,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash -884884871, now seen corresponding path program 1 times [2025-03-04 06:57:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:59,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909258704] [2025-03-04 06:57:59,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:59,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 06:57:59,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 06:57:59,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909258704] [2025-03-04 06:57:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909258704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613883405] [2025-03-04 06:57:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:59,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:59,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:59,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:59,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2025-03-04 06:57:59,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:59,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:59,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2025-03-04 06:57:59,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:59,906 INFO L124 PetriNetUnfolderBase]: 991/4610 cut-off events. [2025-03-04 06:57:59,907 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:57:59,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 4610 events. 991/4610 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 36141 event pairs, 713 based on Foata normal form. 0/3944 useless extension candidates. Maximal degree in co-relation 5970. Up to 1475 conditions per place. [2025-03-04 06:57:59,934 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-04 06:57:59,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 820 flow [2025-03-04 06:57:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-03-04 06:57:59,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-03-04 06:57:59,937 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1298 transitions. [2025-03-04 06:57:59,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 820 flow [2025-03-04 06:57:59,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:59,943 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-03-04 06:57:59,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2025-03-04 06:57:59,944 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-03-04 06:57:59,944 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-03-04 06:57:59,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:59,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:59,946 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] [2025-03-04 06:57:59,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:59,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:57:59,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1904047258, now seen corresponding path program 1 times [2025-03-04 06:57:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-03-04 06:57:59,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:59,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 06:57:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 06:57:59,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-03-04 06:58:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391911339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586580666] [2025-03-04 06:58:00,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:00,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:00,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:00,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2025-03-04 06:58:00,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:00,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:00,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2025-03-04 06:58:00,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:00,491 INFO L124 PetriNetUnfolderBase]: 1451/5118 cut-off events. [2025-03-04 06:58:00,491 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-04 06:58:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 5118 events. 1451/5118 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 38982 event pairs, 507 based on Foata normal form. 0/4533 useless extension candidates. Maximal degree in co-relation 7156. Up to 2100 conditions per place. [2025-03-04 06:58:00,518 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-03-04 06:58:00,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 383 transitions, 867 flow [2025-03-04 06:58:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-03-04 06:58:00,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214846538187009 [2025-03-04 06:58:00,521 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1291 transitions. [2025-03-04 06:58:00,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 383 transitions, 867 flow [2025-03-04 06:58:00,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:00,528 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 771 flow [2025-03-04 06:58:00,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-03-04 06:58:00,530 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-04 06:58:00,530 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 771 flow [2025-03-04 06:58:00,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:00,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:00,531 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-03-04 06:58:00,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:58:00,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:00,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:00,532 INFO L85 PathProgramCache]: Analyzing trace with hash -236173258, now seen corresponding path program 1 times [2025-03-04 06:58:00,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8682869] [2025-03-04 06:58:00,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 06:58:00,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 06:58:00,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:00,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:00,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-03-04 06:58:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8682869] [2025-03-04 06:58:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8682869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754196566] [2025-03-04 06:58:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:00,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:00,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:00,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:00,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-03-04 06:58:00,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:00,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:00,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-03-04 06:58:00,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:01,092 INFO L124 PetriNetUnfolderBase]: 958/5597 cut-off events. [2025-03-04 06:58:01,092 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:58:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 5597 events. 958/5597 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 48302 event pairs, 625 based on Foata normal form. 0/4978 useless extension candidates. Maximal degree in co-relation 7122. Up to 1485 conditions per place. [2025-03-04 06:58:01,119 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2025-03-04 06:58:01,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 379 transitions, 849 flow [2025-03-04 06:58:01,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-04 06:58:01,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336188436830836 [2025-03-04 06:58:01,122 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 771 flow. Second operand 3 states and 1308 transitions. [2025-03-04 06:58:01,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 379 transitions, 849 flow [2025-03-04 06:58:01,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:01,126 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 786 flow [2025-03-04 06:58:01,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-03-04 06:58:01,126 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-04 06:58:01,127 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 786 flow [2025-03-04 06:58:01,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:01,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:01,127 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] [2025-03-04 06:58:01,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:58:01,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:01,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1270189782, now seen corresponding path program 1 times [2025-03-04 06:58:01,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:01,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-03-04 06:58:01,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:01,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 06:58:01,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 06:58:01,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:01,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-03-04 06:58:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111340188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012726128] [2025-03-04 06:58:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:01,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:01,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:01,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2025-03-04 06:58:01,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:01,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:01,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2025-03-04 06:58:01,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:01,836 INFO L124 PetriNetUnfolderBase]: 1295/5778 cut-off events. [2025-03-04 06:58:01,836 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 06:58:01,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 5778 events. 1295/5778 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 47164 event pairs, 516 based on Foata normal form. 0/5163 useless extension candidates. Maximal degree in co-relation 7695. Up to 1640 conditions per place. [2025-03-04 06:58:01,861 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-04 06:58:01,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 883 flow [2025-03-04 06:58:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-03-04 06:58:01,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-03-04 06:58:01,864 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 786 flow. Second operand 3 states and 1303 transitions. [2025-03-04 06:58:01,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 883 flow [2025-03-04 06:58:01,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 883 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:01,869 INFO L231 Difference]: Finished difference. Result has 374 places, 372 transitions, 794 flow [2025-03-04 06:58:01,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=374, PETRI_TRANSITIONS=372} [2025-03-04 06:58:01,873 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-04 06:58:01,874 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 372 transitions, 794 flow [2025-03-04 06:58:01,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:01,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:01,875 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] [2025-03-04 06:58:01,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:58:01,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:01,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1134430048, now seen corresponding path program 1 times [2025-03-04 06:58:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622609330] [2025-03-04 06:58:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:01,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 06:58:01,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 06:58:01,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622609330] [2025-03-04 06:58:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622609330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843967207] [2025-03-04 06:58:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:01,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:01,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:01,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:01,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-04 06:58:01,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 372 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:01,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:01,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-04 06:58:01,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:02,976 INFO L124 PetriNetUnfolderBase]: 1912/8861 cut-off events. [2025-03-04 06:58:02,977 INFO L125 PetriNetUnfolderBase]: For 81/89 co-relation queries the response was YES. [2025-03-04 06:58:02,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12334 conditions, 8861 events. 1912/8861 cut-off events. For 81/89 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 78643 event pairs, 714 based on Foata normal form. 0/7856 useless extension candidates. Maximal degree in co-relation 12176. Up to 1548 conditions per place. [2025-03-04 06:58:03,008 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/396 dead transitions. [2025-03-04 06:58:03,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 396 transitions, 952 flow [2025-03-04 06:58:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-03-04 06:58:03,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-03-04 06:58:03,011 INFO L175 Difference]: Start difference. First operand has 374 places, 372 transitions, 794 flow. Second operand 3 states and 1321 transitions. [2025-03-04 06:58:03,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 396 transitions, 952 flow [2025-03-04 06:58:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 396 transitions, 952 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:03,015 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 864 flow [2025-03-04 06:58:03,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2025-03-04 06:58:03,016 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-03-04 06:58:03,016 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 864 flow [2025-03-04 06:58:03,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:03,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:03,017 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] [2025-03-04 06:58:03,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:58:03,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1562746990, now seen corresponding path program 1 times [2025-03-04 06:58:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530769490] [2025-03-04 06:58:03,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 06:58:03,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 06:58:03,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:03,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530769490] [2025-03-04 06:58:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530769490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317294909] [2025-03-04 06:58:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:03,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:03,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:03,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-04 06:58:03,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:03,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:03,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-04 06:58:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:05,590 INFO L124 PetriNetUnfolderBase]: 4584/20498 cut-off events. [2025-03-04 06:58:05,591 INFO L125 PetriNetUnfolderBase]: For 380/388 co-relation queries the response was YES. [2025-03-04 06:58:05,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29478 conditions, 20498 events. 4584/20498 cut-off events. For 380/388 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 220354 event pairs, 2480 based on Foata normal form. 0/18591 useless extension candidates. Maximal degree in co-relation 29317. Up to 5342 conditions per place. [2025-03-04 06:58:05,701 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-03-04 06:58:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 403 transitions, 1024 flow [2025-03-04 06:58:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-03-04 06:58:05,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-03-04 06:58:05,705 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 864 flow. Second operand 3 states and 1321 transitions. [2025-03-04 06:58:05,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 403 transitions, 1024 flow [2025-03-04 06:58:05,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 403 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:05,715 INFO L231 Difference]: Finished difference. Result has 380 places, 388 transitions, 918 flow [2025-03-04 06:58:05,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=380, PETRI_TRANSITIONS=388} [2025-03-04 06:58:05,717 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-04 06:58:05,717 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 388 transitions, 918 flow [2025-03-04 06:58:05,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:05,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:05,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:05,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:58:05,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:05,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1893321855, now seen corresponding path program 1 times [2025-03-04 06:58:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362748693] [2025-03-04 06:58:05,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:05,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 06:58:05,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 06:58:05,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:05,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362748693] [2025-03-04 06:58:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362748693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134956455] [2025-03-04 06:58:05,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:05,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:05,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:05,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-04 06:58:05,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 388 transitions, 918 flow. Second operand has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:05,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:05,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-04 06:58:05,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:07,903 INFO L124 PetriNetUnfolderBase]: 2608/15740 cut-off events. [2025-03-04 06:58:07,904 INFO L125 PetriNetUnfolderBase]: For 512/576 co-relation queries the response was YES. [2025-03-04 06:58:07,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22205 conditions, 15740 events. 2608/15740 cut-off events. For 512/576 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 172010 event pairs, 1917 based on Foata normal form. 4/14290 useless extension candidates. Maximal degree in co-relation 22041. Up to 3513 conditions per place. [2025-03-04 06:58:07,969 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/402 dead transitions. [2025-03-04 06:58:07,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 402 transitions, 1033 flow [2025-03-04 06:58:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2595 transitions. [2025-03-04 06:58:07,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261241970021413 [2025-03-04 06:58:07,973 INFO L175 Difference]: Start difference. First operand has 380 places, 388 transitions, 918 flow. Second operand 6 states and 2595 transitions. [2025-03-04 06:58:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 402 transitions, 1033 flow [2025-03-04 06:58:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 402 transitions, 1015 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:07,985 INFO L231 Difference]: Finished difference. Result has 387 places, 392 transitions, 945 flow [2025-03-04 06:58:07,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=387, PETRI_TRANSITIONS=392} [2025-03-04 06:58:07,985 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-03-04 06:58:07,986 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 392 transitions, 945 flow [2025-03-04 06:58:07,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:07,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:07,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:07,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:58:07,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash 267553888, now seen corresponding path program 1 times [2025-03-04 06:58:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-03-04 06:58:07,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:08,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 06:58:08,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 06:58:08,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:08,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:08,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-03-04 06:58:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044253105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:08,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:58:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780618702] [2025-03-04 06:58:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:08,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:08,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:08,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 467 [2025-03-04 06:58:08,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 392 transitions, 945 flow. Second operand has 3 states, 3 states have (on average 433.6666666666667) internal successors, (1301), 3 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:08,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:08,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 467 [2025-03-04 06:58:08,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:10,161 INFO L124 PetriNetUnfolderBase]: 3091/16840 cut-off events. [2025-03-04 06:58:10,161 INFO L125 PetriNetUnfolderBase]: For 202/215 co-relation queries the response was YES. [2025-03-04 06:58:10,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23895 conditions, 16840 events. 3091/16840 cut-off events. For 202/215 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 183808 event pairs, 1526 based on Foata normal form. 8/15064 useless extension candidates. Maximal degree in co-relation 23726. Up to 3551 conditions per place. [2025-03-04 06:58:10,253 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 33 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2025-03-04 06:58:10,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 406 transitions, 1048 flow [2025-03-04 06:58:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2025-03-04 06:58:10,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514632405424697 [2025-03-04 06:58:10,369 INFO L175 Difference]: Start difference. First operand has 387 places, 392 transitions, 945 flow. Second operand 3 states and 1333 transitions. [2025-03-04 06:58:10,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 406 transitions, 1048 flow [2025-03-04 06:58:10,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 406 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:10,375 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 955 flow [2025-03-04 06:58:10,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2025-03-04 06:58:10,376 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -2 predicate places. [2025-03-04 06:58:10,376 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 955 flow [2025-03-04 06:58:10,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.6666666666667) internal successors, (1301), 3 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:10,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:10,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:58:10,377 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:10,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash 369126424, now seen corresponding path program 1 times [2025-03-04 06:58:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140184021] [2025-03-04 06:58:10,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:10,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 06:58:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 06:58:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140184021] [2025-03-04 06:58:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140184021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061248701] [2025-03-04 06:58:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:10,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:10,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:10,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-04 06:58:10,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 955 flow. Second operand has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-04 06:58:10,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:13,420 INFO L124 PetriNetUnfolderBase]: 3644/18533 cut-off events. [2025-03-04 06:58:13,420 INFO L125 PetriNetUnfolderBase]: For 572/601 co-relation queries the response was YES. [2025-03-04 06:58:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26807 conditions, 18533 events. 3644/18533 cut-off events. For 572/601 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 201613 event pairs, 2410 based on Foata normal form. 4/16845 useless extension candidates. Maximal degree in co-relation 26635. Up to 4877 conditions per place. [2025-03-04 06:58:13,536 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 13/401 dead transitions. [2025-03-04 06:58:13,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 401 transitions, 1054 flow [2025-03-04 06:58:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2592 transitions. [2025-03-04 06:58:13,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2025-03-04 06:58:13,540 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 955 flow. Second operand 6 states and 2592 transitions. [2025-03-04 06:58:13,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 401 transitions, 1054 flow [2025-03-04 06:58:13,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 401 transitions, 1051 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:13,546 INFO L231 Difference]: Finished difference. Result has 395 places, 388 transitions, 939 flow [2025-03-04 06:58:13,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=395, PETRI_TRANSITIONS=388} [2025-03-04 06:58:13,547 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 4 predicate places. [2025-03-04 06:58:13,547 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 388 transitions, 939 flow [2025-03-04 06:58:13,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:13,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:13,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:13,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:58:13,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash -918798755, now seen corresponding path program 1 times [2025-03-04 06:58:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-03-04 06:58:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:13,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-04 06:58:13,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-04 06:58:13,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:13,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:58:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-03-04 06:58:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005345427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722160521] [2025-03-04 06:58:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:14,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:14,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:14,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 467 [2025-03-04 06:58:14,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 388 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:14,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:14,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 467 [2025-03-04 06:58:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:18,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][409], [Black: 478#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), Black: 482#true, Black: 486#true, Black: 519#(and (<= ~threads_total~0 0) (= cleanerThread1of1ForFork0_~i~1 0)), 66#L1042true, 484#(= |#race~tids~0| 0), Black: 518#(<= ~threads_total~0 0), 459#true, Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 488#(= |#race~flags~0| 0), 515#true, 309#L1034true, 480#(= |#race~flags_mutex~0| 0), Black: 503#(<= ~threads_total~0 0), 468#(= |#race~threads_total~0| 0), Black: 504#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 524#true, Black: 506#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:18,980 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2025-03-04 06:58:18,980 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:18,980 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:18,980 INFO L297 olderBase$Statistics]: existing Event has 411 ancestors and is cut-off event [2025-03-04 06:58:19,014 INFO L124 PetriNetUnfolderBase]: 10029/33905 cut-off events. [2025-03-04 06:58:19,015 INFO L125 PetriNetUnfolderBase]: For 2779/2904 co-relation queries the response was YES. [2025-03-04 06:58:19,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57214 conditions, 33905 events. 10029/33905 cut-off events. For 2779/2904 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 375056 event pairs, 3830 based on Foata normal form. 1/30943 useless extension candidates. Maximal degree in co-relation 57038. Up to 11814 conditions per place. [2025-03-04 06:58:19,230 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/484 dead transitions. [2025-03-04 06:58:19,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 484 transitions, 1495 flow [2025-03-04 06:58:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2579 transitions. [2025-03-04 06:58:19,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204139900071378 [2025-03-04 06:58:19,234 INFO L175 Difference]: Start difference. First operand has 395 places, 388 transitions, 939 flow. Second operand 6 states and 2579 transitions. [2025-03-04 06:58:19,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 484 transitions, 1495 flow [2025-03-04 06:58:19,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 484 transitions, 1467 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-03-04 06:58:19,250 INFO L231 Difference]: Finished difference. Result has 391 places, 433 transitions, 1246 flow [2025-03-04 06:58:19,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1246, PETRI_PLACES=391, PETRI_TRANSITIONS=433} [2025-03-04 06:58:19,251 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 0 predicate places. [2025-03-04 06:58:19,251 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 433 transitions, 1246 flow [2025-03-04 06:58:19,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:19,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:19,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:19,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:58:19,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:19,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2006076996, now seen corresponding path program 1 times [2025-03-04 06:58:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:19,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-04 06:58:19,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 06:58:19,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 06:58:19,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:58:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-04 06:58:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861454323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:19,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:58:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408536946] [2025-03-04 06:58:19,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:19,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:58:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:19,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:58:19,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:58:19,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 467 [2025-03-04 06:58:19,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 433 transitions, 1246 flow. Second operand has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:19,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:19,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 467 [2025-03-04 06:58:19,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:21,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][400], [Black: 478#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), Black: 482#true, Black: 486#true, 484#(= |#race~tids~0| 0), 66#L1042true, 459#true, Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~flags~0| 0), 534#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 309#L1034true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 524#true, Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:21,791 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2025-03-04 06:58:21,791 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:21,791 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:21,791 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-04 06:58:25,390 INFO L124 PetriNetUnfolderBase]: 9556/39535 cut-off events. [2025-03-04 06:58:25,391 INFO L125 PetriNetUnfolderBase]: For 3905/6978 co-relation queries the response was YES. [2025-03-04 06:58:25,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66245 conditions, 39535 events. 9556/39535 cut-off events. For 3905/6978 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 480493 event pairs, 4370 based on Foata normal form. 267/35940 useless extension candidates. Maximal degree in co-relation 66075. Up to 10592 conditions per place. [2025-03-04 06:58:25,603 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 5/478 dead transitions. [2025-03-04 06:58:25,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 478 transitions, 1509 flow [2025-03-04 06:58:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:58:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:58:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4264 transitions. [2025-03-04 06:58:25,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130620985010707 [2025-03-04 06:58:25,607 INFO L175 Difference]: Start difference. First operand has 391 places, 433 transitions, 1246 flow. Second operand 10 states and 4264 transitions. [2025-03-04 06:58:25,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 478 transitions, 1509 flow [2025-03-04 06:58:25,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 478 transitions, 1509 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:25,621 INFO L231 Difference]: Finished difference. Result has 404 places, 441 transitions, 1318 flow [2025-03-04 06:58:25,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1318, PETRI_PLACES=404, PETRI_TRANSITIONS=441} [2025-03-04 06:58:25,622 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 13 predicate places. [2025-03-04 06:58:25,622 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 441 transitions, 1318 flow [2025-03-04 06:58:25,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:25,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:25,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:25,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:58:25,624 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:25,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash -927907288, now seen corresponding path program 1 times [2025-03-04 06:58:25,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289943326] [2025-03-04 06:58:25,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:25,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 06:58:25,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 06:58:25,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:58:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:25,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289943326] [2025-03-04 06:58:25,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289943326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:25,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:58:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046919848] [2025-03-04 06:58:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:25,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:58:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:25,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:58:25,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:58:26,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2025-03-04 06:58:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 441 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:26,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:26,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2025-03-04 06:58:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:32,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][397], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 66#L1042true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 488#(= |#race~flags~0| 0), 534#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:32,389 INFO L294 olderBase$Statistics]: this new event has 411 ancestors and is cut-off event [2025-03-04 06:58:32,390 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:32,390 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:32,390 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-04 06:58:32,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][397], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 534#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), 342#L1050true]) [2025-03-04 06:58:32,482 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-03-04 06:58:32,482 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-04 06:58:32,482 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-04 06:58:32,482 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-04 06:58:32,619 INFO L124 PetriNetUnfolderBase]: 11284/46045 cut-off events. [2025-03-04 06:58:32,619 INFO L125 PetriNetUnfolderBase]: For 16029/17675 co-relation queries the response was YES. [2025-03-04 06:58:32,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85163 conditions, 46045 events. 11284/46045 cut-off events. For 16029/17675 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 565296 event pairs, 4059 based on Foata normal form. 108/42201 useless extension candidates. Maximal degree in co-relation 84987. Up to 9049 conditions per place. [2025-03-04 06:58:32,885 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/511 dead transitions. [2025-03-04 06:58:32,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 511 transitions, 1900 flow [2025-03-04 06:58:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:58:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 06:58:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4639 transitions. [2025-03-04 06:58:32,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903056258516644 [2025-03-04 06:58:32,891 INFO L175 Difference]: Start difference. First operand has 404 places, 441 transitions, 1318 flow. Second operand 11 states and 4639 transitions. [2025-03-04 06:58:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 511 transitions, 1900 flow [2025-03-04 06:58:32,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 511 transitions, 1892 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:58:32,915 INFO L231 Difference]: Finished difference. Result has 414 places, 462 transitions, 1635 flow [2025-03-04 06:58:32,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1635, PETRI_PLACES=414, PETRI_TRANSITIONS=462} [2025-03-04 06:58:32,916 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 23 predicate places. [2025-03-04 06:58:32,916 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 462 transitions, 1635 flow [2025-03-04 06:58:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:32,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:32,917 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:32,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:58:32,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:32,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1048235526, now seen corresponding path program 1 times [2025-03-04 06:58:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:32,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005600701] [2025-03-04 06:58:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:32,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-04 06:58:32,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 06:58:32,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:32,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:58:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005600701] [2025-03-04 06:58:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005600701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817832639] [2025-03-04 06:58:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:32,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:32,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:32,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2025-03-04 06:58:32,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 462 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:32,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:32,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2025-03-04 06:58:32,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:34,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][357], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 573#true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~flags~0| 0), 534#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 100#L1040-2true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:34,619 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is not cut-off event [2025-03-04 06:58:34,619 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-03-04 06:58:34,619 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-03-04 06:58:34,619 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-03-04 06:58:34,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L1042-4-->L1042-3: Formula: (= (store |v_#race_18| v_~flags~0.base_7 (store (select |v_#race_18| v_~flags~0.base_7) (+ v_~flags~0.offset_7 v_cleanerThread1of1ForFork0_~i~1_13) 0)) |v_#race_17|) InVars {#race=|v_#race_18|, ~flags~0.offset=v_~flags~0.offset_7, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_13, ~flags~0.base=v_~flags~0.base_7} OutVars{#race=|v_#race_17|, ~flags~0.offset=v_~flags~0.offset_7, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_13, ~flags~0.base=v_~flags~0.base_7} AuxVars[] AssignedVars[#race][272], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 573#true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 534#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 61#L1042-3true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 245#L1034-5true, 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 495#true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:34,718 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2025-03-04 06:58:34,718 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-04 06:58:34,718 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-04 06:58:34,718 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-04 06:58:34,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 573#true, 66#L1042true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 488#(= |#race~flags~0| 0), 534#true, Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:34,736 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2025-03-04 06:58:34,736 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:34,736 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-04 06:58:34,736 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:34,761 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 573#true, 66#L1042true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~flags~0| 0), 534#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 482#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:34,762 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2025-03-04 06:58:34,762 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-04 06:58:34,762 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:34,762 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-04 06:58:34,762 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-04 06:58:37,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][358], [Black: 513#(<= (+ ~threads_alive~0 1) 0), 573#true, 459#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 534#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 232#L1066true, Black: 478#true, Black: 540#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#true, 484#(= |#race~tids~0| 0), 100#L1040-2true, Black: 492#(= |#race~threads_alive~0| 0), 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-04 06:58:37,654 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2025-03-04 06:58:37,654 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-04 06:58:37,654 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-04 06:58:37,654 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-03-04 06:58:38,623 INFO L124 PetriNetUnfolderBase]: 8214/37670 cut-off events. [2025-03-04 06:58:38,624 INFO L125 PetriNetUnfolderBase]: For 14381/15685 co-relation queries the response was YES. [2025-03-04 06:58:38,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68561 conditions, 37670 events. 8214/37670 cut-off events. For 14381/15685 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 468077 event pairs, 3460 based on Foata normal form. 90/34480 useless extension candidates. Maximal degree in co-relation 68383. Up to 7945 conditions per place. [2025-03-04 06:58:38,856 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 32 selfloop transitions, 4 changer transitions 0/475 dead transitions. [2025-03-04 06:58:38,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 475 transitions, 1733 flow [2025-03-04 06:58:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1330 transitions. [2025-03-04 06:58:38,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493219129193433 [2025-03-04 06:58:38,858 INFO L175 Difference]: Start difference. First operand has 414 places, 462 transitions, 1635 flow. Second operand 3 states and 1330 transitions. [2025-03-04 06:58:38,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 475 transitions, 1733 flow [2025-03-04 06:58:38,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 475 transitions, 1722 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:58:38,913 INFO L231 Difference]: Finished difference. Result has 412 places, 465 transitions, 1654 flow [2025-03-04 06:58:38,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=412, PETRI_TRANSITIONS=465} [2025-03-04 06:58:38,914 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 21 predicate places. [2025-03-04 06:58:38,914 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 465 transitions, 1654 flow [2025-03-04 06:58:38,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:38,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:38,915 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:58:38,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:58:38,915 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:58:38,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 354256308, now seen corresponding path program 1 times [2025-03-04 06:58:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-03-04 06:58:38,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:38,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 06:58:38,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 06:58:38,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:38,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:58:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-03-04 06:58:39,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104768167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:39,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:39,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:58:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939496609] [2025-03-04 06:58:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:39,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:58:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:39,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:58:39,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:58:39,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 467 [2025-03-04 06:58:39,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 465 transitions, 1654 flow. Second operand has 11 states, 11 states have (on average 403.72727272727275) internal successors, (4441), 11 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:39,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:39,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 467 [2025-03-04 06:58:39,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand