./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:29:53,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:29:53,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:29:53,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:29:53,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:29:53,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:29:53,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:29:53,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:29:53,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:29:53,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:29:53,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:29:53,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:29:53,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:29:53,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:29:53,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:29:53,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:29:53,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:29:53,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:53,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:29:53,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:29:53,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:29:53,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:29:53,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:29:53,385 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-02-06 09:29:53,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:29:53,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:29:53,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:29:53,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:29:53,686 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:29:53,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-06 09:29:54,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e59d857/d865928a976d450c9c201fd2e7271a2a/FLAG42cb19ba0 [2025-02-06 09:29:55,239 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:29:55,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-06 09:29:55,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e59d857/d865928a976d450c9c201fd2e7271a2a/FLAG42cb19ba0 [2025-02-06 09:29:55,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e59d857/d865928a976d450c9c201fd2e7271a2a [2025-02-06 09:29:55,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:29:55,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:29:55,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:55,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:29:55,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:29:55,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a9f10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55, skipping insertion in model container [2025-02-06 09:29:55,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:29:55,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:55,773 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:29:55,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:55,835 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:29:55,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55 WrapperNode [2025-02-06 09:29:55,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:55,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:55,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:29:55,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:29:55,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,899 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 321 [2025-02-06 09:29:55,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:55,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:29:55,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:29:55,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:29:55,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:29:55,968 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:29:55,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:29:55,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:29:55,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (1/1) ... [2025-02-06 09:29:55,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:29:56,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:29:56,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:29:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:29:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:29:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:29:56,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:29:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:29:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:29:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:29:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:29:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:29:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:29:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:29:56,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:29:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:29:56,040 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:29:56,146 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:29:56,148 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:29:57,002 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:29:57,003 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:29:57,028 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:29:57,029 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:29:57,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:57 BoogieIcfgContainer [2025-02-06 09:29:57,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:29:57,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:29:57,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:29:57,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:29:57,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:29:55" (1/3) ... [2025-02-06 09:29:57,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b31c4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:57, skipping insertion in model container [2025-02-06 09:29:57,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:55" (2/3) ... [2025-02-06 09:29:57,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b31c4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:57, skipping insertion in model container [2025-02-06 09:29:57,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:57" (3/3) ... [2025-02-06 09:29:57,044 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-02-06 09:29:57,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:29:57,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 505 locations, 1 initial locations, 7 loop locations, and 55 error locations. [2025-02-06 09:29:57,060 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:29:57,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:29:57,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 531 transitions, 1076 flow [2025-02-06 09:29:57,561 INFO L124 PetriNetUnfolderBase]: 27/529 cut-off events. [2025-02-06 09:29:57,563 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:29:57,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 529 events. 27/529 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 887 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 347. Up to 2 conditions per place. [2025-02-06 09:29:57,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 531 transitions, 1076 flow [2025-02-06 09:29:57,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 490 places, 509 transitions, 1030 flow [2025-02-06 09:29:57,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:29:57,639 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;@38b6bb0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:29:57,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-06 09:29:57,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:29:57,649 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 09:29:57,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:29:57,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:57,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:57,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2026690931, now seen corresponding path program 1 times [2025-02-06 09:29:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639604423] [2025-02-06 09:29:57,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:57,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:57,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:29:57,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:29:57,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:57,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639604423] [2025-02-06 09:29:57,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639604423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681003143] [2025-02-06 09:29:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:57,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:57,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:57,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:57,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 531 [2025-02-06 09:29:57,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 509 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:57,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:57,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 531 [2025-02-06 09:29:57,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,146 INFO L124 PetriNetUnfolderBase]: 13/497 cut-off events. [2025-02-06 09:29:58,147 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 09:29:58,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 497 events. 13/497 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 880 event pairs, 2 based on Foata normal form. 18/439 useless extension candidates. Maximal degree in co-relation 344. Up to 20 conditions per place. [2025-02-06 09:29:58,152 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 15 selfloop transitions, 2 changer transitions 11/493 dead transitions. [2025-02-06 09:29:58,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 493 transitions, 1032 flow [2025-02-06 09:29:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1518 transitions. [2025-02-06 09:29:58,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529190207156308 [2025-02-06 09:29:58,176 INFO L175 Difference]: Start difference. First operand has 490 places, 509 transitions, 1030 flow. Second operand 3 states and 1518 transitions. [2025-02-06 09:29:58,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 493 transitions, 1032 flow [2025-02-06 09:29:58,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 493 transitions, 1024 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:29:58,201 INFO L231 Difference]: Finished difference. Result has 487 places, 482 transitions, 972 flow [2025-02-06 09:29:58,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=487, PETRI_TRANSITIONS=482} [2025-02-06 09:29:58,212 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -3 predicate places. [2025-02-06 09:29:58,213 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 482 transitions, 972 flow [2025-02-06 09:29:58,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,215 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] [2025-02-06 09:29:58,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:29:58,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:58,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash 752165360, now seen corresponding path program 1 times [2025-02-06 09:29:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124685877] [2025-02-06 09:29:58,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:58,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:29:58,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:29:58,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:58,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:58,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124685877] [2025-02-06 09:29:58,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124685877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:58,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:58,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:58,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318398562] [2025-02-06 09:29:58,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:58,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:58,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:58,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:58,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 531 [2025-02-06 09:29:58,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 482 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 531 [2025-02-06 09:29:58,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,453 INFO L124 PetriNetUnfolderBase]: 18/533 cut-off events. [2025-02-06 09:29:58,454 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:29:58,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 533 events. 18/533 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1172 event pairs, 4 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 539. Up to 30 conditions per place. [2025-02-06 09:29:58,458 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 20 selfloop transitions, 1 changer transitions 0/474 dead transitions. [2025-02-06 09:29:58,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 474 transitions, 998 flow [2025-02-06 09:29:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-02-06 09:29:58,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315756434400502 [2025-02-06 09:29:58,464 INFO L175 Difference]: Start difference. First operand has 487 places, 482 transitions, 972 flow. Second operand 3 states and 1484 transitions. [2025-02-06 09:29:58,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 474 transitions, 998 flow [2025-02-06 09:29:58,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 474 transitions, 994 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:58,477 INFO L231 Difference]: Finished difference. Result has 468 places, 474 transitions, 954 flow [2025-02-06 09:29:58,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=468, PETRI_TRANSITIONS=474} [2025-02-06 09:29:58,479 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-02-06 09:29:58,480 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 474 transitions, 954 flow [2025-02-06 09:29:58,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:29:58,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1636942434, now seen corresponding path program 1 times [2025-02-06 09:29:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633160472] [2025-02-06 09:29:58,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:58,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:29:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:29:58,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:58,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633160472] [2025-02-06 09:29:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633160472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:58,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:58,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084241513] [2025-02-06 09:29:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:58,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 531 [2025-02-06 09:29:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 474 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 531 [2025-02-06 09:29:58,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,732 INFO L124 PetriNetUnfolderBase]: 12/475 cut-off events. [2025-02-06 09:29:58,732 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:29:58,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 475 events. 12/475 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 779 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 469. Up to 19 conditions per place. [2025-02-06 09:29:58,735 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 16 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2025-02-06 09:29:58,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 473 transitions, 988 flow [2025-02-06 09:29:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2025-02-06 09:29:58,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422473320778405 [2025-02-06 09:29:58,746 INFO L175 Difference]: Start difference. First operand has 468 places, 474 transitions, 954 flow. Second operand 3 states and 1501 transitions. [2025-02-06 09:29:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 473 transitions, 988 flow [2025-02-06 09:29:58,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 473 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:58,757 INFO L231 Difference]: Finished difference. Result has 468 places, 473 transitions, 955 flow [2025-02-06 09:29:58,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=468, PETRI_TRANSITIONS=473} [2025-02-06 09:29:58,759 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-02-06 09:29:58,759 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 473 transitions, 955 flow [2025-02-06 09:29:58,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,762 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] [2025-02-06 09:29:58,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:29:58,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash -438557690, now seen corresponding path program 1 times [2025-02-06 09:29:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584837851] [2025-02-06 09:29:58,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:58,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:29:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:29:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584837851] [2025-02-06 09:29:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584837851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:58,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342131893] [2025-02-06 09:29:58,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:58,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:58,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:58,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 531 [2025-02-06 09:29:58,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 473 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:58,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 531 [2025-02-06 09:29:58,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:58,968 INFO L124 PetriNetUnfolderBase]: 15/519 cut-off events. [2025-02-06 09:29:58,968 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:29:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 519 events. 15/519 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1058 event pairs, 2 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 524. Up to 27 conditions per place. [2025-02-06 09:29:58,972 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 22 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2025-02-06 09:29:58,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 464 transitions, 983 flow [2025-02-06 09:29:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1478 transitions. [2025-02-06 09:29:58,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278091650973007 [2025-02-06 09:29:58,977 INFO L175 Difference]: Start difference. First operand has 468 places, 473 transitions, 955 flow. Second operand 3 states and 1478 transitions. [2025-02-06 09:29:58,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 464 transitions, 983 flow [2025-02-06 09:29:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 464 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:58,985 INFO L231 Difference]: Finished difference. Result has 459 places, 464 transitions, 935 flow [2025-02-06 09:29:58,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=935, PETRI_PLACES=459, PETRI_TRANSITIONS=464} [2025-02-06 09:29:58,989 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-02-06 09:29:58,989 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 464 transitions, 935 flow [2025-02-06 09:29:58,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:58,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:58,990 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] [2025-02-06 09:29:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:29:58,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash -296406292, now seen corresponding path program 1 times [2025-02-06 09:29:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:58,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384022898] [2025-02-06 09:29:58,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:29:59,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:29:59,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384022898] [2025-02-06 09:29:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384022898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:59,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:59,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821640330] [2025-02-06 09:29:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:59,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:59,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:59,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:59,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-02-06 09:29:59,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 464 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:59,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:59,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-02-06 09:29:59,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:59,202 INFO L124 PetriNetUnfolderBase]: 13/499 cut-off events. [2025-02-06 09:29:59,203 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:29:59,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 499 events. 13/499 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 957 event pairs, 1 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 490. Up to 14 conditions per place. [2025-02-06 09:29:59,205 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2025-02-06 09:29:59,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 957 flow [2025-02-06 09:29:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-02-06 09:29:59,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-02-06 09:29:59,209 INFO L175 Difference]: Start difference. First operand has 459 places, 464 transitions, 935 flow. Second operand 3 states and 1513 transitions. [2025-02-06 09:29:59,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 957 flow [2025-02-06 09:29:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 463 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:59,216 INFO L231 Difference]: Finished difference. Result has 459 places, 463 transitions, 936 flow [2025-02-06 09:29:59,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=459, PETRI_TRANSITIONS=463} [2025-02-06 09:29:59,218 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2025-02-06 09:29:59,218 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 463 transitions, 936 flow [2025-02-06 09:29:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:59,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:59,219 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] [2025-02-06 09:29:59,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:29:59,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:59,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 213581893, now seen corresponding path program 1 times [2025-02-06 09:29:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:59,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953399733] [2025-02-06 09:29:59,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 09:29:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 09:29:59,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953399733] [2025-02-06 09:29:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953399733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083958197] [2025-02-06 09:29:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:59,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:59,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:59,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:59,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-02-06 09:29:59,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:59,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:59,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-02-06 09:29:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:59,394 INFO L124 PetriNetUnfolderBase]: 14/496 cut-off events. [2025-02-06 09:29:59,394 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:29:59,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 496 events. 14/496 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 946 event pairs, 2 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 492. Up to 15 conditions per place. [2025-02-06 09:29:59,397 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 10 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2025-02-06 09:29:59,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 460 transitions, 952 flow [2025-02-06 09:29:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2025-02-06 09:29:59,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9504080351537979 [2025-02-06 09:29:59,401 INFO L175 Difference]: Start difference. First operand has 459 places, 463 transitions, 936 flow. Second operand 3 states and 1514 transitions. [2025-02-06 09:29:59,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 460 transitions, 952 flow [2025-02-06 09:29:59,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:59,409 INFO L231 Difference]: Finished difference. Result has 456 places, 460 transitions, 928 flow [2025-02-06 09:29:59,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=460} [2025-02-06 09:29:59,411 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -34 predicate places. [2025-02-06 09:29:59,411 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 460 transitions, 928 flow [2025-02-06 09:29:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:29:59,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:59,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:59,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:29:59,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:29:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1472543848, now seen corresponding path program 1 times [2025-02-06 09:29:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:59,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647549838] [2025-02-06 09:29:59,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:59,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:29:59,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:29:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:00,259 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:30:00,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:00,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647549838] [2025-02-06 09:30:00,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647549838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:00,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:00,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:00,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566027445] [2025-02-06 09:30:00,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:00,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:00,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:00,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:00,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 531 [2025-02-06 09:30:00,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 460 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:00,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:00,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 531 [2025-02-06 09:30:00,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,025 INFO L124 PetriNetUnfolderBase]: 172/1159 cut-off events. [2025-02-06 09:30:01,025 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 09:30:01,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 1159 events. 172/1159 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5705 event pairs, 116 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1490. Up to 332 conditions per place. [2025-02-06 09:30:01,032 INFO L140 encePairwiseOnDemand]: 513/531 looper letters, 64 selfloop transitions, 15 changer transitions 0/457 dead transitions. [2025-02-06 09:30:01,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 457 transitions, 1080 flow [2025-02-06 09:30:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2674 transitions. [2025-02-06 09:30:01,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392969240426867 [2025-02-06 09:30:01,038 INFO L175 Difference]: Start difference. First operand has 456 places, 460 transitions, 928 flow. Second operand 6 states and 2674 transitions. [2025-02-06 09:30:01,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 457 transitions, 1080 flow [2025-02-06 09:30:01,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 457 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:01,046 INFO L231 Difference]: Finished difference. Result has 457 places, 457 transitions, 951 flow [2025-02-06 09:30:01,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=457, PETRI_TRANSITIONS=457} [2025-02-06 09:30:01,048 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -33 predicate places. [2025-02-06 09:30:01,049 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 457 transitions, 951 flow [2025-02-06 09:30:01,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:01,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:30:01,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:01,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1601503436, now seen corresponding path program 1 times [2025-02-06 09:30:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947868033] [2025-02-06 09:30:01,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:30:01,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:30:01,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,126 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:30:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947868033] [2025-02-06 09:30:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947868033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764280067] [2025-02-06 09:30:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:01,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-02-06 09:30:01,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 457 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-02-06 09:30:01,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,204 INFO L124 PetriNetUnfolderBase]: 14/514 cut-off events. [2025-02-06 09:30:01,204 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:30:01,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 514 events. 14/514 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1045 event pairs, 1 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 519. Up to 12 conditions per place. [2025-02-06 09:30:01,207 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-02-06 09:30:01,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 971 flow [2025-02-06 09:30:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-02-06 09:30:01,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-02-06 09:30:01,211 INFO L175 Difference]: Start difference. First operand has 457 places, 457 transitions, 951 flow. Second operand 3 states and 1515 transitions. [2025-02-06 09:30:01,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 971 flow [2025-02-06 09:30:01,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:01,219 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 923 flow [2025-02-06 09:30:01,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-02-06 09:30:01,221 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-02-06 09:30:01,222 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 923 flow [2025-02-06 09:30:01,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,223 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] [2025-02-06 09:30:01,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:30:01,224 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash -524581588, now seen corresponding path program 1 times [2025-02-06 09:30:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458405512] [2025-02-06 09:30:01,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 09:30:01,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 09:30:01,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,278 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:30:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458405512] [2025-02-06 09:30:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458405512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449190438] [2025-02-06 09:30:01,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:01,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 531 [2025-02-06 09:30:01,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 531 [2025-02-06 09:30:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,351 INFO L124 PetriNetUnfolderBase]: 16/516 cut-off events. [2025-02-06 09:30:01,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:30:01,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 516 events. 16/516 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1103 event pairs, 3 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2025-02-06 09:30:01,354 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 9 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2025-02-06 09:30:01,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 455 transitions, 943 flow [2025-02-06 09:30:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-02-06 09:30:01,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9510357815442562 [2025-02-06 09:30:01,358 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 923 flow. Second operand 3 states and 1515 transitions. [2025-02-06 09:30:01,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 455 transitions, 943 flow [2025-02-06 09:30:01,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 455 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:01,365 INFO L231 Difference]: Finished difference. Result has 452 places, 455 transitions, 921 flow [2025-02-06 09:30:01,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=452, PETRI_TRANSITIONS=455} [2025-02-06 09:30:01,366 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -38 predicate places. [2025-02-06 09:30:01,367 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 455 transitions, 921 flow [2025-02-06 09:30:01,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:01,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:30:01,368 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 141265578, now seen corresponding path program 1 times [2025-02-06 09:30:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413252841] [2025-02-06 09:30:01,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:30:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:30:01,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,421 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:30:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413252841] [2025-02-06 09:30:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413252841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894297478] [2025-02-06 09:30:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:01,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-02-06 09:30:01,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 455 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-02-06 09:30:01,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,497 INFO L124 PetriNetUnfolderBase]: 12/456 cut-off events. [2025-02-06 09:30:01,497 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:30:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 456 events. 12/456 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2025-02-06 09:30:01,500 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 10 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-02-06 09:30:01,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 454 transitions, 943 flow [2025-02-06 09:30:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2025-02-06 09:30:01,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497802887633396 [2025-02-06 09:30:01,503 INFO L175 Difference]: Start difference. First operand has 452 places, 455 transitions, 921 flow. Second operand 3 states and 1513 transitions. [2025-02-06 09:30:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 454 transitions, 943 flow [2025-02-06 09:30:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 454 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:01,510 INFO L231 Difference]: Finished difference. Result has 451 places, 454 transitions, 919 flow [2025-02-06 09:30:01,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=451, PETRI_TRANSITIONS=454} [2025-02-06 09:30:01,512 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -39 predicate places. [2025-02-06 09:30:01,512 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 454 transitions, 919 flow [2025-02-06 09:30:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,513 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:30:01,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:30:01,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 985808609, now seen corresponding path program 1 times [2025-02-06 09:30:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699186537] [2025-02-06 09:30:01,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 09:30:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 09:30:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,690 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:30:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699186537] [2025-02-06 09:30:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699186537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130120713] [2025-02-06 09:30:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:30:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:30:01,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:30:01,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-02-06 09:30:01,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 454 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-02-06 09:30:01,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,893 INFO L124 PetriNetUnfolderBase]: 18/788 cut-off events. [2025-02-06 09:30:01,893 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:30:01,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 788 events. 18/788 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2212 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 793. Up to 12 conditions per place. [2025-02-06 09:30:01,898 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 16 selfloop transitions, 7 changer transitions 0/461 dead transitions. [2025-02-06 09:30:01,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 461 transitions, 983 flow [2025-02-06 09:30:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:30:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:30:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2509 transitions. [2025-02-06 09:30:01,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9450094161958569 [2025-02-06 09:30:01,903 INFO L175 Difference]: Start difference. First operand has 451 places, 454 transitions, 919 flow. Second operand 5 states and 2509 transitions. [2025-02-06 09:30:01,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 461 transitions, 983 flow [2025-02-06 09:30:01,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 461 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:01,914 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 946 flow [2025-02-06 09:30:01,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-02-06 09:30:01,915 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-02-06 09:30:01,915 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 946 flow [2025-02-06 09:30:01,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:01,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,917 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:30:01,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:30:01,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 321950551, now seen corresponding path program 1 times [2025-02-06 09:30:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989574457] [2025-02-06 09:30:01,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:30:01,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:30:01,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,987 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:30:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989574457] [2025-02-06 09:30:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989574457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814379286] [2025-02-06 09:30:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 531 [2025-02-06 09:30:02,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 531 [2025-02-06 09:30:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,135 INFO L124 PetriNetUnfolderBase]: 39/1132 cut-off events. [2025-02-06 09:30:02,136 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 09:30:02,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1132 events. 39/1132 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4225 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1169. Up to 31 conditions per place. [2025-02-06 09:30:02,142 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 15 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2025-02-06 09:30:02,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 460 transitions, 994 flow [2025-02-06 09:30:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2025-02-06 09:30:02,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-02-06 09:30:02,147 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 946 flow. Second operand 3 states and 1521 transitions. [2025-02-06 09:30:02,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 460 transitions, 994 flow [2025-02-06 09:30:02,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 460 transitions, 987 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:02,156 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 954 flow [2025-02-06 09:30:02,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2025-02-06 09:30:02,158 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2025-02-06 09:30:02,158 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 954 flow [2025-02-06 09:30:02,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,159 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:30:02,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:30:02,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:02,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash -779999487, now seen corresponding path program 1 times [2025-02-06 09:30:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041417388] [2025-02-06 09:30:02,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 09:30:02,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 09:30:02,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,219 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:30:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041417388] [2025-02-06 09:30:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041417388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39598488] [2025-02-06 09:30:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-02-06 09:30:02,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-02-06 09:30:02,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,404 INFO L124 PetriNetUnfolderBase]: 55/1376 cut-off events. [2025-02-06 09:30:02,405 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2025-02-06 09:30:02,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1376 events. 55/1376 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5959 event pairs, 0 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 1448. Up to 43 conditions per place. [2025-02-06 09:30:02,412 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-02-06 09:30:02,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 459 transitions, 991 flow [2025-02-06 09:30:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-02-06 09:30:02,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-02-06 09:30:02,416 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 954 flow. Second operand 3 states and 1525 transitions. [2025-02-06 09:30:02,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 459 transitions, 991 flow [2025-02-06 09:30:02,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 991 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:02,424 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 964 flow [2025-02-06 09:30:02,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2025-02-06 09:30:02,425 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -36 predicate places. [2025-02-06 09:30:02,425 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 964 flow [2025-02-06 09:30:02,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,426 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] [2025-02-06 09:30:02,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:30:02,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:02,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2039803266, now seen corresponding path program 1 times [2025-02-06 09:30:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071459543] [2025-02-06 09:30:02,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 09:30:02,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 09:30:02,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,489 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:30:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071459543] [2025-02-06 09:30:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071459543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075207959] [2025-02-06 09:30:02,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 531 [2025-02-06 09:30:02,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 531 [2025-02-06 09:30:02,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,779 INFO L124 PetriNetUnfolderBase]: 95/2044 cut-off events. [2025-02-06 09:30:02,780 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:30:02,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 2044 events. 95/2044 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11958 event pairs, 8 based on Foata normal form. 0/1828 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2025-02-06 09:30:02,795 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-02-06 09:30:02,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 459 transitions, 1001 flow [2025-02-06 09:30:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2025-02-06 09:30:02,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573132454488387 [2025-02-06 09:30:02,799 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 964 flow. Second operand 3 states and 1525 transitions. [2025-02-06 09:30:02,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 459 transitions, 1001 flow [2025-02-06 09:30:02,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 459 transitions, 1001 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:02,851 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 974 flow [2025-02-06 09:30:02,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2025-02-06 09:30:02,853 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2025-02-06 09:30:02,853 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 974 flow [2025-02-06 09:30:02,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:02,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,854 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] [2025-02-06 09:30:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:30:02,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 908001637, now seen corresponding path program 1 times [2025-02-06 09:30:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552590076] [2025-02-06 09:30:02,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 09:30:02,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 09:30:02,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:03,074 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:30:03,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:03,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552590076] [2025-02-06 09:30:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552590076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:30:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812221734] [2025-02-06 09:30:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:03,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:30:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:03,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:30:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:30:03,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 531 [2025-02-06 09:30:03,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:03,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 531 [2025-02-06 09:30:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,993 INFO L124 PetriNetUnfolderBase]: 123/2878 cut-off events. [2025-02-06 09:30:03,993 INFO L125 PetriNetUnfolderBase]: For 19/37 co-relation queries the response was YES. [2025-02-06 09:30:03,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 2878 events. 123/2878 cut-off events. For 19/37 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 18167 event pairs, 18 based on Foata normal form. 8/2620 useless extension candidates. Maximal degree in co-relation 3253. Up to 100 conditions per place. [2025-02-06 09:30:04,002 INFO L140 encePairwiseOnDemand]: 510/531 looper letters, 44 selfloop transitions, 28 changer transitions 0/491 dead transitions. [2025-02-06 09:30:04,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 491 transitions, 1193 flow [2025-02-06 09:30:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:30:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:30:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4843 transitions. [2025-02-06 09:30:04,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120527306967985 [2025-02-06 09:30:04,012 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 974 flow. Second operand 10 states and 4843 transitions. [2025-02-06 09:30:04,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 491 transitions, 1193 flow [2025-02-06 09:30:04,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 491 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:04,019 INFO L231 Difference]: Finished difference. Result has 468 places, 472 transitions, 1103 flow [2025-02-06 09:30:04,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=468, PETRI_TRANSITIONS=472} [2025-02-06 09:30:04,020 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2025-02-06 09:30:04,020 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 472 transitions, 1103 flow [2025-02-06 09:30:04,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:04,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:04,022 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] [2025-02-06 09:30:04,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:30:04,022 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:04,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash -24300357, now seen corresponding path program 1 times [2025-02-06 09:30:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:04,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265065644] [2025-02-06 09:30:04,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:04,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 09:30:04,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 09:30:04,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:04,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:04,180 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:30:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265065644] [2025-02-06 09:30:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265065644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790430937] [2025-02-06 09:30:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:04,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:30:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:04,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:30:04,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:30:04,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-02-06 09:30:04,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 472 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:04,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:04,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-02-06 09:30:04,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:04,599 INFO L124 PetriNetUnfolderBase]: 122/2431 cut-off events. [2025-02-06 09:30:04,599 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2025-02-06 09:30:04,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 2431 events. 122/2431 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14400 event pairs, 33 based on Foata normal form. 5/2226 useless extension candidates. Maximal degree in co-relation 2800. Up to 115 conditions per place. [2025-02-06 09:30:04,612 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 17 selfloop transitions, 7 changer transitions 0/480 dead transitions. [2025-02-06 09:30:04,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 480 transitions, 1172 flow [2025-02-06 09:30:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:30:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:30:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2510 transitions. [2025-02-06 09:30:04,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453860640301318 [2025-02-06 09:30:04,617 INFO L175 Difference]: Start difference. First operand has 468 places, 472 transitions, 1103 flow. Second operand 5 states and 2510 transitions. [2025-02-06 09:30:04,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 480 transitions, 1172 flow [2025-02-06 09:30:04,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 480 transitions, 1172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:04,628 INFO L231 Difference]: Finished difference. Result has 474 places, 474 transitions, 1134 flow [2025-02-06 09:30:04,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1134, PETRI_PLACES=474, PETRI_TRANSITIONS=474} [2025-02-06 09:30:04,629 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -16 predicate places. [2025-02-06 09:30:04,629 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 474 transitions, 1134 flow [2025-02-06 09:30:04,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:04,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:04,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:04,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:30:04,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:04,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 240665009, now seen corresponding path program 1 times [2025-02-06 09:30:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959961671] [2025-02-06 09:30:04,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:04,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:04,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:30:04,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:30:04,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:04,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:04,826 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:30:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959961671] [2025-02-06 09:30:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959961671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:04,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718448453] [2025-02-06 09:30:04,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:04,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:30:04,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:04,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:30:04,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:30:04,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 531 [2025-02-06 09:30:04,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 474 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:04,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:04,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 531 [2025-02-06 09:30:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:05,363 INFO L124 PetriNetUnfolderBase]: 104/2564 cut-off events. [2025-02-06 09:30:05,363 INFO L125 PetriNetUnfolderBase]: For 160/163 co-relation queries the response was YES. [2025-02-06 09:30:05,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 2564 events. 104/2564 cut-off events. For 160/163 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14639 event pairs, 18 based on Foata normal form. 5/2355 useless extension candidates. Maximal degree in co-relation 2978. Up to 78 conditions per place. [2025-02-06 09:30:05,380 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 17 selfloop transitions, 12 changer transitions 0/483 dead transitions. [2025-02-06 09:30:05,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 483 transitions, 1218 flow [2025-02-06 09:30:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3014 transitions. [2025-02-06 09:30:05,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460138104205901 [2025-02-06 09:30:05,387 INFO L175 Difference]: Start difference. First operand has 474 places, 474 transitions, 1134 flow. Second operand 6 states and 3014 transitions. [2025-02-06 09:30:05,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 483 transitions, 1218 flow [2025-02-06 09:30:05,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 483 transitions, 1209 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:05,399 INFO L231 Difference]: Finished difference. Result has 481 places, 478 transitions, 1191 flow [2025-02-06 09:30:05,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1191, PETRI_PLACES=481, PETRI_TRANSITIONS=478} [2025-02-06 09:30:05,400 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-02-06 09:30:05,400 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 478 transitions, 1191 flow [2025-02-06 09:30:05,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:05,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:05,401 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] [2025-02-06 09:30:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:30:05,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:05,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 760735023, now seen corresponding path program 1 times [2025-02-06 09:30:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087154483] [2025-02-06 09:30:05,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:05,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 09:30:05,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 09:30:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:05,475 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:30:05,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:05,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087154483] [2025-02-06 09:30:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087154483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061075910] [2025-02-06 09:30:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:05,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:05,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:05,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:05,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-02-06 09:30:05,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 478 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:05,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:05,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-02-06 09:30:05,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:05,875 INFO L124 PetriNetUnfolderBase]: 64/2292 cut-off events. [2025-02-06 09:30:05,876 INFO L125 PetriNetUnfolderBase]: For 119/125 co-relation queries the response was YES. [2025-02-06 09:30:05,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 2292 events. 64/2292 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 11861 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2693. Up to 99 conditions per place. [2025-02-06 09:30:05,893 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/477 dead transitions. [2025-02-06 09:30:05,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 477 transitions, 1215 flow [2025-02-06 09:30:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-02-06 09:30:05,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-02-06 09:30:05,897 INFO L175 Difference]: Start difference. First operand has 481 places, 478 transitions, 1191 flow. Second operand 3 states and 1511 transitions. [2025-02-06 09:30:05,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 477 transitions, 1215 flow [2025-02-06 09:30:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 477 transitions, 1206 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:05,907 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 1184 flow [2025-02-06 09:30:05,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2025-02-06 09:30:05,909 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2025-02-06 09:30:05,909 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 1184 flow [2025-02-06 09:30:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:05,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:05,910 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] [2025-02-06 09:30:05,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:30:05,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:05,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash -567309789, now seen corresponding path program 1 times [2025-02-06 09:30:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:05,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049235511] [2025-02-06 09:30:05,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:05,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-06 09:30:05,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-06 09:30:05,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:05,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:06,523 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:30:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049235511] [2025-02-06 09:30:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049235511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:06,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708984867] [2025-02-06 09:30:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:06,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:06,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:06,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:06,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 531 [2025-02-06 09:30:06,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:06,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:06,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 531 [2025-02-06 09:30:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:07,404 INFO L124 PetriNetUnfolderBase]: 258/3166 cut-off events. [2025-02-06 09:30:07,405 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-02-06 09:30:07,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3166 events. 258/3166 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20355 event pairs, 164 based on Foata normal form. 0/2916 useless extension candidates. Maximal degree in co-relation 4221. Up to 654 conditions per place. [2025-02-06 09:30:07,425 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 60 selfloop transitions, 5 changer transitions 0/476 dead transitions. [2025-02-06 09:30:07,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 476 transitions, 1312 flow [2025-02-06 09:30:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2768 transitions. [2025-02-06 09:30:07,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8688010043942247 [2025-02-06 09:30:07,433 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 1184 flow. Second operand 6 states and 2768 transitions. [2025-02-06 09:30:07,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 476 transitions, 1312 flow [2025-02-06 09:30:07,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 476 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:07,446 INFO L231 Difference]: Finished difference. Result has 483 places, 476 transitions, 1188 flow [2025-02-06 09:30:07,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1188, PETRI_PLACES=483, PETRI_TRANSITIONS=476} [2025-02-06 09:30:07,449 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-02-06 09:30:07,449 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 476 transitions, 1188 flow [2025-02-06 09:30:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:07,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:07,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:07,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:30:07,450 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:07,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1342732147, now seen corresponding path program 1 times [2025-02-06 09:30:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604420134] [2025-02-06 09:30:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 09:30:07,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 09:30:07,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:07,520 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:30:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604420134] [2025-02-06 09:30:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604420134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:07,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263117891] [2025-02-06 09:30:07,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:07,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:07,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:07,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:07,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:07,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 531 [2025-02-06 09:30:07,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 476 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:07,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:07,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 531 [2025-02-06 09:30:07,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:07,927 INFO L124 PetriNetUnfolderBase]: 64/2277 cut-off events. [2025-02-06 09:30:07,928 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-02-06 09:30:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 2277 events. 64/2277 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 11730 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2685. Up to 99 conditions per place. [2025-02-06 09:30:07,939 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 11 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2025-02-06 09:30:07,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 475 transitions, 1212 flow [2025-02-06 09:30:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2025-02-06 09:30:07,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9485247959824231 [2025-02-06 09:30:07,944 INFO L175 Difference]: Start difference. First operand has 483 places, 476 transitions, 1188 flow. Second operand 3 states and 1511 transitions. [2025-02-06 09:30:07,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 475 transitions, 1212 flow [2025-02-06 09:30:07,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 475 transitions, 1202 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:07,959 INFO L231 Difference]: Finished difference. Result has 479 places, 475 transitions, 1180 flow [2025-02-06 09:30:07,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1180, PETRI_PLACES=479, PETRI_TRANSITIONS=475} [2025-02-06 09:30:07,961 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -11 predicate places. [2025-02-06 09:30:07,961 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 475 transitions, 1180 flow [2025-02-06 09:30:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:07,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:07,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:07,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:30:07,962 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:07,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash -33073907, now seen corresponding path program 1 times [2025-02-06 09:30:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816578817] [2025-02-06 09:30:07,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:07,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 09:30:07,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 09:30:07,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:07,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:08,035 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:30:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816578817] [2025-02-06 09:30:08,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816578817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583084087] [2025-02-06 09:30:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:08,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:08,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:08,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-02-06 09:30:08,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 475 transitions, 1180 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:08,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:08,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-02-06 09:30:08,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:08,421 INFO L124 PetriNetUnfolderBase]: 64/2235 cut-off events. [2025-02-06 09:30:08,421 INFO L125 PetriNetUnfolderBase]: For 96/102 co-relation queries the response was YES. [2025-02-06 09:30:08,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2235 events. 64/2235 cut-off events. For 96/102 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11354 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2654. Up to 84 conditions per place. [2025-02-06 09:30:08,433 INFO L140 encePairwiseOnDemand]: 526/531 looper letters, 12 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2025-02-06 09:30:08,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 471 transitions, 1198 flow [2025-02-06 09:30:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2025-02-06 09:30:08,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466415568110483 [2025-02-06 09:30:08,437 INFO L175 Difference]: Start difference. First operand has 479 places, 475 transitions, 1180 flow. Second operand 3 states and 1508 transitions. [2025-02-06 09:30:08,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 471 transitions, 1198 flow [2025-02-06 09:30:08,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:08,447 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 1170 flow [2025-02-06 09:30:08,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2025-02-06 09:30:08,449 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -15 predicate places. [2025-02-06 09:30:08,449 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 1170 flow [2025-02-06 09:30:08,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:08,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:08,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:08,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:30:08,450 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:08,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 943944610, now seen corresponding path program 1 times [2025-02-06 09:30:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137362616] [2025-02-06 09:30:08,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:08,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:30:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:30:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137362616] [2025-02-06 09:30:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137362616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983812277] [2025-02-06 09:30:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:08,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:08,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:08,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:09,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 531 [2025-02-06 09:30:09,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 1170 flow. Second operand has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:09,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:09,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 531 [2025-02-06 09:30:09,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:10,157 INFO L124 PetriNetUnfolderBase]: 242/3490 cut-off events. [2025-02-06 09:30:10,157 INFO L125 PetriNetUnfolderBase]: For 192/193 co-relation queries the response was YES. [2025-02-06 09:30:10,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 3490 events. 242/3490 cut-off events. For 192/193 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 23017 event pairs, 82 based on Foata normal form. 0/3257 useless extension candidates. Maximal degree in co-relation 4418. Up to 402 conditions per place. [2025-02-06 09:30:10,178 INFO L140 encePairwiseOnDemand]: 520/531 looper letters, 44 selfloop transitions, 22 changer transitions 0/496 dead transitions. [2025-02-06 09:30:10,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 496 transitions, 1356 flow [2025-02-06 09:30:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2915 transitions. [2025-02-06 09:30:10,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9149403640929065 [2025-02-06 09:30:10,184 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 1170 flow. Second operand 6 states and 2915 transitions. [2025-02-06 09:30:10,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 496 transitions, 1356 flow [2025-02-06 09:30:10,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 496 transitions, 1355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:10,195 INFO L231 Difference]: Finished difference. Result has 484 places, 492 transitions, 1319 flow [2025-02-06 09:30:10,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1319, PETRI_PLACES=484, PETRI_TRANSITIONS=492} [2025-02-06 09:30:10,197 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -6 predicate places. [2025-02-06 09:30:10,197 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 492 transitions, 1319 flow [2025-02-06 09:30:10,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:10,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:10,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:10,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:30:10,201 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:10,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1245408483, now seen corresponding path program 1 times [2025-02-06 09:30:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318183342] [2025-02-06 09:30:10,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:10,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:30:10,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:30:10,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:10,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:10,254 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:30:10,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:10,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318183342] [2025-02-06 09:30:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318183342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:10,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935555669] [2025-02-06 09:30:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:10,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:10,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:10,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 531 [2025-02-06 09:30:10,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 492 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:10,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:10,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 531 [2025-02-06 09:30:10,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:10,696 INFO L124 PetriNetUnfolderBase]: 128/2803 cut-off events. [2025-02-06 09:30:10,696 INFO L125 PetriNetUnfolderBase]: For 128/137 co-relation queries the response was YES. [2025-02-06 09:30:10,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 2803 events. 128/2803 cut-off events. For 128/137 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 16263 event pairs, 4 based on Foata normal form. 0/2688 useless extension candidates. Maximal degree in co-relation 3457. Up to 105 conditions per place. [2025-02-06 09:30:10,711 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 12 selfloop transitions, 3 changer transitions 0/490 dead transitions. [2025-02-06 09:30:10,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 490 transitions, 1345 flow [2025-02-06 09:30:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1510 transitions. [2025-02-06 09:30:10,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478970495919649 [2025-02-06 09:30:10,716 INFO L175 Difference]: Start difference. First operand has 484 places, 492 transitions, 1319 flow. Second operand 3 states and 1510 transitions. [2025-02-06 09:30:10,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 490 transitions, 1345 flow [2025-02-06 09:30:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 490 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:10,726 INFO L231 Difference]: Finished difference. Result has 483 places, 490 transitions, 1328 flow [2025-02-06 09:30:10,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=483, PETRI_TRANSITIONS=490} [2025-02-06 09:30:10,727 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2025-02-06 09:30:10,727 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 490 transitions, 1328 flow [2025-02-06 09:30:10,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:10,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:10,728 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:30:10,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:30:10,728 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:10,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash -409403743, now seen corresponding path program 1 times [2025-02-06 09:30:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793377647] [2025-02-06 09:30:10,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:10,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:30:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:30:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793377647] [2025-02-06 09:30:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793377647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:11,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075243546] [2025-02-06 09:30:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:11,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:11,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:11,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:11,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 531 [2025-02-06 09:30:11,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 490 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:11,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:11,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 531 [2025-02-06 09:30:11,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:12,533 INFO L124 PetriNetUnfolderBase]: 575/4337 cut-off events. [2025-02-06 09:30:12,533 INFO L125 PetriNetUnfolderBase]: For 590/615 co-relation queries the response was YES. [2025-02-06 09:30:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 4337 events. 575/4337 cut-off events. For 590/615 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 30640 event pairs, 232 based on Foata normal form. 4/4107 useless extension candidates. Maximal degree in co-relation 6684. Up to 1126 conditions per place. [2025-02-06 09:30:12,564 INFO L140 encePairwiseOnDemand]: 512/531 looper letters, 85 selfloop transitions, 55 changer transitions 0/547 dead transitions. [2025-02-06 09:30:12,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 547 transitions, 1758 flow [2025-02-06 09:30:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2837 transitions. [2025-02-06 09:30:12,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8904582548650345 [2025-02-06 09:30:12,571 INFO L175 Difference]: Start difference. First operand has 483 places, 490 transitions, 1328 flow. Second operand 6 states and 2837 transitions. [2025-02-06 09:30:12,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 547 transitions, 1758 flow [2025-02-06 09:30:12,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 547 transitions, 1758 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:12,586 INFO L231 Difference]: Finished difference. Result has 493 places, 543 transitions, 1722 flow [2025-02-06 09:30:12,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1722, PETRI_PLACES=493, PETRI_TRANSITIONS=543} [2025-02-06 09:30:12,588 INFO L279 CegarLoopForPetriNet]: 490 programPoint places, 3 predicate places. [2025-02-06 09:30:12,588 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 543 transitions, 1722 flow [2025-02-06 09:30:12,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:12,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:12,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:12,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:30:12,589 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-02-06 09:30:12,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1704564917, now seen corresponding path program 1 times [2025-02-06 09:30:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080984722] [2025-02-06 09:30:12,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:12,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-06 09:30:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 09:30:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat