./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:47,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:47,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:27:47,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:47,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:47,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:47,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:47,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:47,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:47,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:47,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:47,675 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:47,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:47,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:47,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:47,678 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2025-02-06 09:27:47,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:47,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:47,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:47,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:47,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:47,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-02-06 09:27:48,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31ffb4d3f/be6c78f009e14ed6acdf5f9cd76e6c03/FLAG53cd43b45 [2025-02-06 09:27:49,267 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:49,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-02-06 09:27:49,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31ffb4d3f/be6c78f009e14ed6acdf5f9cd76e6c03/FLAG53cd43b45 [2025-02-06 09:27:49,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31ffb4d3f/be6c78f009e14ed6acdf5f9cd76e6c03 [2025-02-06 09:27:49,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:49,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:49,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:49,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:49,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:49,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b65aa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49, skipping insertion in model container [2025-02-06 09:27:49,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:49,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:49,484 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:49,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:49,522 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:49,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49 WrapperNode [2025-02-06 09:27:49,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:49,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:49,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:49,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:49,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,549 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 139 [2025-02-06 09:27:49,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:49,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:49,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:49,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:49,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:49,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:49,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:49,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:49,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (1/1) ... [2025-02-06 09:27:49,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:49,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:49,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:27:49,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:27:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:27:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:27:49,629 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:27:49,756 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:49,757 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:50,053 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:50,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:50,064 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:50,064 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:50,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:50 BoogieIcfgContainer [2025-02-06 09:27:50,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:50,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:50,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:50,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:50,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:49" (1/3) ... [2025-02-06 09:27:50,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3744ffa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:50, skipping insertion in model container [2025-02-06 09:27:50,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:49" (2/3) ... [2025-02-06 09:27:50,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3744ffa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:50, skipping insertion in model container [2025-02-06 09:27:50,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:50" (3/3) ... [2025-02-06 09:27:50,072 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-02-06 09:27:50,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:50,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 304 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-02-06 09:27:50,083 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:50,155 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:27:50,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 318 transitions, 650 flow [2025-02-06 09:27:50,325 INFO L124 PetriNetUnfolderBase]: 15/316 cut-off events. [2025-02-06 09:27:50,327 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:27:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 316 events. 15/316 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 570 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 224. Up to 3 conditions per place. [2025-02-06 09:27:50,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 318 transitions, 650 flow [2025-02-06 09:27:50,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 299 transitions, 610 flow [2025-02-06 09:27:50,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:50,360 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;@705a1863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:50,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-02-06 09:27:50,367 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:50,368 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-06 09:27:50,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:50,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,369 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] [2025-02-06 09:27:50,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:50,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1288213215, now seen corresponding path program 1 times [2025-02-06 09:27:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235553423] [2025-02-06 09:27:50,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:27:50,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:27:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235553423] [2025-02-06 09:27:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235553423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622374236] [2025-02-06 09:27:50,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-06 09:27:50,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:50,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-06 09:27:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,672 INFO L124 PetriNetUnfolderBase]: 17/428 cut-off events. [2025-02-06 09:27:50,672 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:27:50,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 428 events. 17/428 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1228 event pairs, 3 based on Foata normal form. 12/364 useless extension candidates. Maximal degree in co-relation 287. Up to 19 conditions per place. [2025-02-06 09:27:50,676 INFO L140 encePairwiseOnDemand]: 309/318 looper letters, 10 selfloop transitions, 2 changer transitions 4/292 dead transitions. [2025-02-06 09:27:50,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 620 flow [2025-02-06 09:27:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2025-02-06 09:27:50,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950733752620545 [2025-02-06 09:27:50,713 INFO L175 Difference]: Start difference. First operand has 292 places, 299 transitions, 610 flow. Second operand 3 states and 907 transitions. [2025-02-06 09:27:50,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 620 flow [2025-02-06 09:27:50,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:27:50,723 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 584 flow [2025-02-06 09:27:50,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2025-02-06 09:27:50,729 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -3 predicate places. [2025-02-06 09:27:50,729 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 584 flow [2025-02-06 09:27:50,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:50,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:50,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:50,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:50,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -280541129, now seen corresponding path program 1 times [2025-02-06 09:27:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887134892] [2025-02-06 09:27:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:27:50,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:27:50,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887134892] [2025-02-06 09:27:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887134892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686496414] [2025-02-06 09:27:50,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-06 09:27:50,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:50,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-06 09:27:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,868 INFO L124 PetriNetUnfolderBase]: 17/425 cut-off events. [2025-02-06 09:27:50,868 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-06 09:27:50,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 425 events. 17/425 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1166 event pairs, 3 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 422. Up to 18 conditions per place. [2025-02-06 09:27:50,872 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-02-06 09:27:50,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 606 flow [2025-02-06 09:27:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2025-02-06 09:27:50,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-02-06 09:27:50,874 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 584 flow. Second operand 3 states and 901 transitions. [2025-02-06 09:27:50,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 606 flow [2025-02-06 09:27:50,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:50,879 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 582 flow [2025-02-06 09:27:50,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2025-02-06 09:27:50,880 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2025-02-06 09:27:50,880 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 582 flow [2025-02-06 09:27:50,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:50,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:50,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] [2025-02-06 09:27:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:50,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash -299218443, now seen corresponding path program 1 times [2025-02-06 09:27:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:50,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561018031] [2025-02-06 09:27:50,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:27:50,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:27:50,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:50,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561018031] [2025-02-06 09:27:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561018031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:50,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562237171] [2025-02-06 09:27:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:50,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:50,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:50,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:50,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-06 09:27:50,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:50,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:50,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-06 09:27:50,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:50,990 INFO L124 PetriNetUnfolderBase]: 33/617 cut-off events. [2025-02-06 09:27:50,991 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:27:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 617 events. 33/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2361 event pairs, 8 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 622. Up to 33 conditions per place. [2025-02-06 09:27:50,995 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-02-06 09:27:50,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 598 flow [2025-02-06 09:27:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-02-06 09:27:50,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454926624737946 [2025-02-06 09:27:50,997 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 582 flow. Second operand 3 states and 902 transitions. [2025-02-06 09:27:50,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 598 flow [2025-02-06 09:27:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:51,005 INFO L231 Difference]: Finished difference. Result has 281 places, 284 transitions, 574 flow [2025-02-06 09:27:51,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=284} [2025-02-06 09:27:51,006 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2025-02-06 09:27:51,006 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 284 transitions, 574 flow [2025-02-06 09:27:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:51,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:51,007 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] [2025-02-06 09:27:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:51,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1032990366, now seen corresponding path program 1 times [2025-02-06 09:27:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973047841] [2025-02-06 09:27:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:27:51,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:27:51,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:51,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973047841] [2025-02-06 09:27:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973047841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:51,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:51,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464569258] [2025-02-06 09:27:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:51,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:51,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:51,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:51,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:51,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 318 [2025-02-06 09:27:51,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 284 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:51,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:51,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 318 [2025-02-06 09:27:51,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,007 INFO L124 PetriNetUnfolderBase]: 146/1249 cut-off events. [2025-02-06 09:27:52,007 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-02-06 09:27:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1249 events. 146/1249 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7417 event pairs, 80 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1459. Up to 224 conditions per place. [2025-02-06 09:27:52,016 INFO L140 encePairwiseOnDemand]: 306/318 looper letters, 36 selfloop transitions, 10 changer transitions 0/282 dead transitions. [2025-02-06 09:27:52,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 662 flow [2025-02-06 09:27:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2025-02-06 09:27:52,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2025-02-06 09:27:52,020 INFO L175 Difference]: Start difference. First operand has 281 places, 284 transitions, 574 flow. Second operand 6 states and 1620 transitions. [2025-02-06 09:27:52,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 662 flow [2025-02-06 09:27:52,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:52,023 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 589 flow [2025-02-06 09:27:52,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2025-02-06 09:27:52,024 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2025-02-06 09:27:52,024 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 589 flow [2025-02-06 09:27:52,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,025 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] [2025-02-06 09:27:52,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:52,025 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1902427377, now seen corresponding path program 1 times [2025-02-06 09:27:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404616857] [2025-02-06 09:27:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:27:52,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:27:52,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404616857] [2025-02-06 09:27:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404616857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181812854] [2025-02-06 09:27:52,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-02-06 09:27:52,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-02-06 09:27:52,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,123 INFO L124 PetriNetUnfolderBase]: 14/353 cut-off events. [2025-02-06 09:27:52,123 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-06 09:27:52,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 353 events. 14/353 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 844 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2025-02-06 09:27:52,126 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-06 09:27:52,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 281 transitions, 609 flow [2025-02-06 09:27:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-06 09:27:52,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2025-02-06 09:27:52,128 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 589 flow. Second operand 3 states and 903 transitions. [2025-02-06 09:27:52,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 281 transitions, 609 flow [2025-02-06 09:27:52,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:52,132 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 571 flow [2025-02-06 09:27:52,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2025-02-06 09:27:52,132 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2025-02-06 09:27:52,133 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 571 flow [2025-02-06 09:27:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:52,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:52,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2061124912, now seen corresponding path program 1 times [2025-02-06 09:27:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717877715] [2025-02-06 09:27:52,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 09:27:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 09:27:52,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717877715] [2025-02-06 09:27:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717877715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523084540] [2025-02-06 09:27:52,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 318 [2025-02-06 09:27:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 318 [2025-02-06 09:27:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,226 INFO L124 PetriNetUnfolderBase]: 34/609 cut-off events. [2025-02-06 09:27:52,226 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-02-06 09:27:52,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 609 events. 34/609 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2424 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 615. Up to 33 conditions per place. [2025-02-06 09:27:52,229 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2025-02-06 09:27:52,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 278 transitions, 587 flow [2025-02-06 09:27:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-02-06 09:27:52,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454926624737946 [2025-02-06 09:27:52,231 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 571 flow. Second operand 3 states and 902 transitions. [2025-02-06 09:27:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 278 transitions, 587 flow [2025-02-06 09:27:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,234 INFO L231 Difference]: Finished difference. Result has 276 places, 278 transitions, 563 flow [2025-02-06 09:27:52,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=276, PETRI_TRANSITIONS=278} [2025-02-06 09:27:52,235 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-06 09:27:52,235 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 278 transitions, 563 flow [2025-02-06 09:27:52,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:52,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:52,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -906755541, now seen corresponding path program 1 times [2025-02-06 09:27:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401106014] [2025-02-06 09:27:52,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:27:52,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:27:52,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401106014] [2025-02-06 09:27:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401106014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251525628] [2025-02-06 09:27:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-02-06 09:27:52,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-02-06 09:27:52,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,312 INFO L124 PetriNetUnfolderBase]: 14/348 cut-off events. [2025-02-06 09:27:52,312 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-06 09:27:52,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 348 events. 14/348 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 735 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 335. Up to 16 conditions per place. [2025-02-06 09:27:52,314 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 9 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-06 09:27:52,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 277 transitions, 583 flow [2025-02-06 09:27:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-02-06 09:27:52,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2025-02-06 09:27:52,316 INFO L175 Difference]: Start difference. First operand has 276 places, 278 transitions, 563 flow. Second operand 3 states and 903 transitions. [2025-02-06 09:27:52,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 277 transitions, 583 flow [2025-02-06 09:27:52,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:52,319 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 564 flow [2025-02-06 09:27:52,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-02-06 09:27:52,320 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-06 09:27:52,320 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 564 flow [2025-02-06 09:27:52,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,321 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] [2025-02-06 09:27:52,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:52,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1761326078, now seen corresponding path program 1 times [2025-02-06 09:27:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946641463] [2025-02-06 09:27:52,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:27:52,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:27:52,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946641463] [2025-02-06 09:27:52,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946641463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232135263] [2025-02-06 09:27:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 318 [2025-02-06 09:27:52,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 318 [2025-02-06 09:27:52,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,452 INFO L124 PetriNetUnfolderBase]: 22/341 cut-off events. [2025-02-06 09:27:52,453 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:52,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 341 events. 22/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 876 event pairs, 1 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 364. Up to 35 conditions per place. [2025-02-06 09:27:52,455 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-06 09:27:52,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 591 flow [2025-02-06 09:27:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2025-02-06 09:27:52,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276729559748428 [2025-02-06 09:27:52,457 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 564 flow. Second operand 3 states and 885 transitions. [2025-02-06 09:27:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 591 flow [2025-02-06 09:27:52,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,460 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 552 flow [2025-02-06 09:27:52,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2025-02-06 09:27:52,461 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -22 predicate places. [2025-02-06 09:27:52,461 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 552 flow [2025-02-06 09:27:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:52,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:52,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 695491281, now seen corresponding path program 1 times [2025-02-06 09:27:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510183860] [2025-02-06 09:27:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 09:27:52,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 09:27:52,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510183860] [2025-02-06 09:27:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510183860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623776977] [2025-02-06 09:27:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 318 [2025-02-06 09:27:52,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 318 [2025-02-06 09:27:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,551 INFO L124 PetriNetUnfolderBase]: 22/335 cut-off events. [2025-02-06 09:27:52,552 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-02-06 09:27:52,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 335 events. 22/335 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 880 event pairs, 1 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 346. Up to 33 conditions per place. [2025-02-06 09:27:52,553 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 13 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2025-02-06 09:27:52,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 577 flow [2025-02-06 09:27:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-06 09:27:52,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266247379454927 [2025-02-06 09:27:52,555 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 552 flow. Second operand 3 states and 884 transitions. [2025-02-06 09:27:52,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 577 flow [2025-02-06 09:27:52,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 266 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,558 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 531 flow [2025-02-06 09:27:52,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2025-02-06 09:27:52,559 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2025-02-06 09:27:52,559 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 531 flow [2025-02-06 09:27:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,559 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] [2025-02-06 09:27:52,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:52,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 164015977, now seen corresponding path program 1 times [2025-02-06 09:27:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070645974] [2025-02-06 09:27:52,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 09:27:52,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 09:27:52,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070645974] [2025-02-06 09:27:52,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070645974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119412314] [2025-02-06 09:27:52,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-02-06 09:27:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-02-06 09:27:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,640 INFO L124 PetriNetUnfolderBase]: 19/330 cut-off events. [2025-02-06 09:27:52,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 330 events. 19/330 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 661 event pairs, 6 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 340. Up to 23 conditions per place. [2025-02-06 09:27:52,641 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2025-02-06 09:27:52,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 562 flow [2025-02-06 09:27:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-02-06 09:27:52,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-02-06 09:27:52,643 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 531 flow. Second operand 3 states and 908 transitions. [2025-02-06 09:27:52,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 562 flow [2025-02-06 09:27:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 263 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,649 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 545 flow [2025-02-06 09:27:52,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2025-02-06 09:27:52,649 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -30 predicate places. [2025-02-06 09:27:52,649 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 545 flow [2025-02-06 09:27:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,650 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] [2025-02-06 09:27:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:52,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 142222712, now seen corresponding path program 1 times [2025-02-06 09:27:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787284236] [2025-02-06 09:27:52,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 09:27:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 09:27:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787284236] [2025-02-06 09:27:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787284236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973945664] [2025-02-06 09:27:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 318 [2025-02-06 09:27:52,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 318 [2025-02-06 09:27:52,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,767 INFO L124 PetriNetUnfolderBase]: 37/614 cut-off events. [2025-02-06 09:27:52,768 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-02-06 09:27:52,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 614 events. 37/614 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2193 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 654. Up to 32 conditions per place. [2025-02-06 09:27:52,771 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-02-06 09:27:52,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 264 transitions, 575 flow [2025-02-06 09:27:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-02-06 09:27:52,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9549266247379455 [2025-02-06 09:27:52,773 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 545 flow. Second operand 3 states and 911 transitions. [2025-02-06 09:27:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 264 transitions, 575 flow [2025-02-06 09:27:52,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,777 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 549 flow [2025-02-06 09:27:52,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2025-02-06 09:27:52,778 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -31 predicate places. [2025-02-06 09:27:52,778 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 549 flow [2025-02-06 09:27:52,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,778 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] [2025-02-06 09:27:52,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:27:52,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash -453679940, now seen corresponding path program 1 times [2025-02-06 09:27:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473956978] [2025-02-06 09:27:52,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 09:27:52,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 09:27:52,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473956978] [2025-02-06 09:27:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473956978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:27:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698945126] [2025-02-06 09:27:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-02-06 09:27:52,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-02-06 09:27:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,861 INFO L124 PetriNetUnfolderBase]: 50/492 cut-off events. [2025-02-06 09:27:52,861 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-06 09:27:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 492 events. 50/492 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1488 event pairs, 11 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 565. Up to 58 conditions per place. [2025-02-06 09:27:52,864 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 9 selfloop transitions, 3 changer transitions 1/264 dead transitions. [2025-02-06 09:27:52,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 580 flow [2025-02-06 09:27:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-02-06 09:27:52,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-02-06 09:27:52,866 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 549 flow. Second operand 3 states and 908 transitions. [2025-02-06 09:27:52,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 580 flow [2025-02-06 09:27:52,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:52,869 INFO L231 Difference]: Finished difference. Result has 265 places, 263 transitions, 567 flow [2025-02-06 09:27:52,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=263} [2025-02-06 09:27:52,869 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -27 predicate places. [2025-02-06 09:27:52,869 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 263 transitions, 567 flow [2025-02-06 09:27:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:52,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:27:52,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1755736968, now seen corresponding path program 1 times [2025-02-06 09:27:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964713374] [2025-02-06 09:27:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 09:27:52,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 09:27:52,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:52,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964713374] [2025-02-06 09:27:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964713374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418517245] [2025-02-06 09:27:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:52,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:52,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:52,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 318 [2025-02-06 09:27:52,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 263 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:52,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 318 [2025-02-06 09:27:52,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:52,976 INFO L124 PetriNetUnfolderBase]: 45/676 cut-off events. [2025-02-06 09:27:52,977 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-02-06 09:27:52,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 676 events. 45/676 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2661 event pairs, 3 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 771. Up to 38 conditions per place. [2025-02-06 09:27:52,979 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 10 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-06 09:27:52,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 597 flow [2025-02-06 09:27:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-02-06 09:27:52,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9549266247379455 [2025-02-06 09:27:52,981 INFO L175 Difference]: Start difference. First operand has 265 places, 263 transitions, 567 flow. Second operand 3 states and 911 transitions. [2025-02-06 09:27:52,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 597 flow [2025-02-06 09:27:52,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:52,984 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 571 flow [2025-02-06 09:27:52,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2025-02-06 09:27:52,985 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2025-02-06 09:27:52,985 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 571 flow [2025-02-06 09:27:52,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:52,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:52,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:27:52,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:52,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -208967204, now seen corresponding path program 1 times [2025-02-06 09:27:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957067868] [2025-02-06 09:27:52,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:52,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:27:53,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:27:53,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957067868] [2025-02-06 09:27:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957067868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:27:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050122011] [2025-02-06 09:27:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:27:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:53,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:27:53,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:27:53,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-06 09:27:53,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:53,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:53,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-06 09:27:53,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:53,716 INFO L124 PetriNetUnfolderBase]: 56/860 cut-off events. [2025-02-06 09:27:53,716 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:27:53,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 860 events. 56/860 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2983 event pairs, 8 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1076. Up to 45 conditions per place. [2025-02-06 09:27:53,720 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 50 selfloop transitions, 19 changer transitions 0/298 dead transitions. [2025-02-06 09:27:53,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 298 transitions, 802 flow [2025-02-06 09:27:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:27:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:27:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3381 transitions. [2025-02-06 09:27:53,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8860062893081762 [2025-02-06 09:27:53,725 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 571 flow. Second operand 12 states and 3381 transitions. [2025-02-06 09:27:53,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 298 transitions, 802 flow [2025-02-06 09:27:53,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 298 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:53,729 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 678 flow [2025-02-06 09:27:53,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=678, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2025-02-06 09:27:53,729 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2025-02-06 09:27:53,729 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 678 flow [2025-02-06 09:27:53,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:53,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:53,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:27:53,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -525520532, now seen corresponding path program 1 times [2025-02-06 09:27:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305424586] [2025-02-06 09:27:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:53,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:53,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 09:27:53,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 09:27:53,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:53,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305424586] [2025-02-06 09:27:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305424586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:27:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839346143] [2025-02-06 09:27:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:53,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:27:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:53,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:27:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:27:54,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-06 09:27:54,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:54,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:54,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-06 09:27:54,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:54,341 INFO L124 PetriNetUnfolderBase]: 106/1071 cut-off events. [2025-02-06 09:27:54,341 INFO L125 PetriNetUnfolderBase]: For 93/97 co-relation queries the response was YES. [2025-02-06 09:27:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1071 events. 106/1071 cut-off events. For 93/97 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5186 event pairs, 25 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1422. Up to 86 conditions per place. [2025-02-06 09:27:54,347 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 33 selfloop transitions, 13 changer transitions 27/306 dead transitions. [2025-02-06 09:27:54,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 306 transitions, 908 flow [2025-02-06 09:27:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:27:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:27:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3382 transitions. [2025-02-06 09:27:54,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8862683438155137 [2025-02-06 09:27:54,353 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 678 flow. Second operand 12 states and 3382 transitions. [2025-02-06 09:27:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 306 transitions, 908 flow [2025-02-06 09:27:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 306 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:54,357 INFO L231 Difference]: Finished difference. Result has 295 places, 272 transitions, 714 flow [2025-02-06 09:27:54,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=714, PETRI_PLACES=295, PETRI_TRANSITIONS=272} [2025-02-06 09:27:54,358 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2025-02-06 09:27:54,358 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 272 transitions, 714 flow [2025-02-06 09:27:54,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:54,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:54,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:54,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:27:54,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:54,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 458653561, now seen corresponding path program 1 times [2025-02-06 09:27:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726367290] [2025-02-06 09:27:54,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 09:27:54,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 09:27:54,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:54,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:27:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:54,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726367290] [2025-02-06 09:27:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726367290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:27:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935526277] [2025-02-06 09:27:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:27:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:27:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:27:54,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-06 09:27:54,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 272 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:54,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:54,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-06 09:27:54,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:54,961 INFO L124 PetriNetUnfolderBase]: 64/1013 cut-off events. [2025-02-06 09:27:54,961 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-02-06 09:27:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1013 events. 64/1013 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3810 event pairs, 14 based on Foata normal form. 2/960 useless extension candidates. Maximal degree in co-relation 1389. Up to 57 conditions per place. [2025-02-06 09:27:54,969 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 44 selfloop transitions, 20 changer transitions 0/297 dead transitions. [2025-02-06 09:27:54,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 928 flow [2025-02-06 09:27:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:27:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:27:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3374 transitions. [2025-02-06 09:27:54,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8841719077568134 [2025-02-06 09:27:54,974 INFO L175 Difference]: Start difference. First operand has 295 places, 272 transitions, 714 flow. Second operand 12 states and 3374 transitions. [2025-02-06 09:27:54,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 928 flow [2025-02-06 09:27:54,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 878 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-02-06 09:27:54,978 INFO L231 Difference]: Finished difference. Result has 290 places, 281 transitions, 780 flow [2025-02-06 09:27:54,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=290, PETRI_TRANSITIONS=281} [2025-02-06 09:27:54,979 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -2 predicate places. [2025-02-06 09:27:54,979 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 281 transitions, 780 flow [2025-02-06 09:27:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:54,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:54,980 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] [2025-02-06 09:27:54,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:27:54,980 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:54,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 407297353, now seen corresponding path program 1 times [2025-02-06 09:27:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708011756] [2025-02-06 09:27:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:54,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 09:27:55,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 09:27:55,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:27:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708011756] [2025-02-06 09:27:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708011756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:27:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389173930] [2025-02-06 09:27:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:27:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:27:55,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:27:55,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 318 [2025-02-06 09:27:55,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 281 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:55,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 318 [2025-02-06 09:27:55,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,809 INFO L124 PetriNetUnfolderBase]: 102/1025 cut-off events. [2025-02-06 09:27:55,809 INFO L125 PetriNetUnfolderBase]: For 195/199 co-relation queries the response was YES. [2025-02-06 09:27:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1025 events. 102/1025 cut-off events. For 195/199 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4931 event pairs, 24 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 1442. Up to 65 conditions per place. [2025-02-06 09:27:55,816 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 31 selfloop transitions, 16 changer transitions 18/298 dead transitions. [2025-02-06 09:27:55,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 961 flow [2025-02-06 09:27:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:27:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:27:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3649 transitions. [2025-02-06 09:27:55,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8826802128688921 [2025-02-06 09:27:55,821 INFO L175 Difference]: Start difference. First operand has 290 places, 281 transitions, 780 flow. Second operand 13 states and 3649 transitions. [2025-02-06 09:27:55,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 961 flow [2025-02-06 09:27:55,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:55,826 INFO L231 Difference]: Finished difference. Result has 303 places, 273 transitions, 759 flow [2025-02-06 09:27:55,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=759, PETRI_PLACES=303, PETRI_TRANSITIONS=273} [2025-02-06 09:27:55,827 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 11 predicate places. [2025-02-06 09:27:55,827 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 273 transitions, 759 flow [2025-02-06 09:27:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:55,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,828 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] [2025-02-06 09:27:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:27:55,828 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:55,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 659753137, now seen corresponding path program 1 times [2025-02-06 09:27:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950070986] [2025-02-06 09:27:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:27:55,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:27:55,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:27:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950070986] [2025-02-06 09:27:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950070986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136630524] [2025-02-06 09:27:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:56,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-06 09:27:56,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 273 transitions, 759 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:56,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-06 09:27:56,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,676 INFO L124 PetriNetUnfolderBase]: 42/812 cut-off events. [2025-02-06 09:27:56,676 INFO L125 PetriNetUnfolderBase]: For 128/130 co-relation queries the response was YES. [2025-02-06 09:27:56,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 812 events. 42/812 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2596 event pairs, 6 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1075. Up to 35 conditions per place. [2025-02-06 09:27:56,681 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 6 changer transitions 0/277 dead transitions. [2025-02-06 09:27:56,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 277 transitions, 824 flow [2025-02-06 09:27:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-02-06 09:27:56,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192872117400419 [2025-02-06 09:27:56,684 INFO L175 Difference]: Start difference. First operand has 303 places, 273 transitions, 759 flow. Second operand 6 states and 1754 transitions. [2025-02-06 09:27:56,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 277 transitions, 824 flow [2025-02-06 09:27:56,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 277 transitions, 768 flow, removed 6 selfloop flow, removed 16 redundant places. [2025-02-06 09:27:56,688 INFO L231 Difference]: Finished difference. Result has 283 places, 272 transitions, 713 flow [2025-02-06 09:27:56,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=283, PETRI_TRANSITIONS=272} [2025-02-06 09:27:56,689 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2025-02-06 09:27:56,689 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 272 transitions, 713 flow [2025-02-06 09:27:56,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:56,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:56,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:27:56,689 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -11166591, now seen corresponding path program 1 times [2025-02-06 09:27:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063711902] [2025-02-06 09:27:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 09:27:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 09:27:56,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:27:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063711902] [2025-02-06 09:27:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063711902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408181606] [2025-02-06 09:27:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:57,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:57,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-06 09:27:57,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 272 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:57,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-06 09:27:57,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,458 INFO L124 PetriNetUnfolderBase]: 79/1071 cut-off events. [2025-02-06 09:27:57,459 INFO L125 PetriNetUnfolderBase]: For 159/163 co-relation queries the response was YES. [2025-02-06 09:27:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 1071 events. 79/1071 cut-off events. For 159/163 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4767 event pairs, 12 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1399. Up to 54 conditions per place. [2025-02-06 09:27:57,467 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 19 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2025-02-06 09:27:57,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 275 transitions, 773 flow [2025-02-06 09:27:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-02-06 09:27:57,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187631027253669 [2025-02-06 09:27:57,479 INFO L175 Difference]: Start difference. First operand has 283 places, 272 transitions, 713 flow. Second operand 6 states and 1753 transitions. [2025-02-06 09:27:57,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 275 transitions, 773 flow [2025-02-06 09:27:57,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 275 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:57,484 INFO L231 Difference]: Finished difference. Result has 282 places, 271 transitions, 711 flow [2025-02-06 09:27:57,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=282, PETRI_TRANSITIONS=271} [2025-02-06 09:27:57,484 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -10 predicate places. [2025-02-06 09:27:57,485 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 271 transitions, 711 flow [2025-02-06 09:27:57,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:57,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:57,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:27:57,486 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:57,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 693629334, now seen corresponding path program 1 times [2025-02-06 09:27:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373257792] [2025-02-06 09:27:57,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 09:27:57,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 09:27:57,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:27:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373257792] [2025-02-06 09:27:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373257792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217558503] [2025-02-06 09:27:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:57,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:57,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:58,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-06 09:27:58,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 271 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-06 09:27:58,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,120 INFO L124 PetriNetUnfolderBase]: 39/787 cut-off events. [2025-02-06 09:27:58,120 INFO L125 PetriNetUnfolderBase]: For 90/92 co-relation queries the response was YES. [2025-02-06 09:27:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 787 events. 39/787 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2451 event pairs, 6 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1029. Up to 35 conditions per place. [2025-02-06 09:27:58,125 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 20 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2025-02-06 09:27:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 275 transitions, 776 flow [2025-02-06 09:27:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2025-02-06 09:27:58,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192872117400419 [2025-02-06 09:27:58,131 INFO L175 Difference]: Start difference. First operand has 282 places, 271 transitions, 711 flow. Second operand 6 states and 1754 transitions. [2025-02-06 09:27:58,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 275 transitions, 776 flow [2025-02-06 09:27:58,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 764 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:58,134 INFO L231 Difference]: Finished difference. Result has 281 places, 270 transitions, 709 flow [2025-02-06 09:27:58,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=281, PETRI_TRANSITIONS=270} [2025-02-06 09:27:58,135 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2025-02-06 09:27:58,135 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 270 transitions, 709 flow [2025-02-06 09:27:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:58,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:27:58,136 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash -288998586, now seen corresponding path program 1 times [2025-02-06 09:27:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914816757] [2025-02-06 09:27:58,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 09:27:58,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 09:27:58,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:27:58,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914816757] [2025-02-06 09:27:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914816757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:27:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937829210] [2025-02-06 09:27:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:27:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:27:58,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:27:58,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 318 [2025-02-06 09:27:58,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 270 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 318 [2025-02-06 09:27:58,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,769 INFO L124 PetriNetUnfolderBase]: 79/971 cut-off events. [2025-02-06 09:27:58,769 INFO L125 PetriNetUnfolderBase]: For 159/163 co-relation queries the response was YES. [2025-02-06 09:27:58,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 971 events. 79/971 cut-off events. For 159/163 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4468 event pairs, 12 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1313. Up to 54 conditions per place. [2025-02-06 09:27:58,777 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 19 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2025-02-06 09:27:58,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 273 transitions, 769 flow [2025-02-06 09:27:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:27:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:27:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-02-06 09:27:58,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187631027253669 [2025-02-06 09:27:58,780 INFO L175 Difference]: Start difference. First operand has 281 places, 270 transitions, 709 flow. Second operand 6 states and 1753 transitions. [2025-02-06 09:27:58,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 273 transitions, 769 flow [2025-02-06 09:27:58,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 273 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:58,786 INFO L231 Difference]: Finished difference. Result has 280 places, 269 transitions, 707 flow [2025-02-06 09:27:58,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=280, PETRI_TRANSITIONS=269} [2025-02-06 09:27:58,787 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2025-02-06 09:27:58,787 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 269 transitions, 707 flow [2025-02-06 09:27:58,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,787 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] [2025-02-06 09:27:58,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:27:58,788 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:58,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1291043550, now seen corresponding path program 1 times [2025-02-06 09:27:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666674238] [2025-02-06 09:27:58,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-06 09:27:58,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-06 09:27:58,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:27:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666674238] [2025-02-06 09:27:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666674238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798223620] [2025-02-06 09:27:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 318 [2025-02-06 09:27:58,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 269 transitions, 707 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 318 [2025-02-06 09:27:58,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,929 INFO L124 PetriNetUnfolderBase]: 46/820 cut-off events. [2025-02-06 09:27:58,929 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 09:27:58,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 820 events. 46/820 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2583 event pairs, 17 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1075. Up to 64 conditions per place. [2025-02-06 09:27:58,934 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2025-02-06 09:27:58,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 269 transitions, 734 flow [2025-02-06 09:27:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-02-06 09:27:58,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423480083857443 [2025-02-06 09:27:58,935 INFO L175 Difference]: Start difference. First operand has 280 places, 269 transitions, 707 flow. Second operand 3 states and 899 transitions. [2025-02-06 09:27:58,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 269 transitions, 734 flow [2025-02-06 09:27:58,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 269 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:27:58,939 INFO L231 Difference]: Finished difference. Result has 276 places, 268 transitions, 697 flow [2025-02-06 09:27:58,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=276, PETRI_TRANSITIONS=268} [2025-02-06 09:27:58,939 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2025-02-06 09:27:58,939 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 268 transitions, 697 flow [2025-02-06 09:27:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:58,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,940 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] [2025-02-06 09:27:58,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:27:58,940 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-02-06 09:27:58,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1888217710, now seen corresponding path program 1 times [2025-02-06 09:27:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198635786] [2025-02-06 09:27:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 09:27:58,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 09:27:58,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:27:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198635786] [2025-02-06 09:27:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198635786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926718354] [2025-02-06 09:27:58,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:59,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 318 [2025-02-06 09:27:59,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 268 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:59,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:59,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 318 [2025-02-06 09:27:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,084 INFO L124 PetriNetUnfolderBase]: 89/968 cut-off events. [2025-02-06 09:27:59,084 INFO L125 PetriNetUnfolderBase]: For 135/138 co-relation queries the response was YES. [2025-02-06 09:27:59,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 968 events. 89/968 cut-off events. For 135/138 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4196 event pairs, 33 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1272. Up to 102 conditions per place. [2025-02-06 09:27:59,089 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 0 selfloop transitions, 0 changer transitions 268/268 dead transitions. [2025-02-06 09:27:59,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 268 transitions, 724 flow [2025-02-06 09:27:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-02-06 09:27:59,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423480083857443 [2025-02-06 09:27:59,091 INFO L175 Difference]: Start difference. First operand has 276 places, 268 transitions, 697 flow. Second operand 3 states and 899 transitions. [2025-02-06 09:27:59,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 268 transitions, 724 flow [2025-02-06 09:27:59,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 268 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:59,093 INFO L231 Difference]: Finished difference. Result has 275 places, 0 transitions, 0 flow [2025-02-06 09:27:59,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=318, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=275, PETRI_TRANSITIONS=0} [2025-02-06 09:27:59,094 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -17 predicate places. [2025-02-06 09:27:59,094 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 0 transitions, 0 flow [2025-02-06 09:27:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:27:59,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-02-06 09:27:59,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-02-06 09:27:59,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-02-06 09:27:59,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-02-06 09:27:59,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-02-06 09:27:59,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-02-06 09:27:59,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-02-06 09:27:59,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:27:59,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:59,103 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:27:59,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:27:59,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:27:59 BasicIcfg [2025-02-06 09:27:59,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:27:59,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:27:59,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:27:59,109 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:27:59,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:50" (3/4) ... [2025-02-06 09:27:59,110 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:27:59,113 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:27:59,113 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:27:59,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-06 09:27:59,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:27:59,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:27:59,118 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:27:59,186 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:27:59,186 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:27:59,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:27:59,187 INFO L158 Benchmark]: Toolchain (without parser) took 9866.43ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 160.8MB in the beginning and 203.7MB in the end (delta: -42.9MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,187 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:59,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.40ms. Allocated memory is still 201.3MB. Free memory was 160.8MB in the beginning and 148.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.73ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 146.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:59,188 INFO L158 Benchmark]: Boogie Preprocessor took 21.66ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,188 INFO L158 Benchmark]: IcfgBuilder took 493.08ms. Allocated memory is still 201.3MB. Free memory was 145.1MB in the beginning and 118.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,188 INFO L158 Benchmark]: TraceAbstraction took 9041.84ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 118.2MB in the beginning and 207.9MB in the end (delta: -89.7MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,189 INFO L158 Benchmark]: Witness Printer took 77.72ms. Allocated memory is still 394.3MB. Free memory was 207.9MB in the beginning and 203.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:59,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.40ms. Allocated memory is still 201.3MB. Free memory was 160.8MB in the beginning and 148.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.73ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 146.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.66ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 145.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 493.08ms. Allocated memory is still 201.3MB. Free memory was 145.1MB in the beginning and 118.6MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9041.84ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 118.2MB in the beginning and 207.9MB in the end (delta: -89.7MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB. * Witness Printer took 77.72ms. Allocated memory is still 394.3MB. Free memory was 207.9MB in the beginning and 203.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2645 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1734 mSDsluCounter, 1844 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1669 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4174 IncrementalHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 175 mSDtfsCounter, 4174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=16, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:27:59,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE