./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:28:19,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:28:19,874 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:28:19,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:28:19,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:28:19,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:28:19,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:28:19,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:28:19,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:28:19,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:28:19,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:28:19,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:19,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:28:19,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:28:19,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:28:19,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:28:19,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:28:19,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:28:19,893 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-02-06 09:28:20,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:28:20,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:28:20,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:28:20,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:28:20,139 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:28:20,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-06 09:28:21,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9f2ad298/9c310102565448569db98e8988330fcb/FLAG9392fd1a4 [2025-02-06 09:28:21,494 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:28:21,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-06 09:28:21,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9f2ad298/9c310102565448569db98e8988330fcb/FLAG9392fd1a4 [2025-02-06 09:28:21,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9f2ad298/9c310102565448569db98e8988330fcb [2025-02-06 09:28:21,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:28:21,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:28:21,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:21,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:28:21,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:28:21,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:21" (1/1) ... [2025-02-06 09:28:21,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb9d6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:21, skipping insertion in model container [2025-02-06 09:28:21,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:21" (1/1) ... [2025-02-06 09:28:21,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:28:22,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:22,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:28:22,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:22,098 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:28:22,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22 WrapperNode [2025-02-06 09:28:22,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:22,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:22,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:28:22,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:28:22,104 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:28:22" (1/1) ... [2025-02-06 09:28:22,114 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:28:22" (1/1) ... [2025-02-06 09:28:22,136 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 428 [2025-02-06 09:28:22,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:22,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:28:22,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:28:22,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:28:22,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:28:22,164 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:28:22,164 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:28:22,164 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:28:22,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (1/1) ... [2025-02-06 09:28:22,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:22,196 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:28:22,200 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:28:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:28:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:28:22,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:28:22,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:28:22,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:28:22,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:28:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:28:22,214 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:28:22,288 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:28:22,289 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:28:22,931 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:28:22,931 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:28:22,946 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:28:22,946 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:28:22,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:22 BoogieIcfgContainer [2025-02-06 09:28:22,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:28:22,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:28:22,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:28:22,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:28:22,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:28:21" (1/3) ... [2025-02-06 09:28:22,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277598d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:22, skipping insertion in model container [2025-02-06 09:28:22,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:22" (2/3) ... [2025-02-06 09:28:22,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277598d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:22, skipping insertion in model container [2025-02-06 09:28:22,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:22" (3/3) ... [2025-02-06 09:28:22,956 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-02-06 09:28:22,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:28:22,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 557 locations, 1 initial locations, 6 loop locations, and 47 error locations. [2025-02-06 09:28:22,978 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:28:23,160 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:28:23,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 566 places, 583 transitions, 1187 flow [2025-02-06 09:28:23,419 INFO L124 PetriNetUnfolderBase]: 27/580 cut-off events. [2025-02-06 09:28:23,422 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:23,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 580 events. 27/580 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1285 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-02-06 09:28:23,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 566 places, 583 transitions, 1187 flow [2025-02-06 09:28:23,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 560 transitions, 1138 flow [2025-02-06 09:28:23,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:28:23,469 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;@532a2cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:28:23,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-02-06 09:28:23,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:28:23,477 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-02-06 09:28:23,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:28:23,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:23,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:23,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:23,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -83003237, now seen corresponding path program 1 times [2025-02-06 09:28:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48776689] [2025-02-06 09:28:23,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:23,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:28:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:28:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:24,141 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:28:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48776689] [2025-02-06 09:28:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48776689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48226708] [2025-02-06 09:28:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:24,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:24,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:24,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:24,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 493 out of 583 [2025-02-06 09:28:24,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 560 transitions, 1138 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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:28:24,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:24,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 493 of 583 [2025-02-06 09:28:24,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:26,609 INFO L124 PetriNetUnfolderBase]: 2074/15191 cut-off events. [2025-02-06 09:28:26,609 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2025-02-06 09:28:26,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18394 conditions, 15191 events. 2074/15191 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 184251 event pairs, 1520 based on Foata normal form. 641/13459 useless extension candidates. Maximal degree in co-relation 16163. Up to 2820 conditions per place. [2025-02-06 09:28:26,731 INFO L140 encePairwiseOnDemand]: 549/583 looper letters, 54 selfloop transitions, 15 changer transitions 7/541 dead transitions. [2025-02-06 09:28:26,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 541 transitions, 1238 flow [2025-02-06 09:28:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3046 transitions. [2025-02-06 09:28:26,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8707833047455689 [2025-02-06 09:28:26,753 INFO L175 Difference]: Start difference. First operand has 545 places, 560 transitions, 1138 flow. Second operand 6 states and 3046 transitions. [2025-02-06 09:28:26,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 541 transitions, 1238 flow [2025-02-06 09:28:26,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 541 transitions, 1226 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:28:26,767 INFO L231 Difference]: Finished difference. Result has 541 places, 534 transitions, 1104 flow [2025-02-06 09:28:26,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=541, PETRI_TRANSITIONS=534} [2025-02-06 09:28:26,771 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -4 predicate places. [2025-02-06 09:28:26,771 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 534 transitions, 1104 flow [2025-02-06 09:28:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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:28:26,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:26,773 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] [2025-02-06 09:28:26,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:28:26,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:26,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1097483258, now seen corresponding path program 1 times [2025-02-06 09:28:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730146241] [2025-02-06 09:28:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:26,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:28:26,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:28:26,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:26,808 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:28:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730146241] [2025-02-06 09:28:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730146241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644876333] [2025-02-06 09:28:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:26,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:26,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:26,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 534 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:26,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:26,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:26,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:26,963 INFO L124 PetriNetUnfolderBase]: 24/956 cut-off events. [2025-02-06 09:28:26,963 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-06 09:28:26,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 956 events. 24/956 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3978 event pairs, 7 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 959. Up to 25 conditions per place. [2025-02-06 09:28:26,975 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-02-06 09:28:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 533 transitions, 1128 flow [2025-02-06 09:28:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:26,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:26,978 INFO L175 Difference]: Start difference. First operand has 541 places, 534 transitions, 1104 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:26,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 533 transitions, 1128 flow [2025-02-06 09:28:26,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 533 transitions, 1098 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:26,985 INFO L231 Difference]: Finished difference. Result has 530 places, 533 transitions, 1076 flow [2025-02-06 09:28:26,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=530, PETRI_TRANSITIONS=533} [2025-02-06 09:28:26,987 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -15 predicate places. [2025-02-06 09:28:26,987 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 533 transitions, 1076 flow [2025-02-06 09:28:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:26,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:26,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:26,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:28:26,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:26,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1258338247, now seen corresponding path program 1 times [2025-02-06 09:28:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020830940] [2025-02-06 09:28:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:26,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:28:27,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:28:27,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:27,065 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:28:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020830940] [2025-02-06 09:28:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020830940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:27,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588462698] [2025-02-06 09:28:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:27,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:27,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:27,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:27,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:27,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 533 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:27,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:27,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:27,160 INFO L124 PetriNetUnfolderBase]: 18/748 cut-off events. [2025-02-06 09:28:27,161 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:28:27,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 748 events. 18/748 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2627 event pairs, 5 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 708. Up to 22 conditions per place. [2025-02-06 09:28:27,171 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-06 09:28:27,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 532 transitions, 1100 flow [2025-02-06 09:28:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:27,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:27,174 INFO L175 Difference]: Start difference. First operand has 530 places, 533 transitions, 1076 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:27,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 532 transitions, 1100 flow [2025-02-06 09:28:27,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 532 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:27,181 INFO L231 Difference]: Finished difference. Result has 529 places, 532 transitions, 1074 flow [2025-02-06 09:28:27,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=529, PETRI_TRANSITIONS=532} [2025-02-06 09:28:27,182 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -16 predicate places. [2025-02-06 09:28:27,182 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 532 transitions, 1074 flow [2025-02-06 09:28:27,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:27,183 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] [2025-02-06 09:28:27,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:28:27,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1448650468, now seen corresponding path program 1 times [2025-02-06 09:28:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488144780] [2025-02-06 09:28:27,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:28:27,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:28:27,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:27,225 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:28:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488144780] [2025-02-06 09:28:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488144780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9674727] [2025-02-06 09:28:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:27,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:27,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:27,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:27,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:27,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:27,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:27,315 INFO L124 PetriNetUnfolderBase]: 18/645 cut-off events. [2025-02-06 09:28:27,315 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-06 09:28:27,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 645 events. 18/645 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2031 event pairs, 7 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 560. Up to 25 conditions per place. [2025-02-06 09:28:27,322 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/531 dead transitions. [2025-02-06 09:28:27,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 531 transitions, 1098 flow [2025-02-06 09:28:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:27,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:27,325 INFO L175 Difference]: Start difference. First operand has 529 places, 532 transitions, 1074 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:27,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 531 transitions, 1098 flow [2025-02-06 09:28:27,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 531 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:27,333 INFO L231 Difference]: Finished difference. Result has 528 places, 531 transitions, 1072 flow [2025-02-06 09:28:27,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=528, PETRI_TRANSITIONS=531} [2025-02-06 09:28:27,336 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -17 predicate places. [2025-02-06 09:28:27,336 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 531 transitions, 1072 flow [2025-02-06 09:28:27,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:27,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:27,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:28:27,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:27,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash -859777081, now seen corresponding path program 1 times [2025-02-06 09:28:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:27,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137858546] [2025-02-06 09:28:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:28:27,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:28:27,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:27,404 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:28:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137858546] [2025-02-06 09:28:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137858546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705235672] [2025-02-06 09:28:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:27,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:27,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:27,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:27,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:27,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 531 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:27,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:27,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:27,527 INFO L124 PetriNetUnfolderBase]: 28/1131 cut-off events. [2025-02-06 09:28:27,527 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:27,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 1131 events. 28/1131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5512 event pairs, 7 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1002. Up to 25 conditions per place. [2025-02-06 09:28:27,541 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-02-06 09:28:27,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 530 transitions, 1096 flow [2025-02-06 09:28:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:27,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:27,544 INFO L175 Difference]: Start difference. First operand has 528 places, 531 transitions, 1072 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:27,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 530 transitions, 1096 flow [2025-02-06 09:28:27,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 530 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:27,556 INFO L231 Difference]: Finished difference. Result has 527 places, 530 transitions, 1070 flow [2025-02-06 09:28:27,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=527, PETRI_TRANSITIONS=530} [2025-02-06 09:28:27,557 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-02-06 09:28:27,557 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 530 transitions, 1070 flow [2025-02-06 09:28:27,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:27,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:28:27,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:27,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1946930681, now seen corresponding path program 1 times [2025-02-06 09:28:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:27,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239130922] [2025-02-06 09:28:27,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 09:28:27,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 09:28:27,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:27,645 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:28:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239130922] [2025-02-06 09:28:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239130922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775738991] [2025-02-06 09:28:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:27,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:27,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:27,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:27,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 530 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:27,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:27,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:27,799 INFO L124 PetriNetUnfolderBase]: 22/941 cut-off events. [2025-02-06 09:28:27,799 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-02-06 09:28:27,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 941 events. 22/941 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3561 event pairs, 5 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 799. Up to 22 conditions per place. [2025-02-06 09:28:27,809 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-02-06 09:28:27,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 529 transitions, 1094 flow [2025-02-06 09:28:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:27,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:27,812 INFO L175 Difference]: Start difference. First operand has 527 places, 530 transitions, 1070 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:27,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 529 transitions, 1094 flow [2025-02-06 09:28:27,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:27,818 INFO L231 Difference]: Finished difference. Result has 526 places, 529 transitions, 1068 flow [2025-02-06 09:28:27,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=526, PETRI_TRANSITIONS=529} [2025-02-06 09:28:27,820 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-02-06 09:28:27,820 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 529 transitions, 1068 flow [2025-02-06 09:28:27,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:27,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:28:27,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:27,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 113104616, now seen corresponding path program 1 times [2025-02-06 09:28:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179047312] [2025-02-06 09:28:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 09:28:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 09:28:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:27,864 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:28:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179047312] [2025-02-06 09:28:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179047312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:27,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:27,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225320566] [2025-02-06 09:28:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:27,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:27,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:27,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:27,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 583 [2025-02-06 09:28:27,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 529 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:27,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 583 [2025-02-06 09:28:27,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:27,961 INFO L124 PetriNetUnfolderBase]: 24/906 cut-off events. [2025-02-06 09:28:27,962 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-06 09:28:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 906 events. 24/906 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3255 event pairs, 7 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 758. Up to 25 conditions per place. [2025-02-06 09:28:27,974 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 11 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-02-06 09:28:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 528 transitions, 1092 flow [2025-02-06 09:28:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:27,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:27,977 INFO L175 Difference]: Start difference. First operand has 526 places, 529 transitions, 1068 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:27,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 528 transitions, 1092 flow [2025-02-06 09:28:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 528 transitions, 1088 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:27,983 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1066 flow [2025-02-06 09:28:27,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-02-06 09:28:27,984 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-02-06 09:28:27,984 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1066 flow [2025-02-06 09:28:27,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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:28:27,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:28:27,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1320611906, now seen corresponding path program 1 times [2025-02-06 09:28:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543969917] [2025-02-06 09:28:27,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:27,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:28:27,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:28:27,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:27,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,023 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:28:28,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543969917] [2025-02-06 09:28:28,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543969917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53096460] [2025-02-06 09:28:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:28,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:28,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:28,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:28,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:28,147 INFO L124 PetriNetUnfolderBase]: 45/1330 cut-off events. [2025-02-06 09:28:28,147 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:28:28,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1330 events. 45/1330 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7330 event pairs, 6 based on Foata normal form. 0/1148 useless extension candidates. Maximal degree in co-relation 1204. Up to 43 conditions per place. [2025-02-06 09:28:28,160 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-02-06 09:28:28,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 530 transitions, 1102 flow [2025-02-06 09:28:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-02-06 09:28:28,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-02-06 09:28:28,163 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1066 flow. Second operand 3 states and 1673 transitions. [2025-02-06 09:28:28,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 530 transitions, 1102 flow [2025-02-06 09:28:28,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 530 transitions, 1098 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:28,170 INFO L231 Difference]: Finished difference. Result has 524 places, 528 transitions, 1072 flow [2025-02-06 09:28:28,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1072, PETRI_PLACES=524, PETRI_TRANSITIONS=528} [2025-02-06 09:28:28,171 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -21 predicate places. [2025-02-06 09:28:28,171 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 528 transitions, 1072 flow [2025-02-06 09:28:28,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:28,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:28,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:28,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:28:28,173 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:28,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1054006339, now seen corresponding path program 1 times [2025-02-06 09:28:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761385601] [2025-02-06 09:28:28,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:28,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:28:28,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:28:28,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:28,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,240 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:28:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761385601] [2025-02-06 09:28:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761385601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757452956] [2025-02-06 09:28:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:28,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:28,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 528 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:28,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:28,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:28,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:28,391 INFO L124 PetriNetUnfolderBase]: 36/1203 cut-off events. [2025-02-06 09:28:28,392 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:28:28,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 1203 events. 36/1203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5733 event pairs, 6 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 953. Up to 31 conditions per place. [2025-02-06 09:28:28,405 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2025-02-06 09:28:28,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1108 flow [2025-02-06 09:28:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-02-06 09:28:28,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-02-06 09:28:28,408 INFO L175 Difference]: Start difference. First operand has 524 places, 528 transitions, 1072 flow. Second operand 3 states and 1673 transitions. [2025-02-06 09:28:28,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1108 flow [2025-02-06 09:28:28,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 530 transitions, 1108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:28,414 INFO L231 Difference]: Finished difference. Result has 525 places, 528 transitions, 1082 flow [2025-02-06 09:28:28,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=525, PETRI_TRANSITIONS=528} [2025-02-06 09:28:28,415 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-02-06 09:28:28,415 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 528 transitions, 1082 flow [2025-02-06 09:28:28,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:28,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:28,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:28,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:28:28,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1383249503, now seen corresponding path program 1 times [2025-02-06 09:28:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673008539] [2025-02-06 09:28:28,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:28,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:28:28,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:28:28,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:28,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,454 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:28:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673008539] [2025-02-06 09:28:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673008539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145946592] [2025-02-06 09:28:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:28,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-02-06 09:28:28,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 528 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:28:28,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:28,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-02-06 09:28:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:28,589 INFO L124 PetriNetUnfolderBase]: 39/1108 cut-off events. [2025-02-06 09:28:28,589 INFO L125 PetriNetUnfolderBase]: For 2/14 co-relation queries the response was YES. [2025-02-06 09:28:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 1108 events. 39/1108 cut-off events. For 2/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5598 event pairs, 12 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 891. Up to 38 conditions per place. [2025-02-06 09:28:28,602 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 15 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-02-06 09:28:28,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-02-06 09:28:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-02-06 09:28:28,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-02-06 09:28:28,605 INFO L175 Difference]: Start difference. First operand has 525 places, 528 transitions, 1082 flow. Second operand 3 states and 1665 transitions. [2025-02-06 09:28:28,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-02-06 09:28:28,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 529 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:28,611 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1084 flow [2025-02-06 09:28:28,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-02-06 09:28:28,612 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-02-06 09:28:28,612 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1084 flow [2025-02-06 09:28:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:28:28,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:28,613 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] [2025-02-06 09:28:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:28:28,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -987302140, now seen corresponding path program 1 times [2025-02-06 09:28:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643570511] [2025-02-06 09:28:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 09:28:28,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 09:28:28,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:28,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,650 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:28:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643570511] [2025-02-06 09:28:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643570511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947406666] [2025-02-06 09:28:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:28,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:28,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:28,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:28:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:28,883 INFO L124 PetriNetUnfolderBase]: 77/2149 cut-off events. [2025-02-06 09:28:28,886 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-06 09:28:28,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 2149 events. 77/2149 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 15045 event pairs, 16 based on Foata normal form. 0/1857 useless extension candidates. Maximal degree in co-relation 1651. Up to 66 conditions per place. [2025-02-06 09:28:28,903 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/529 dead transitions. [2025-02-06 09:28:28,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 529 transitions, 1120 flow [2025-02-06 09:28:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-02-06 09:28:28,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-02-06 09:28:28,906 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1084 flow. Second operand 3 states and 1673 transitions. [2025-02-06 09:28:28,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 529 transitions, 1120 flow [2025-02-06 09:28:28,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 529 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:28,912 INFO L231 Difference]: Finished difference. Result has 525 places, 527 transitions, 1090 flow [2025-02-06 09:28:28,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1090, PETRI_PLACES=525, PETRI_TRANSITIONS=527} [2025-02-06 09:28:28,913 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -20 predicate places. [2025-02-06 09:28:28,913 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 527 transitions, 1090 flow [2025-02-06 09:28:28,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:28:28,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:28,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:28,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:28:28,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -624284565, now seen corresponding path program 1 times [2025-02-06 09:28:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:28,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758397518] [2025-02-06 09:28:28,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:28:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:28:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,961 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:28:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758397518] [2025-02-06 09:28:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758397518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351187236] [2025-02-06 09:28:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:28,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:28,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:28,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 527 transitions, 1090 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:28,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:28,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:29,196 INFO L124 PetriNetUnfolderBase]: 77/1945 cut-off events. [2025-02-06 09:28:29,197 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-02-06 09:28:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1945 events. 77/1945 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 12856 event pairs, 4 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 1564. Up to 69 conditions per place. [2025-02-06 09:28:29,215 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-06 09:28:29,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 532 transitions, 1141 flow [2025-02-06 09:28:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-02-06 09:28:29,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-02-06 09:28:29,218 INFO L175 Difference]: Start difference. First operand has 525 places, 527 transitions, 1090 flow. Second operand 3 states and 1676 transitions. [2025-02-06 09:28:29,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 532 transitions, 1141 flow [2025-02-06 09:28:29,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 532 transitions, 1141 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:29,223 INFO L231 Difference]: Finished difference. Result has 526 places, 527 transitions, 1100 flow [2025-02-06 09:28:29,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1100, PETRI_PLACES=526, PETRI_TRANSITIONS=527} [2025-02-06 09:28:29,224 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-02-06 09:28:29,225 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 527 transitions, 1100 flow [2025-02-06 09:28:29,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:29,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:29,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:29,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:28:29,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:29,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2122046949, now seen corresponding path program 1 times [2025-02-06 09:28:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756952014] [2025-02-06 09:28:29,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:29,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:29,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:29,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:29,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:29,272 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:28:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756952014] [2025-02-06 09:28:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756952014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:29,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:29,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797594546] [2025-02-06 09:28:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:29,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:29,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:29,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:29,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 583 [2025-02-06 09:28:29,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 527 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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:28:29,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:29,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 583 [2025-02-06 09:28:29,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:29,610 INFO L124 PetriNetUnfolderBase]: 90/2599 cut-off events. [2025-02-06 09:28:29,610 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-02-06 09:28:29,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 2599 events. 90/2599 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 17733 event pairs, 10 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 2373. Up to 40 conditions per place. [2025-02-06 09:28:29,634 INFO L140 encePairwiseOnDemand]: 575/583 looper letters, 15 selfloop transitions, 5 changer transitions 0/529 dead transitions. [2025-02-06 09:28:29,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 529 transitions, 1146 flow [2025-02-06 09:28:29,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1664 transitions. [2025-02-06 09:28:29,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514008004574043 [2025-02-06 09:28:29,637 INFO L175 Difference]: Start difference. First operand has 526 places, 527 transitions, 1100 flow. Second operand 3 states and 1664 transitions. [2025-02-06 09:28:29,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 529 transitions, 1146 flow [2025-02-06 09:28:29,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 529 transitions, 1146 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:29,644 INFO L231 Difference]: Finished difference. Result has 527 places, 527 transitions, 1126 flow [2025-02-06 09:28:29,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=527, PETRI_TRANSITIONS=527} [2025-02-06 09:28:29,646 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -18 predicate places. [2025-02-06 09:28:29,646 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 527 transitions, 1126 flow [2025-02-06 09:28:29,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 548.3333333333334) internal successors, (1645), 3 states have internal predecessors, (1645), 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:28:29,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:29,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:29,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:28:29,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:29,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1305608933, now seen corresponding path program 1 times [2025-02-06 09:28:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:29,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877593307] [2025-02-06 09:28:29,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:29,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:29,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:29,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:29,696 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:28:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877593307] [2025-02-06 09:28:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877593307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101059407] [2025-02-06 09:28:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:29,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:29,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:29,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:29,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:28:29,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 527 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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:28:29,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:29,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:28:29,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:30,029 INFO L124 PetriNetUnfolderBase]: 104/2074 cut-off events. [2025-02-06 09:28:30,030 INFO L125 PetriNetUnfolderBase]: For 31/63 co-relation queries the response was YES. [2025-02-06 09:28:30,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 2074 events. 104/2074 cut-off events. For 31/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13959 event pairs, 36 based on Foata normal form. 1/1806 useless extension candidates. Maximal degree in co-relation 1940. Up to 112 conditions per place. [2025-02-06 09:28:30,059 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/528 dead transitions. [2025-02-06 09:28:30,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 528 transitions, 1166 flow [2025-02-06 09:28:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-02-06 09:28:30,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-02-06 09:28:30,063 INFO L175 Difference]: Start difference. First operand has 527 places, 527 transitions, 1126 flow. Second operand 3 states and 1663 transitions. [2025-02-06 09:28:30,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 528 transitions, 1166 flow [2025-02-06 09:28:30,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 528 transitions, 1156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:30,072 INFO L231 Difference]: Finished difference. Result has 526 places, 526 transitions, 1118 flow [2025-02-06 09:28:30,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=526, PETRI_TRANSITIONS=526} [2025-02-06 09:28:30,073 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -19 predicate places. [2025-02-06 09:28:30,073 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 526 transitions, 1118 flow [2025-02-06 09:28:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 549.6666666666666) internal successors, (1649), 3 states have internal predecessors, (1649), 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:28:30,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:30,074 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] [2025-02-06 09:28:30,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:28:30,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 307806930, now seen corresponding path program 1 times [2025-02-06 09:28:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:30,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861464193] [2025-02-06 09:28:30,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:30,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:30,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 09:28:30,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 09:28:30,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:30,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:30,169 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:28:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:30,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861464193] [2025-02-06 09:28:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861464193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233751273] [2025-02-06 09:28:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:30,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:30,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:30,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:30,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-02-06 09:28:30,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 526 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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:28:30,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:30,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-02-06 09:28:30,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:30,803 INFO L124 PetriNetUnfolderBase]: 99/3208 cut-off events. [2025-02-06 09:28:30,804 INFO L125 PetriNetUnfolderBase]: For 9/43 co-relation queries the response was YES. [2025-02-06 09:28:30,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 3208 events. 99/3208 cut-off events. For 9/43 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22138 event pairs, 15 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 3059. Up to 50 conditions per place. [2025-02-06 09:28:30,828 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 27 selfloop transitions, 4 changer transitions 0/542 dead transitions. [2025-02-06 09:28:30,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 542 transitions, 1222 flow [2025-02-06 09:28:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2787 transitions. [2025-02-06 09:28:30,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560891938250429 [2025-02-06 09:28:30,831 INFO L175 Difference]: Start difference. First operand has 526 places, 526 transitions, 1118 flow. Second operand 5 states and 2787 transitions. [2025-02-06 09:28:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 542 transitions, 1222 flow [2025-02-06 09:28:30,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 542 transitions, 1218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:30,837 INFO L231 Difference]: Finished difference. Result has 531 places, 528 transitions, 1139 flow [2025-02-06 09:28:30,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1139, PETRI_PLACES=531, PETRI_TRANSITIONS=528} [2025-02-06 09:28:30,838 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -14 predicate places. [2025-02-06 09:28:30,838 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 528 transitions, 1139 flow [2025-02-06 09:28:30,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.25) internal successors, (2209), 4 states have internal predecessors, (2209), 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:28:30,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:30,839 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] [2025-02-06 09:28:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:28:30,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:30,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -683721101, now seen corresponding path program 1 times [2025-02-06 09:28:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256632252] [2025-02-06 09:28:30,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:30,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 09:28:30,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 09:28:30,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:30,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:30,924 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:28:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256632252] [2025-02-06 09:28:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256632252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167018158] [2025-02-06 09:28:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:28:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:30,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:28:30,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:28:31,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 583 [2025-02-06 09:28:31,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 528 transitions, 1139 flow. Second operand has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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:28:31,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:31,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 583 [2025-02-06 09:28:31,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,228 INFO L124 PetriNetUnfolderBase]: 33/1368 cut-off events. [2025-02-06 09:28:31,228 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-02-06 09:28:31,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1368 events. 33/1368 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6532 event pairs, 1 based on Foata normal form. 3/1218 useless extension candidates. Maximal degree in co-relation 1367. Up to 20 conditions per place. [2025-02-06 09:28:31,249 INFO L140 encePairwiseOnDemand]: 562/583 looper letters, 18 selfloop transitions, 18 changer transitions 0/531 dead transitions. [2025-02-06 09:28:31,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 531 transitions, 1217 flow [2025-02-06 09:28:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2699 transitions. [2025-02-06 09:28:31,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259005145797599 [2025-02-06 09:28:31,257 INFO L175 Difference]: Start difference. First operand has 531 places, 528 transitions, 1139 flow. Second operand 5 states and 2699 transitions. [2025-02-06 09:28:31,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 531 transitions, 1217 flow [2025-02-06 09:28:31,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 531 transitions, 1217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:31,263 INFO L231 Difference]: Finished difference. Result has 536 places, 531 transitions, 1199 flow [2025-02-06 09:28:31,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1199, PETRI_PLACES=536, PETRI_TRANSITIONS=531} [2025-02-06 09:28:31,264 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -9 predicate places. [2025-02-06 09:28:31,264 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 531 transitions, 1199 flow [2025-02-06 09:28:31,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 537.0) internal successors, (2685), 5 states have internal predecessors, (2685), 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:28:31,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:31,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:31,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:28:31,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:31,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1440188446, now seen corresponding path program 1 times [2025-02-06 09:28:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723652774] [2025-02-06 09:28:31,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:31,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:31,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:31,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:28:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723652774] [2025-02-06 09:28:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723652774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:31,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302308614] [2025-02-06 09:28:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:31,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:31,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-02-06 09:28:31,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 531 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:28:31,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:31,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-02-06 09:28:31,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,969 INFO L124 PetriNetUnfolderBase]: 142/4467 cut-off events. [2025-02-06 09:28:31,969 INFO L125 PetriNetUnfolderBase]: For 46/93 co-relation queries the response was YES. [2025-02-06 09:28:32,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 4467 events. 142/4467 cut-off events. For 46/93 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35283 event pairs, 28 based on Foata normal form. 7/3908 useless extension candidates. Maximal degree in co-relation 4638. Up to 95 conditions per place. [2025-02-06 09:28:32,024 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 17 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-06 09:28:32,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1241 flow [2025-02-06 09:28:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-02-06 09:28:32,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9519725557461407 [2025-02-06 09:28:32,026 INFO L175 Difference]: Start difference. First operand has 536 places, 531 transitions, 1199 flow. Second operand 3 states and 1665 transitions. [2025-02-06 09:28:32,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1241 flow [2025-02-06 09:28:32,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 532 transitions, 1211 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:28:32,032 INFO L231 Difference]: Finished difference. Result has 534 places, 530 transitions, 1171 flow [2025-02-06 09:28:32,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1171, PETRI_PLACES=534, PETRI_TRANSITIONS=530} [2025-02-06 09:28:32,034 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -11 predicate places. [2025-02-06 09:28:32,034 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 530 transitions, 1171 flow [2025-02-06 09:28:32,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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:28:32,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:28:32,039 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:32,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash -299605285, now seen corresponding path program 1 times [2025-02-06 09:28:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054096016] [2025-02-06 09:28:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:32,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054096016] [2025-02-06 09:28:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054096016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209283722] [2025-02-06 09:28:32,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:32,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:28:32,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:28:32,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:32,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:32,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:28:32,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:32,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209283722] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:32,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:32,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 09:28:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950291723] [2025-02-06 09:28:32,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 09:28:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 09:28:32,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:28:32,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-02-06 09:28:32,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 530 transitions, 1171 flow. Second operand has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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:28:32,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-02-06 09:28:32,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:33,353 INFO L124 PetriNetUnfolderBase]: 33/1416 cut-off events. [2025-02-06 09:28:33,353 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-02-06 09:28:33,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1416 events. 33/1416 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6444 event pairs, 1 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 1467. Up to 20 conditions per place. [2025-02-06 09:28:33,375 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 30 selfloop transitions, 39 changer transitions 0/554 dead transitions. [2025-02-06 09:28:33,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 554 transitions, 1363 flow [2025-02-06 09:28:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:28:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:28:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5828 transitions. [2025-02-06 09:28:33,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087790425697801 [2025-02-06 09:28:33,381 INFO L175 Difference]: Start difference. First operand has 534 places, 530 transitions, 1171 flow. Second operand 11 states and 5828 transitions. [2025-02-06 09:28:33,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 554 transitions, 1363 flow [2025-02-06 09:28:33,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 554 transitions, 1359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:33,387 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1347 flow [2025-02-06 09:28:33,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2025-02-06 09:28:33,388 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2025-02-06 09:28:33,388 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1347 flow [2025-02-06 09:28:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 526.4666666666667) internal successors, (7897), 15 states have internal predecessors, (7897), 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:28:33,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:33,391 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:33,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:28:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 09:28:33,591 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash 678015643, now seen corresponding path program 2 times [2025-02-06 09:28:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428544565] [2025-02-06 09:28:33,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:28:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:33,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-02-06 09:28:33,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-02-06 09:28:33,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:28:33,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428544565] [2025-02-06 09:28:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428544565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639176550] [2025-02-06 09:28:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:34,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:34,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:34,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:28:34,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:28:34,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:34,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:28:34,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:34,896 INFO L124 PetriNetUnfolderBase]: 77/2316 cut-off events. [2025-02-06 09:28:34,896 INFO L125 PetriNetUnfolderBase]: For 50/92 co-relation queries the response was YES. [2025-02-06 09:28:34,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2316 events. 77/2316 cut-off events. For 50/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14070 event pairs, 5 based on Foata normal form. 8/2072 useless extension candidates. Maximal degree in co-relation 2564. Up to 70 conditions per place. [2025-02-06 09:28:34,932 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/555 dead transitions. [2025-02-06 09:28:34,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 555 transitions, 1441 flow [2025-02-06 09:28:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-02-06 09:28:34,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-02-06 09:28:34,937 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1347 flow. Second operand 6 states and 3258 transitions. [2025-02-06 09:28:34,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 555 transitions, 1441 flow [2025-02-06 09:28:34,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 555 transitions, 1405 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 09:28:34,947 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1321 flow [2025-02-06 09:28:34,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1321, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-02-06 09:28:34,948 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-02-06 09:28:34,949 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1321 flow [2025-02-06 09:28:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:28:34,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:34,950 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:34,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:28:34,950 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:34,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash -678009966, now seen corresponding path program 1 times [2025-02-06 09:28:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944916753] [2025-02-06 09:28:34,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:34,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 09:28:34,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 09:28:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:34,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944916753] [2025-02-06 09:28:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944916753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:35,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258681300] [2025-02-06 09:28:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:35,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:35,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:35,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:35,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:28:35,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:28:35,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:35,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:28:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:35,427 INFO L124 PetriNetUnfolderBase]: 145/2185 cut-off events. [2025-02-06 09:28:35,427 INFO L125 PetriNetUnfolderBase]: For 121/165 co-relation queries the response was YES. [2025-02-06 09:28:35,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 2185 events. 145/2185 cut-off events. For 121/165 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 14532 event pairs, 61 based on Foata normal form. 1/1889 useless extension candidates. Maximal degree in co-relation 2262. Up to 187 conditions per place. [2025-02-06 09:28:35,444 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-02-06 09:28:35,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1361 flow [2025-02-06 09:28:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-02-06 09:28:35,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-02-06 09:28:35,447 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1321 flow. Second operand 3 states and 1663 transitions. [2025-02-06 09:28:35,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1361 flow [2025-02-06 09:28:35,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 548 transitions, 1349 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:35,454 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1311 flow [2025-02-06 09:28:35,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-02-06 09:28:35,455 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-02-06 09:28:35,455 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1311 flow [2025-02-06 09:28:35,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 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:28:35,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:35,457 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:28:35,457 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -898089629, now seen corresponding path program 1 times [2025-02-06 09:28:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825501101] [2025-02-06 09:28:35,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 09:28:35,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 09:28:35,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:35,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825501101] [2025-02-06 09:28:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825501101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:35,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617345941] [2025-02-06 09:28:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:35,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:35,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:35,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:35,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-02-06 09:28:35,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:28:35,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:35,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-02-06 09:28:35,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:36,129 INFO L124 PetriNetUnfolderBase]: 154/3695 cut-off events. [2025-02-06 09:28:36,129 INFO L125 PetriNetUnfolderBase]: For 47/115 co-relation queries the response was YES. [2025-02-06 09:28:36,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 3695 events. 154/3695 cut-off events. For 47/115 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 27439 event pairs, 25 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 3851. Up to 110 conditions per place. [2025-02-06 09:28:36,186 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 17 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2025-02-06 09:28:36,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1359 flow [2025-02-06 09:28:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2025-02-06 09:28:36,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479702687249857 [2025-02-06 09:28:36,188 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1311 flow. Second operand 3 states and 1658 transitions. [2025-02-06 09:28:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1359 flow [2025-02-06 09:28:36,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:36,195 INFO L231 Difference]: Finished difference. Result has 540 places, 545 transitions, 1331 flow [2025-02-06 09:28:36,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=540, PETRI_TRANSITIONS=545} [2025-02-06 09:28:36,196 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -5 predicate places. [2025-02-06 09:28:36,196 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 545 transitions, 1331 flow [2025-02-06 09:28:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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:28:36,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:36,197 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:36,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:28:36,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1261958115, now seen corresponding path program 1 times [2025-02-06 09:28:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963208663] [2025-02-06 09:28:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:36,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-06 09:28:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-06 09:28:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963208663] [2025-02-06 09:28:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963208663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818380435] [2025-02-06 09:28:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:36,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:36,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 545 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:36,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:36,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:36,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:36,816 INFO L124 PetriNetUnfolderBase]: 136/3757 cut-off events. [2025-02-06 09:28:36,816 INFO L125 PetriNetUnfolderBase]: For 76/112 co-relation queries the response was YES. [2025-02-06 09:28:36,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 3757 events. 136/3757 cut-off events. For 76/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 27941 event pairs, 30 based on Foata normal form. 1/3336 useless extension candidates. Maximal degree in co-relation 3883. Up to 141 conditions per place. [2025-02-06 09:28:36,882 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 16 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-02-06 09:28:36,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 550 transitions, 1382 flow [2025-02-06 09:28:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2025-02-06 09:28:36,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9582618639222413 [2025-02-06 09:28:36,884 INFO L175 Difference]: Start difference. First operand has 540 places, 545 transitions, 1331 flow. Second operand 3 states and 1676 transitions. [2025-02-06 09:28:36,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 550 transitions, 1382 flow [2025-02-06 09:28:36,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 550 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:36,890 INFO L231 Difference]: Finished difference. Result has 539 places, 545 transitions, 1331 flow [2025-02-06 09:28:36,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1331, PETRI_PLACES=539, PETRI_TRANSITIONS=545} [2025-02-06 09:28:36,891 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-02-06 09:28:36,891 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 545 transitions, 1331 flow [2025-02-06 09:28:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.3333333333334) internal successors, (1660), 3 states have internal predecessors, (1660), 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:28:36,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:36,891 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:28:36,892 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1605969381, now seen corresponding path program 1 times [2025-02-06 09:28:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518112262] [2025-02-06 09:28:36,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:36,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 09:28:36,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 09:28:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518112262] [2025-02-06 09:28:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518112262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:36,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:36,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211419009] [2025-02-06 09:28:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:36,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:36,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:36,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:36,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:37,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-02-06 09:28:37,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 545 transitions, 1331 flow. Second operand has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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:28:37,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:37,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-02-06 09:28:37,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:38,063 INFO L124 PetriNetUnfolderBase]: 244/6510 cut-off events. [2025-02-06 09:28:38,064 INFO L125 PetriNetUnfolderBase]: For 89/254 co-relation queries the response was YES. [2025-02-06 09:28:38,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6510 events. 244/6510 cut-off events. For 89/254 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56572 event pairs, 58 based on Foata normal form. 6/5735 useless extension candidates. Maximal degree in co-relation 6989. Up to 155 conditions per place. [2025-02-06 09:28:38,150 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 25 selfloop transitions, 4 changer transitions 0/559 dead transitions. [2025-02-06 09:28:38,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 559 transitions, 1425 flow [2025-02-06 09:28:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2785 transitions. [2025-02-06 09:28:38,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554030874785592 [2025-02-06 09:28:38,154 INFO L175 Difference]: Start difference. First operand has 539 places, 545 transitions, 1331 flow. Second operand 5 states and 2785 transitions. [2025-02-06 09:28:38,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 559 transitions, 1425 flow [2025-02-06 09:28:38,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 559 transitions, 1425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:38,160 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1356 flow [2025-02-06 09:28:38,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1356, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-02-06 09:28:38,161 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 1 predicate places. [2025-02-06 09:28:38,161 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1356 flow [2025-02-06 09:28:38,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.5) internal successors, (2210), 4 states have internal predecessors, (2210), 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:28:38,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:38,162 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:38,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:28:38,162 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:38,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:38,163 INFO L85 PathProgramCache]: Analyzing trace with hash 163043743, now seen corresponding path program 1 times [2025-02-06 09:28:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:38,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429718847] [2025-02-06 09:28:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:38,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:38,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429718847] [2025-02-06 09:28:38,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429718847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:38,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:38,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:38,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985111087] [2025-02-06 09:28:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:38,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:38,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:38,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:38,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:38,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:28:38,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1356 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:28:38,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:38,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:28:38,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:40,171 INFO L124 PetriNetUnfolderBase]: 386/9202 cut-off events. [2025-02-06 09:28:40,171 INFO L125 PetriNetUnfolderBase]: For 237/455 co-relation queries the response was YES. [2025-02-06 09:28:40,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 9202 events. 386/9202 cut-off events. For 237/455 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 92128 event pairs, 113 based on Foata normal form. 6/8092 useless extension candidates. Maximal degree in co-relation 10088. Up to 310 conditions per place. [2025-02-06 09:28:40,263 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 18 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2025-02-06 09:28:40,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 548 transitions, 1400 flow [2025-02-06 09:28:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-02-06 09:28:40,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-02-06 09:28:40,265 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1356 flow. Second operand 3 states and 1663 transitions. [2025-02-06 09:28:40,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 548 transitions, 1400 flow [2025-02-06 09:28:40,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 548 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:40,272 INFO L231 Difference]: Finished difference. Result has 547 places, 546 transitions, 1358 flow [2025-02-06 09:28:40,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1358, PETRI_PLACES=547, PETRI_TRANSITIONS=546} [2025-02-06 09:28:40,273 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 2 predicate places. [2025-02-06 09:28:40,273 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 546 transitions, 1358 flow [2025-02-06 09:28:40,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 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:28:40,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:40,274 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:40,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:28:40,274 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:40,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1576749988, now seen corresponding path program 1 times [2025-02-06 09:28:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206115637] [2025-02-06 09:28:40,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:40,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:40,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:40,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:40,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206115637] [2025-02-06 09:28:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206115637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921477121] [2025-02-06 09:28:40,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:40,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:40,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:28:40,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:28:40,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:40,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:40,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:40,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:40,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 09:28:40,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:40,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921477121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:41,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:41,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-06 09:28:41,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954331708] [2025-02-06 09:28:41,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:41,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:28:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:41,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:28:41,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:28:41,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 523 out of 583 [2025-02-06 09:28:41,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 546 transitions, 1358 flow. Second operand has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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:28:41,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:41,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 523 of 583 [2025-02-06 09:28:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:42,620 INFO L124 PetriNetUnfolderBase]: 50/2302 cut-off events. [2025-02-06 09:28:42,620 INFO L125 PetriNetUnfolderBase]: For 84/116 co-relation queries the response was YES. [2025-02-06 09:28:42,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 2302 events. 50/2302 cut-off events. For 84/116 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13208 event pairs, 4 based on Foata normal form. 6/2101 useless extension candidates. Maximal degree in co-relation 2482. Up to 37 conditions per place. [2025-02-06 09:28:42,658 INFO L140 encePairwiseOnDemand]: 553/583 looper letters, 36 selfloop transitions, 57 changer transitions 0/576 dead transitions. [2025-02-06 09:28:42,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 576 transitions, 1688 flow [2025-02-06 09:28:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 09:28:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 09:28:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8990 transitions. [2025-02-06 09:28:42,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90707294924831 [2025-02-06 09:28:42,668 INFO L175 Difference]: Start difference. First operand has 547 places, 546 transitions, 1358 flow. Second operand 17 states and 8990 transitions. [2025-02-06 09:28:42,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 576 transitions, 1688 flow [2025-02-06 09:28:42,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 576 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:42,684 INFO L231 Difference]: Finished difference. Result has 564 places, 567 transitions, 1630 flow [2025-02-06 09:28:42,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1630, PETRI_PLACES=564, PETRI_TRANSITIONS=567} [2025-02-06 09:28:42,684 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 19 predicate places. [2025-02-06 09:28:42,684 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 567 transitions, 1630 flow [2025-02-06 09:28:42,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 526.1363636363636) internal successors, (11575), 22 states have internal predecessors, (11575), 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:28:42,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:42,691 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:42,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:28:42,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:42,891 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:42,893 INFO L85 PathProgramCache]: Analyzing trace with hash -458173412, now seen corresponding path program 2 times [2025-02-06 09:28:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134158914] [2025-02-06 09:28:42,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:28:42,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:42,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-02-06 09:28:42,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-02-06 09:28:42,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:28:42,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134158914] [2025-02-06 09:28:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134158914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:43,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:43,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861022476] [2025-02-06 09:28:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:43,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:43,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:43,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:43,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:28:43,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 567 transitions, 1630 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:28:43,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:43,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:28:43,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:44,414 INFO L124 PetriNetUnfolderBase]: 200/4564 cut-off events. [2025-02-06 09:28:44,414 INFO L125 PetriNetUnfolderBase]: For 219/444 co-relation queries the response was YES. [2025-02-06 09:28:44,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 4564 events. 200/4564 cut-off events. For 219/444 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34926 event pairs, 18 based on Foata normal form. 17/4114 useless extension candidates. Maximal degree in co-relation 5209. Up to 147 conditions per place. [2025-02-06 09:28:44,485 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 30 selfloop transitions, 6 changer transitions 0/574 dead transitions. [2025-02-06 09:28:44,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1724 flow [2025-02-06 09:28:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3258 transitions. [2025-02-06 09:28:44,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313893653516295 [2025-02-06 09:28:44,489 INFO L175 Difference]: Start difference. First operand has 564 places, 567 transitions, 1630 flow. Second operand 6 states and 3258 transitions. [2025-02-06 09:28:44,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1724 flow [2025-02-06 09:28:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 574 transitions, 1646 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-06 09:28:44,497 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1562 flow [2025-02-06 09:28:44,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2025-02-06 09:28:44,498 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 15 predicate places. [2025-02-06 09:28:44,498 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1562 flow [2025-02-06 09:28:44,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:28:44,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:44,500 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:44,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:28:44,500 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -77762984, now seen corresponding path program 1 times [2025-02-06 09:28:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783194173] [2025-02-06 09:28:44,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:44,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-06 09:28:44,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-06 09:28:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783194173] [2025-02-06 09:28:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783194173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:44,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389101742] [2025-02-06 09:28:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:44,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 583 [2025-02-06 09:28:44,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1562 flow. Second operand has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 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:28:44,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:44,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 583 [2025-02-06 09:28:44,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:45,658 INFO L124 PetriNetUnfolderBase]: 235/4728 cut-off events. [2025-02-06 09:28:45,659 INFO L125 PetriNetUnfolderBase]: For 255/339 co-relation queries the response was YES. [2025-02-06 09:28:45,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 4728 events. 235/4728 cut-off events. For 255/339 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 39298 event pairs, 56 based on Foata normal form. 14/4236 useless extension candidates. Maximal degree in co-relation 5108. Up to 240 conditions per place. [2025-02-06 09:28:45,719 INFO L140 encePairwiseOnDemand]: 574/583 looper letters, 13 selfloop transitions, 4 changer transitions 18/567 dead transitions. [2025-02-06 09:28:45,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 567 transitions, 1608 flow [2025-02-06 09:28:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2025-02-06 09:28:45,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473985134362493 [2025-02-06 09:28:45,721 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1562 flow. Second operand 3 states and 1657 transitions. [2025-02-06 09:28:45,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 567 transitions, 1608 flow [2025-02-06 09:28:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 567 transitions, 1596 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:45,729 INFO L231 Difference]: Finished difference. Result has 555 places, 547 transitions, 1529 flow [2025-02-06 09:28:45,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=555, PETRI_TRANSITIONS=547} [2025-02-06 09:28:45,730 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 10 predicate places. [2025-02-06 09:28:45,730 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 547 transitions, 1529 flow [2025-02-06 09:28:45,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 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:28:45,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:45,731 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:28:45,731 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:45,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1139840192, now seen corresponding path program 1 times [2025-02-06 09:28:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397074490] [2025-02-06 09:28:45,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:45,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-06 09:28:45,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-06 09:28:45,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:45,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397074490] [2025-02-06 09:28:46,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397074490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:46,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:46,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005224117] [2025-02-06 09:28:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:46,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:46,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:46,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:46,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:28:46,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:28:46,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:46,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:28:46,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,558 INFO L124 PetriNetUnfolderBase]: 124/3943 cut-off events. [2025-02-06 09:28:47,558 INFO L125 PetriNetUnfolderBase]: For 193/293 co-relation queries the response was YES. [2025-02-06 09:28:47,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 3943 events. 124/3943 cut-off events. For 193/293 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 27111 event pairs, 15 based on Foata normal form. 16/3623 useless extension candidates. Maximal degree in co-relation 4718. Up to 107 conditions per place. [2025-02-06 09:28:47,639 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-02-06 09:28:47,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-02-06 09:28:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-02-06 09:28:47,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-02-06 09:28:47,642 INFO L175 Difference]: Start difference. First operand has 555 places, 547 transitions, 1529 flow. Second operand 6 states and 3257 transitions. [2025-02-06 09:28:47,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-02-06 09:28:47,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:47,650 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-02-06 09:28:47,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-02-06 09:28:47,650 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-02-06 09:28:47,651 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-02-06 09:28:47,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 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:28:47,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,652 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:28:47,652 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:47,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2077023806, now seen corresponding path program 1 times [2025-02-06 09:28:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736524187] [2025-02-06 09:28:47,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-06 09:28:47,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-06 09:28:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:47,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:47,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736524187] [2025-02-06 09:28:47,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736524187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:47,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:47,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926931411] [2025-02-06 09:28:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:47,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 583 [2025-02-06 09:28:47,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:28:47,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:47,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 583 [2025-02-06 09:28:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:49,829 INFO L124 PetriNetUnfolderBase]: 497/10763 cut-off events. [2025-02-06 09:28:49,829 INFO L125 PetriNetUnfolderBase]: For 245/255 co-relation queries the response was YES. [2025-02-06 09:28:49,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 10763 events. 497/10763 cut-off events. For 245/255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 112023 event pairs, 162 based on Foata normal form. 0/9765 useless extension candidates. Maximal degree in co-relation 11900. Up to 618 conditions per place. [2025-02-06 09:28:49,936 INFO L140 encePairwiseOnDemand]: 579/583 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-02-06 09:28:49,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-02-06 09:28:49,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1673 transitions. [2025-02-06 09:28:49,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956546598056032 [2025-02-06 09:28:49,938 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1673 transitions. [2025-02-06 09:28:49,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-02-06 09:28:49,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:49,946 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-02-06 09:28:49,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-02-06 09:28:49,947 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -10 predicate places. [2025-02-06 09:28:49,948 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-02-06 09:28:49,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.6666666666666) internal successors, (1661), 3 states have internal predecessors, (1661), 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:28:49,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:49,948 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:49,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:28:49,949 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:49,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1618700147, now seen corresponding path program 1 times [2025-02-06 09:28:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500536858] [2025-02-06 09:28:49,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:49,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 09:28:49,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 09:28:49,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500536858] [2025-02-06 09:28:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500536858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112818706] [2025-02-06 09:28:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:50,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:50,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:50,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:50,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 583 [2025-02-06 09:28:50,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 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:28:50,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:50,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 583 [2025-02-06 09:28:50,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:51,540 INFO L124 PetriNetUnfolderBase]: 373/7895 cut-off events. [2025-02-06 09:28:51,540 INFO L125 PetriNetUnfolderBase]: For 359/421 co-relation queries the response was YES. [2025-02-06 09:28:51,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9567 conditions, 7895 events. 373/7895 cut-off events. For 359/421 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 79945 event pairs, 146 based on Foata normal form. 4/7091 useless extension candidates. Maximal degree in co-relation 9053. Up to 444 conditions per place. [2025-02-06 09:28:51,652 INFO L140 encePairwiseOnDemand]: 578/583 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-02-06 09:28:51,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-02-06 09:28:51,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2780 transitions. [2025-02-06 09:28:51,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536878216123499 [2025-02-06 09:28:51,654 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2780 transitions. [2025-02-06 09:28:51,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-02-06 09:28:51,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:51,661 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-02-06 09:28:51,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-02-06 09:28:51,662 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -3 predicate places. [2025-02-06 09:28:51,662 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-02-06 09:28:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 552.75) internal successors, (2211), 4 states have internal predecessors, (2211), 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:28:51,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:51,663 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:28:51,663 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:51,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash 813682801, now seen corresponding path program 1 times [2025-02-06 09:28:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:51,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801012715] [2025-02-06 09:28:51,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 09:28:51,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 09:28:51,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:51,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801012715] [2025-02-06 09:28:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801012715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:51,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:51,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:51,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015250825] [2025-02-06 09:28:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:51,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:51,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:51,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:28:51,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:28:51,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:51,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:28:51,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:53,387 INFO L124 PetriNetUnfolderBase]: 534/7743 cut-off events. [2025-02-06 09:28:53,387 INFO L125 PetriNetUnfolderBase]: For 830/900 co-relation queries the response was YES. [2025-02-06 09:28:53,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 7743 events. 534/7743 cut-off events. For 830/900 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 80467 event pairs, 275 based on Foata normal form. 2/7077 useless extension candidates. Maximal degree in co-relation 9680. Up to 783 conditions per place. [2025-02-06 09:28:53,493 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2025-02-06 09:28:53,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2025-02-06 09:28:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-02-06 09:28:53,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-02-06 09:28:53,494 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1660 transitions. [2025-02-06 09:28:53,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2025-02-06 09:28:53,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:53,506 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2025-02-06 09:28:53,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-02-06 09:28:53,510 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-02-06 09:28:53,510 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2025-02-06 09:28:53,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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:28:53,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:53,511 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:53,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:28:53,511 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:53,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:53,512 INFO L85 PathProgramCache]: Analyzing trace with hash -926110930, now seen corresponding path program 1 times [2025-02-06 09:28:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:53,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746974189] [2025-02-06 09:28:53,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:53,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:53,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 09:28:53,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 09:28:53,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:53,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:54,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746974189] [2025-02-06 09:28:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746974189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:54,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605233665] [2025-02-06 09:28:54,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:54,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:54,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:54,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:54,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:28:54,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:28:54,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:54,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:28:54,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:56,118 INFO L124 PetriNetUnfolderBase]: 363/7609 cut-off events. [2025-02-06 09:28:56,118 INFO L125 PetriNetUnfolderBase]: For 675/765 co-relation queries the response was YES. [2025-02-06 09:28:56,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 7609 events. 363/7609 cut-off events. For 675/765 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 75276 event pairs, 64 based on Foata normal form. 8/7100 useless extension candidates. Maximal degree in co-relation 9317. Up to 224 conditions per place. [2025-02-06 09:28:56,247 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-02-06 09:28:56,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2025-02-06 09:28:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-02-06 09:28:56,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-02-06 09:28:56,249 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3257 transitions. [2025-02-06 09:28:56,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2025-02-06 09:28:56,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:56,260 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2025-02-06 09:28:56,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2025-02-06 09:28:56,261 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, 0 predicate places. [2025-02-06 09:28:56,261 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2025-02-06 09:28:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 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:28:56,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:56,262 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:28:56,262 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -742827775, now seen corresponding path program 1 times [2025-02-06 09:28:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43493470] [2025-02-06 09:28:56,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:56,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-06 09:28:56,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-06 09:28:56,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:56,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43493470] [2025-02-06 09:28:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43493470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:56,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:56,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523127224] [2025-02-06 09:28:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:56,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:57,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:28:57,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:28:57,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:57,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:28:57,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:58,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [620#true, 3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, Black: 608#true, 511#L68-17true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), 599#(= |#race~isNull_3~0| 0), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-02-06 09:28:58,898 INFO L294 olderBase$Statistics]: this new event has 684 ancestors and is cut-off event [2025-02-06 09:28:58,898 INFO L297 olderBase$Statistics]: existing Event has 578 ancestors and is cut-off event [2025-02-06 09:28:58,898 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-02-06 09:28:58,898 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-02-06 09:28:58,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3923#(= |#race~result_13~0| 0), Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), Black: 608#true, 511#L68-17true, 1984#true, Black: 3936#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), Black: 620#true, 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-02-06 09:28:58,905 INFO L294 olderBase$Statistics]: this new event has 686 ancestors and is cut-off event [2025-02-06 09:28:58,905 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-02-06 09:28:58,905 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-02-06 09:28:58,905 INFO L297 olderBase$Statistics]: existing Event has 580 ancestors and is cut-off event [2025-02-06 09:28:58,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [620#true, 3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 511#L68-17true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 614#(= |#race~result_7~0| 0), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-02-06 09:28:58,968 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-06 09:28:58,968 INFO L297 olderBase$Statistics]: existing Event has 631 ancestors and is cut-off event [2025-02-06 09:28:58,970 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-02-06 09:28:58,970 INFO L297 olderBase$Statistics]: existing Event has 684 ancestors and is cut-off event [2025-02-06 09:28:58,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1325] L68-18-->L68-17: Formula: (= (store |v_#race_30| v_~o_4~0.base_6 (store (select |v_#race_30| v_~o_4~0.base_6) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_23| 4) v_~o_4~0.offset_6) 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} OutVars{#race=|v_#race_29|, ~o_4~0.base=v_~o_4~0.base_6, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_23|, ~o_4~0.offset=v_~o_4~0.offset_6} AuxVars[] AssignedVars[#race][382], [3956#(= (select (select |#race| ~o_4~0.base) (+ ~o_4~0.offset (* |thread2Thread1of1ForFork2_~i~1#1| 4))) 0), 3934#(= |#race~o_4~0| 0), 32#L82-20true, Black: 1989#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (not (= (mod |thread2Thread1of1ForFork2_~stop~1#1| 256) 0))), Black: 1986#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 3911#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 3905#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 3)), Black: 3885#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 595#(= |#race~isNull_1~0| 0), 1982#(= |#race~o_2~0| 0), Black: 593#true, Black: 3921#true, Black: 597#true, 429#L105true, Black: 3932#true, Black: 604#true, 623#(not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0)), 511#L68-17true, Black: 608#true, 1984#true, 606#(= |#race~isNull_5~0| 0), Black: 614#(= |#race~result_7~0| 0), Black: 3941#(and (= |thread3Thread1of1ForFork1_~i~2#1| 0) (not (= (mod |thread3Thread1of1ForFork1_~stop~2#1| 256) 0))), Black: 3938#(= |thread3Thread1of1ForFork1_~i~2#1| 0), Black: 1962#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1948#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1956#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 3936#true, 3953#(and (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset 1)) 0) (= (select (select |#race| ~o_2~0.base) (+ 3 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0) (= (select (select |#race| ~o_2~0.base) (+ 2 (* 4 |thread3Thread1of1ForFork1_~i~2#1|) ~o_2~0.offset)) 0)), 610#(= |#race~o_0~0| 0), Black: 620#true, 599#(= |#race~isNull_3~0| 0), Black: 625#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= (mod |thread1Thread1of1ForFork0_~stop~0#1| 256) 0))), Black: 622#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 1975#true, Black: 637#(and (<= 5 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 1980#true]) [2025-02-06 09:28:58,972 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-06 09:28:58,972 INFO L297 olderBase$Statistics]: existing Event has 633 ancestors and is cut-off event [2025-02-06 09:28:58,972 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-02-06 09:28:58,972 INFO L297 olderBase$Statistics]: existing Event has 686 ancestors and is cut-off event [2025-02-06 09:28:58,972 INFO L124 PetriNetUnfolderBase]: 331/7564 cut-off events. [2025-02-06 09:28:58,973 INFO L125 PetriNetUnfolderBase]: For 463/512 co-relation queries the response was YES. [2025-02-06 09:28:59,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9684 conditions, 7564 events. 331/7564 cut-off events. For 463/512 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68216 event pairs, 39 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 9468. Up to 169 conditions per place. [2025-02-06 09:28:59,161 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-02-06 09:28:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2025-02-06 09:28:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-02-06 09:28:59,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-02-06 09:28:59,163 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3257 transitions. [2025-02-06 09:28:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2025-02-06 09:28:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:59,179 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-02-06 09:28:59,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-02-06 09:28:59,183 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -1 predicate places. [2025-02-06 09:28:59,183 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-02-06 09:28:59,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.6666666666666) internal successors, (3244), 6 states have internal predecessors, (3244), 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:28:59,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:59,184 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:28:59,184 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:28:59,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 481812883, now seen corresponding path program 1 times [2025-02-06 09:28:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:59,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829917035] [2025-02-06 09:28:59,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:59,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-06 09:28:59,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-06 09:28:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829917035] [2025-02-06 09:28:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829917035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407878650] [2025-02-06 09:28:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:59,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:59,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:00,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 583 [2025-02-06 09:29:00,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:00,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:00,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 583 [2025-02-06 09:29:00,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:01,714 INFO L124 PetriNetUnfolderBase]: 413/7689 cut-off events. [2025-02-06 09:29:01,714 INFO L125 PetriNetUnfolderBase]: For 651/741 co-relation queries the response was YES. [2025-02-06 09:29:01,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9999 conditions, 7689 events. 413/7689 cut-off events. For 651/741 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 77523 event pairs, 62 based on Foata normal form. 16/7268 useless extension candidates. Maximal degree in co-relation 9420. Up to 276 conditions per place. [2025-02-06 09:29:01,819 INFO L140 encePairwiseOnDemand]: 577/583 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-02-06 09:29:01,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-02-06 09:29:01,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:29:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:29:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3257 transitions. [2025-02-06 09:29:01,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311034877072613 [2025-02-06 09:29:01,821 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3257 transitions. [2025-02-06 09:29:01,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-02-06 09:29:01,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:01,829 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-02-06 09:29:01,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-02-06 09:29:01,830 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -2 predicate places. [2025-02-06 09:29:01,830 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-02-06 09:29:01,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.8333333333334) internal successors, (3245), 6 states have internal predecessors, (3245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:01,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:01,831 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:29:01,831 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:29:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1415914447, now seen corresponding path program 1 times [2025-02-06 09:29:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492774473] [2025-02-06 09:29:01,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:01,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 09:29:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 09:29:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:29:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492774473] [2025-02-06 09:29:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492774473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245756303] [2025-02-06 09:29:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:01,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:01,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 583 [2025-02-06 09:29:01,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:01,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:01,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 583 [2025-02-06 09:29:01,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:03,444 INFO L124 PetriNetUnfolderBase]: 180/7839 cut-off events. [2025-02-06 09:29:03,444 INFO L125 PetriNetUnfolderBase]: For 322/508 co-relation queries the response was YES. [2025-02-06 09:29:03,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9862 conditions, 7839 events. 180/7839 cut-off events. For 322/508 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 71774 event pairs, 69 based on Foata normal form. 6/7496 useless extension candidates. Maximal degree in co-relation 9594. Up to 166 conditions per place. [2025-02-06 09:29:03,554 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-02-06 09:29:03,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-02-06 09:29:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1663 transitions. [2025-02-06 09:29:03,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508290451686678 [2025-02-06 09:29:03,556 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1663 transitions. [2025-02-06 09:29:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-02-06 09:29:03,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:03,565 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-02-06 09:29:03,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-02-06 09:29:03,565 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -6 predicate places. [2025-02-06 09:29:03,565 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-02-06 09:29:03,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:03,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:03,566 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:03,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:29:03,566 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:29:03,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 779141168, now seen corresponding path program 1 times [2025-02-06 09:29:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732220630] [2025-02-06 09:29:03,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:03,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 09:29:03,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 09:29:03,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:03,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-02-06 09:29:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732220630] [2025-02-06 09:29:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732220630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601800123] [2025-02-06 09:29:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:03,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:03,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:29:03,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:03,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:03,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:29:03,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:05,847 INFO L124 PetriNetUnfolderBase]: 468/9815 cut-off events. [2025-02-06 09:29:05,848 INFO L125 PetriNetUnfolderBase]: For 574/648 co-relation queries the response was YES. [2025-02-06 09:29:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 9815 events. 468/9815 cut-off events. For 574/648 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 98913 event pairs, 177 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11848. Up to 516 conditions per place. [2025-02-06 09:29:05,987 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-02-06 09:29:05,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-02-06 09:29:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-02-06 09:29:05,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-02-06 09:29:05,988 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1660 transitions. [2025-02-06 09:29:05,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-02-06 09:29:05,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:05,997 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-02-06 09:29:05,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-02-06 09:29:05,998 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -7 predicate places. [2025-02-06 09:29:05,998 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-02-06 09:29:05,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.0) internal successors, (1650), 3 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:05,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:05,999 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:29:05,999 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:29:06,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 753626530, now seen corresponding path program 1 times [2025-02-06 09:29:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246030873] [2025-02-06 09:29:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 09:29:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 09:29:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:06,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-02-06 09:29:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246030873] [2025-02-06 09:29:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246030873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:06,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513700570] [2025-02-06 09:29:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:06,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:06,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:06,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 583 [2025-02-06 09:29:06,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:06,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:06,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 583 [2025-02-06 09:29:06,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:07,653 INFO L124 PetriNetUnfolderBase]: 493/7668 cut-off events. [2025-02-06 09:29:07,653 INFO L125 PetriNetUnfolderBase]: For 731/777 co-relation queries the response was YES. [2025-02-06 09:29:07,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 7668 events. 493/7668 cut-off events. For 731/777 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 78566 event pairs, 260 based on Foata normal form. 0/7276 useless extension candidates. Maximal degree in co-relation 9560. Up to 746 conditions per place. [2025-02-06 09:29:07,739 INFO L140 encePairwiseOnDemand]: 580/583 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-02-06 09:29:07,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-02-06 09:29:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1660 transitions. [2025-02-06 09:29:07,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491137793024585 [2025-02-06 09:29:07,741 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1660 transitions. [2025-02-06 09:29:07,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-02-06 09:29:07,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:07,747 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-02-06 09:29:07,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=583, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-02-06 09:29:07,748 INFO L279 CegarLoopForPetriNet]: 545 programPoint places, -8 predicate places. [2025-02-06 09:29:07,748 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-02-06 09:29:07,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.3333333333334) internal successors, (1651), 3 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:07,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-02-06 09:29:07,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-02-06 09:29:07,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-02-06 09:29:07,753 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-02-06 09:29:07,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-02-06 09:29:07,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-02-06 09:29:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 09:29:07,756 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:07,760 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:29:07,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:29:07,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:29:07 BasicIcfg [2025-02-06 09:29:07,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:29:07,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:29:07,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:29:07,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:29:07,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:22" (3/4) ... [2025-02-06 09:29:07,770 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:29:07,772 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:29:07,773 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:29:07,773 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:29:07,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-06 09:29:07,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:29:07,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:29:07,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:29:07,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:29:07,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:29:07,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:29:07,843 INFO L158 Benchmark]: Toolchain (without parser) took 45984.35ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 158.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 561.5MB. Max. memory is 16.1GB. [2025-02-06 09:29:07,843 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:29:07,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 145.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:29:07,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.40ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 141.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:29:07,843 INFO L158 Benchmark]: Boogie Preprocessor took 26.44ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 139.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:29:07,844 INFO L158 Benchmark]: IcfgBuilder took 783.08ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 99.3MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 09:29:07,844 INFO L158 Benchmark]: TraceAbstraction took 44819.96ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 98.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-06 09:29:07,844 INFO L158 Benchmark]: Witness Printer took 73.60ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:29:07,845 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.18ms. Allocated memory is still 209.7MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 145.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.40ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 141.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.44ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 139.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 783.08ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 99.3MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44819.96ms. Allocated memory was 201.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 98.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 73.60ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 857 locations, 83 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: 44.6s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3940 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2592 mSDsluCounter, 1263 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1080 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6745 IncrementalHoareTripleChecker+Invalid, 7482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 183 mSDtfsCounter, 6745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=25, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 10237 NumberOfCodeBlocks, 9877 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10724 ConstructedInterpolants, 0 QuantifiedInterpolants, 12786 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6747/6894 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:29:07,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE