./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:26,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:26,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:26,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:26,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:27,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:27,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:27,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:27,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:27,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:27,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:27,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:27,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:27,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:27,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:27,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:27,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:27,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:27,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:27,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:27,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:27,009 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-13 22:26:27,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:27,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:27,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:27,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:27,240 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:27,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-13 22:26:28,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5542a963d/fddddf55a6f9469096550226aa66f129/FLAG290bc2ea4 [2025-03-13 22:26:28,594 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:28,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-13 22:26:28,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5542a963d/fddddf55a6f9469096550226aa66f129/FLAG290bc2ea4 [2025-03-13 22:26:28,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5542a963d/fddddf55a6f9469096550226aa66f129 [2025-03-13 22:26:28,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:28,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:28,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:28,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:28,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:28,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:28" (1/1) ... [2025-03-13 22:26:28,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4157fbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:28, skipping insertion in model container [2025-03-13 22:26:28,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:28" (1/1) ... [2025-03-13 22:26:28,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:29,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:29,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:29,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:29,166 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:29,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29 WrapperNode [2025-03-13 22:26:29,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:29,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:29,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:29,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:29,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,206 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 338 [2025-03-13 22:26:29,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:29,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:29,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:29,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:29,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:29,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:29,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:29,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:29,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (1/1) ... [2025-03-13 22:26:29,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:29,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:26:29,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:26:29,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:26:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:29,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:29,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:29,304 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:29,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:29,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:29,961 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:29,962 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:29,962 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:30,169 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:30,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:30 BoogieIcfgContainer [2025-03-13 22:26:30,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:30,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:30,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:30,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:30,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:28" (1/3) ... [2025-03-13 22:26:30,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bfe30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:30, skipping insertion in model container [2025-03-13 22:26:30,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:29" (2/3) ... [2025-03-13 22:26:30,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bfe30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:30, skipping insertion in model container [2025-03-13 22:26:30,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:30" (3/3) ... [2025-03-13 22:26:30,180 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-13 22:26:30,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:30,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2025-03-13 22:26:30,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:30,276 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:26:30,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 507 transitions, 1035 flow [2025-03-13 22:26:30,438 INFO L124 PetriNetUnfolderBase]: 24/504 cut-off events. [2025-03-13 22:26:30,440 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:26:30,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 504 events. 24/504 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 656 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 425. Up to 2 conditions per place. [2025-03-13 22:26:30,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 507 transitions, 1035 flow [2025-03-13 22:26:30,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 460 transitions, 938 flow [2025-03-13 22:26:30,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:30,480 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;@3ccec9d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:30,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-03-13 22:26:30,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:30,486 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-13 22:26:30,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:30,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,487 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] [2025-03-13 22:26:30,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:30,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1959533605, now seen corresponding path program 1 times [2025-03-13 22:26:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990608907] [2025-03-13 22:26:30,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:30,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:26:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:26:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990608907] [2025-03-13 22:26:30,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990608907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013194794] [2025-03-13 22:26:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 507 [2025-03-13 22:26:30,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 460 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:30,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 507 [2025-03-13 22:26:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,996 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2025-03-13 22:26:30,997 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-13 22:26:31,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6579 event pairs, 51 based on Foata normal form. 9/1015 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2025-03-13 22:26:31,009 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2025-03-13 22:26:31,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2025-03-13 22:26:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2025-03-13 22:26:31,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270216962524654 [2025-03-13 22:26:31,024 INFO L175 Difference]: Start difference. First operand has 449 places, 460 transitions, 938 flow. Second operand 3 states and 1410 transitions. [2025-03-13 22:26:31,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2025-03-13 22:26:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:26:31,039 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2025-03-13 22:26:31,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-13 22:26:31,046 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2025-03-13 22:26:31,046 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2025-03-13 22:26:31,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,048 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] [2025-03-13 22:26:31,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:31,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:31,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1175557925, now seen corresponding path program 1 times [2025-03-13 22:26:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454485806] [2025-03-13 22:26:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:26:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:26:31,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454485806] [2025-03-13 22:26:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454485806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:31,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149531263] [2025-03-13 22:26:31,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:31,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 507 [2025-03-13 22:26:31,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:31,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 507 [2025-03-13 22:26:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:31,374 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2025-03-13 22:26:31,374 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 22:26:31,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6566 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2025-03-13 22:26:31,382 INFO L140 encePairwiseOnDemand]: 499/507 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2025-03-13 22:26:31,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2025-03-13 22:26:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2025-03-13 22:26:31,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000657462195923 [2025-03-13 22:26:31,385 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2025-03-13 22:26:31,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2025-03-13 22:26:31,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:31,390 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2025-03-13 22:26:31,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2025-03-13 22:26:31,392 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2025-03-13 22:26:31,392 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2025-03-13 22:26:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:31,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,393 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] [2025-03-13 22:26:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:31,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 955381436, now seen corresponding path program 1 times [2025-03-13 22:26:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329185820] [2025-03-13 22:26:31,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:26:31,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:26:31,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329185820] [2025-03-13 22:26:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329185820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562468144] [2025-03-13 22:26:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:31,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:32,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 507 [2025-03-13 22:26:32,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:32,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 507 [2025-03-13 22:26:32,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:32,583 INFO L124 PetriNetUnfolderBase]: 287/1440 cut-off events. [2025-03-13 22:26:32,584 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 22:26:32,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1973 conditions, 1440 events. 287/1440 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8470 event pairs, 188 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1941. Up to 463 conditions per place. [2025-03-13 22:26:32,593 INFO L140 encePairwiseOnDemand]: 489/507 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2025-03-13 22:26:32,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2025-03-13 22:26:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2025-03-13 22:26:32,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044049967126891 [2025-03-13 22:26:32,600 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2025-03-13 22:26:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2025-03-13 22:26:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:32,606 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2025-03-13 22:26:32,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2025-03-13 22:26:32,608 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2025-03-13 22:26:32,608 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2025-03-13 22:26:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:32,610 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] [2025-03-13 22:26:32,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:32,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:32,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1077336249, now seen corresponding path program 1 times [2025-03-13 22:26:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:32,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317261237] [2025-03-13 22:26:32,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:32,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:26:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:26:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317261237] [2025-03-13 22:26:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317261237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159793731] [2025-03-13 22:26:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:32,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:32,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:32,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-13 22:26:32,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:32,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-13 22:26:32,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:32,764 INFO L124 PetriNetUnfolderBase]: 64/654 cut-off events. [2025-03-13 22:26:32,764 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:32,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 654 events. 64/654 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2155 event pairs, 34 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 743. Up to 92 conditions per place. [2025-03-13 22:26:32,769 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-13 22:26:32,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2025-03-13 22:26:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-13 22:26:32,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-13 22:26:32,773 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2025-03-13 22:26:32,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2025-03-13 22:26:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:32,778 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2025-03-13 22:26:32,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-13 22:26:32,780 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2025-03-13 22:26:32,780 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2025-03-13 22:26:32,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:32,781 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] [2025-03-13 22:26:32,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:32,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -116020957, now seen corresponding path program 1 times [2025-03-13 22:26:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108907937] [2025-03-13 22:26:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:32,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-13 22:26:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-13 22:26:32,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:32,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108907937] [2025-03-13 22:26:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108907937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719545390] [2025-03-13 22:26:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:32,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:32,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:32,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-13 22:26:32,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:32,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-13 22:26:32,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:32,958 INFO L124 PetriNetUnfolderBase]: 64/653 cut-off events. [2025-03-13 22:26:32,958 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:32,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 653 events. 64/653 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2008 event pairs, 34 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 729. Up to 92 conditions per place. [2025-03-13 22:26:32,961 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-13 22:26:32,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2025-03-13 22:26:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-13 22:26:32,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-13 22:26:32,964 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2025-03-13 22:26:32,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2025-03-13 22:26:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:32,972 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2025-03-13 22:26:32,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-13 22:26:32,973 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2025-03-13 22:26:32,973 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2025-03-13 22:26:32,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:32,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:32,976 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] [2025-03-13 22:26:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:32,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:32,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790353, now seen corresponding path program 1 times [2025-03-13 22:26:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:32,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646916469] [2025-03-13 22:26:32,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:32,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:32,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-13 22:26:32,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-13 22:26:32,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:32,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646916469] [2025-03-13 22:26:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646916469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807258993] [2025-03-13 22:26:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-13 22:26:33,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-13 22:26:33,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,128 INFO L124 PetriNetUnfolderBase]: 30/482 cut-off events. [2025-03-13 22:26:33,128 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:33,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 482 events. 30/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 504. Up to 44 conditions per place. [2025-03-13 22:26:33,131 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-13 22:26:33,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2025-03-13 22:26:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-13 22:26:33,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-13 22:26:33,135 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2025-03-13 22:26:33,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2025-03-13 22:26:33,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,140 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2025-03-13 22:26:33,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2025-03-13 22:26:33,141 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-13 22:26:33,141 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2025-03-13 22:26:33,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:33,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -127312013, now seen corresponding path program 1 times [2025-03-13 22:26:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504625365] [2025-03-13 22:26:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-13 22:26:33,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-13 22:26:33,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504625365] [2025-03-13 22:26:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504625365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508686259] [2025-03-13 22:26:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-13 22:26:33,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-13 22:26:33,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,271 INFO L124 PetriNetUnfolderBase]: 30/481 cut-off events. [2025-03-13 22:26:33,272 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:33,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 481 events. 30/481 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2025-03-13 22:26:33,275 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-13 22:26:33,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2025-03-13 22:26:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-13 22:26:33,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-13 22:26:33,278 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2025-03-13 22:26:33,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2025-03-13 22:26:33,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,284 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2025-03-13 22:26:33,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2025-03-13 22:26:33,285 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-13 22:26:33,285 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2025-03-13 22:26:33,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:33,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash -295291411, now seen corresponding path program 1 times [2025-03-13 22:26:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010009724] [2025-03-13 22:26:33,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-13 22:26:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-13 22:26:33,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010009724] [2025-03-13 22:26:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010009724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431274702] [2025-03-13 22:26:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-13 22:26:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-13 22:26:33,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,494 INFO L124 PetriNetUnfolderBase]: 122/1251 cut-off events. [2025-03-13 22:26:33,494 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 22:26:33,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1251 events. 122/1251 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6409 event pairs, 56 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1398. Up to 156 conditions per place. [2025-03-13 22:26:33,502 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2025-03-13 22:26:33,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2025-03-13 22:26:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-13 22:26:33,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-13 22:26:33,505 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2025-03-13 22:26:33,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2025-03-13 22:26:33,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,510 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2025-03-13 22:26:33,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2025-03-13 22:26:33,511 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-13 22:26:33,511 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2025-03-13 22:26:33,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,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] [2025-03-13 22:26:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:33,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -197044063, now seen corresponding path program 1 times [2025-03-13 22:26:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202084474] [2025-03-13 22:26:33,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-13 22:26:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-13 22:26:33,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202084474] [2025-03-13 22:26:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202084474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251933598] [2025-03-13 22:26:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:33,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:34,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-13 22:26:34,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-13 22:26:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,441 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2025-03-13 22:26:34,442 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 22:26:34,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1135 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2025-03-13 22:26:34,444 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2025-03-13 22:26:34,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2025-03-13 22:26:34,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-13 22:26:34,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-13 22:26:34,450 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2025-03-13 22:26:34,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2025-03-13 22:26:34,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:34,460 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2025-03-13 22:26:34,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-03-13 22:26:34,462 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2025-03-13 22:26:34,462 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2025-03-13 22:26:34,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,464 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] [2025-03-13 22:26:34,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:34,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -823479675, now seen corresponding path program 1 times [2025-03-13 22:26:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633949889] [2025-03-13 22:26:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-13 22:26:34,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-13 22:26:34,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633949889] [2025-03-13 22:26:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633949889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067952276] [2025-03-13 22:26:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-13 22:26:34,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-13 22:26:34,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,615 INFO L124 PetriNetUnfolderBase]: 63/679 cut-off events. [2025-03-13 22:26:34,615 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:26:34,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 679 events. 63/679 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2307 event pairs, 36 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 809. Up to 98 conditions per place. [2025-03-13 22:26:34,618 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-13 22:26:34,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2025-03-13 22:26:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-13 22:26:34,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-13 22:26:34,621 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2025-03-13 22:26:34,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2025-03-13 22:26:34,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:26:34,625 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2025-03-13 22:26:34,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2025-03-13 22:26:34,627 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-13 22:26:34,628 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2025-03-13 22:26:34,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:34,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:34,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:34,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash 528181431, now seen corresponding path program 1 times [2025-03-13 22:26:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188928653] [2025-03-13 22:26:34,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-13 22:26:34,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-13 22:26:34,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188928653] [2025-03-13 22:26:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188928653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678488659] [2025-03-13 22:26:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-13 22:26:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-13 22:26:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,822 INFO L124 PetriNetUnfolderBase]: 121/1225 cut-off events. [2025-03-13 22:26:34,822 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-13 22:26:34,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1225 events. 121/1225 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6224 event pairs, 58 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1422. Up to 158 conditions per place. [2025-03-13 22:26:34,829 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2025-03-13 22:26:34,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2025-03-13 22:26:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-13 22:26:34,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-13 22:26:34,832 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2025-03-13 22:26:34,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2025-03-13 22:26:34,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:34,836 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2025-03-13 22:26:34,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2025-03-13 22:26:34,838 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2025-03-13 22:26:34,838 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2025-03-13 22:26:34,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:34,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:34,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:34,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2095894241, now seen corresponding path program 1 times [2025-03-13 22:26:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240788929] [2025-03-13 22:26:34,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-13 22:26:34,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-13 22:26:34,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:35,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240788929] [2025-03-13 22:26:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240788929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:35,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:35,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132469816] [2025-03-13 22:26:35,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:35,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:35,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:35,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:35,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:35,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-13 22:26:35,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:35,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:35,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-13 22:26:35,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:35,708 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2025-03-13 22:26:35,709 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:26:35,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1113 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-03-13 22:26:35,734 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-03-13 22:26:35,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2025-03-13 22:26:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-13 22:26:35,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-13 22:26:35,742 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2025-03-13 22:26:35,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2025-03-13 22:26:35,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:35,747 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2025-03-13 22:26:35,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2025-03-13 22:26:35,748 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2025-03-13 22:26:35,748 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2025-03-13 22:26:35,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:35,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:35,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:35,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:35,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:35,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1953189874, now seen corresponding path program 1 times [2025-03-13 22:26:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:35,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134330099] [2025-03-13 22:26:35,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-13 22:26:35,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-13 22:26:35,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:35,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134330099] [2025-03-13 22:26:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134330099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926243937] [2025-03-13 22:26:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:35,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:35,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:35,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:35,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-13 22:26:35,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:35,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:35,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-13 22:26:35,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:35,915 INFO L124 PetriNetUnfolderBase]: 63/672 cut-off events. [2025-03-13 22:26:35,915 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-13 22:26:35,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 672 events. 63/672 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2204 event pairs, 36 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 804. Up to 98 conditions per place. [2025-03-13 22:26:35,919 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-13 22:26:35,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2025-03-13 22:26:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-13 22:26:35,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-13 22:26:35,922 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2025-03-13 22:26:35,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2025-03-13 22:26:35,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:35,927 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2025-03-13 22:26:35,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2025-03-13 22:26:35,929 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2025-03-13 22:26:35,929 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2025-03-13 22:26:35,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:35,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:35,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:35,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:35,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:35,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1168781111, now seen corresponding path program 1 times [2025-03-13 22:26:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:35,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758663660] [2025-03-13 22:26:35,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:35,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-13 22:26:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-13 22:26:35,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:35,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758663660] [2025-03-13 22:26:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758663660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:35,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119022914] [2025-03-13 22:26:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:35,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:35,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:35,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:35,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:35,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-13 22:26:36,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-13 22:26:36,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,072 INFO L124 PetriNetUnfolderBase]: 29/485 cut-off events. [2025-03-13 22:26:36,072 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-13 22:26:36,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 29/485 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1012 event pairs, 14 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 530. Up to 50 conditions per place. [2025-03-13 22:26:36,075 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-13 22:26:36,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2025-03-13 22:26:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-13 22:26:36,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178172255095332 [2025-03-13 22:26:36,078 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2025-03-13 22:26:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2025-03-13 22:26:36,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:36,082 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2025-03-13 22:26:36,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-03-13 22:26:36,084 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2025-03-13 22:26:36,084 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2025-03-13 22:26:36,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,085 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] [2025-03-13 22:26:36,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:36,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:36,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1491604318, now seen corresponding path program 1 times [2025-03-13 22:26:36,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224820091] [2025-03-13 22:26:36,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:26:36,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:26:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:36,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224820091] [2025-03-13 22:26:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224820091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532597006] [2025-03-13 22:26:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:36,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:36,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:36,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-13 22:26:36,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-13 22:26:36,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,342 INFO L124 PetriNetUnfolderBase]: 109/1236 cut-off events. [2025-03-13 22:26:36,342 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-13 22:26:36,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1236 events. 109/1236 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6973 event pairs, 25 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1430. Up to 91 conditions per place. [2025-03-13 22:26:36,350 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2025-03-13 22:26:36,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2025-03-13 22:26:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-03-13 22:26:36,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9250493096646942 [2025-03-13 22:26:36,353 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2025-03-13 22:26:36,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2025-03-13 22:26:36,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:36,357 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2025-03-13 22:26:36,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2025-03-13 22:26:36,358 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2025-03-13 22:26:36,359 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2025-03-13 22:26:36,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:36,360 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:36,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash -374972734, now seen corresponding path program 1 times [2025-03-13 22:26:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617374604] [2025-03-13 22:26:36,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-13 22:26:36,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-13 22:26:36,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:36,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617374604] [2025-03-13 22:26:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617374604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:26:36,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545141797] [2025-03-13 22:26:36,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:26:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:26:36,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:26:36,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 507 [2025-03-13 22:26:36,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:36,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 507 [2025-03-13 22:26:36,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:37,527 INFO L124 PetriNetUnfolderBase]: 234/2125 cut-off events. [2025-03-13 22:26:37,527 INFO L125 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES. [2025-03-13 22:26:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2125 events. 234/2125 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11757 event pairs, 122 based on Foata normal form. 9/1969 useless extension candidates. Maximal degree in co-relation 2670. Up to 245 conditions per place. [2025-03-13 22:26:37,539 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2025-03-13 22:26:37,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2025-03-13 22:26:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:26:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:26:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2025-03-13 22:26:37,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761341222879684 [2025-03-13 22:26:37,546 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2025-03-13 22:26:37,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2025-03-13 22:26:37,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:37,553 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2025-03-13 22:26:37,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2025-03-13 22:26:37,554 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-13 22:26:37,554 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2025-03-13 22:26:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:37,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:37,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:37,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:37,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:37,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 602601977, now seen corresponding path program 1 times [2025-03-13 22:26:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933134263] [2025-03-13 22:26:37,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:37,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:37,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-13 22:26:37,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-13 22:26:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:37,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:37,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933134263] [2025-03-13 22:26:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933134263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733439817] [2025-03-13 22:26:37,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:37,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:37,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:37,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:37,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 507 [2025-03-13 22:26:37,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:37,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:37,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 507 [2025-03-13 22:26:37,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:37,742 INFO L124 PetriNetUnfolderBase]: 84/1026 cut-off events. [2025-03-13 22:26:37,742 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-03-13 22:26:37,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1026 events. 84/1026 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3144 event pairs, 39 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1272. Up to 125 conditions per place. [2025-03-13 22:26:37,751 INFO L140 encePairwiseOnDemand]: 505/507 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-13 22:26:37,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2025-03-13 22:26:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2025-03-13 22:26:37,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9237343852728468 [2025-03-13 22:26:37,754 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2025-03-13 22:26:37,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2025-03-13 22:26:37,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:37,760 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2025-03-13 22:26:37,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2025-03-13 22:26:37,761 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-13 22:26:37,761 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2025-03-13 22:26:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:37,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:37,762 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1225962741, now seen corresponding path program 1 times [2025-03-13 22:26:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784522155] [2025-03-13 22:26:37,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:37,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-13 22:26:37,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-13 22:26:37,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:37,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784522155] [2025-03-13 22:26:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784522155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233943340] [2025-03-13 22:26:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:37,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:37,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:37,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:37,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:37,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-13 22:26:37,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:37,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:37,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-13 22:26:37,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:38,149 INFO L124 PetriNetUnfolderBase]: 235/2240 cut-off events. [2025-03-13 22:26:38,149 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-13 22:26:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2240 events. 235/2240 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13803 event pairs, 61 based on Foata normal form. 4/2098 useless extension candidates. Maximal degree in co-relation 2853. Up to 176 conditions per place. [2025-03-13 22:26:38,159 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2025-03-13 22:26:38,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2025-03-13 22:26:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2025-03-13 22:26:38,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243918474687706 [2025-03-13 22:26:38,162 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2025-03-13 22:26:38,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2025-03-13 22:26:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:38,168 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2025-03-13 22:26:38,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2025-03-13 22:26:38,169 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-13 22:26:38,169 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2025-03-13 22:26:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:38,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:38,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:38,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:38,170 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1336931917, now seen corresponding path program 1 times [2025-03-13 22:26:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123728947] [2025-03-13 22:26:38,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:38,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-13 22:26:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-13 22:26:38,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:38,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123728947] [2025-03-13 22:26:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123728947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:26:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12724036] [2025-03-13 22:26:38,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:38,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:26:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:38,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:26:38,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:26:38,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-13 22:26:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-13 22:26:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:38,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:26:38,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:26:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:38,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:26:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:26:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12724036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:26:39,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:26:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-13 22:26:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872264445] [2025-03-13 22:26:39,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:26:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 22:26:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:39,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 22:26:39,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-13 22:26:40,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 507 [2025-03-13 22:26:40,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:40,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:40,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 507 [2025-03-13 22:26:40,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:41,181 INFO L124 PetriNetUnfolderBase]: 447/3267 cut-off events. [2025-03-13 22:26:41,182 INFO L125 PetriNetUnfolderBase]: For 399/409 co-relation queries the response was YES. [2025-03-13 22:26:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 3267 events. 447/3267 cut-off events. For 399/409 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21613 event pairs, 201 based on Foata normal form. 9/3024 useless extension candidates. Maximal degree in co-relation 4522. Up to 437 conditions per place. [2025-03-13 22:26:41,192 INFO L140 encePairwiseOnDemand]: 468/507 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2025-03-13 22:26:41,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2025-03-13 22:26:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 22:26:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 22:26:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2025-03-13 22:26:41,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530052943008408 [2025-03-13 22:26:41,200 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2025-03-13 22:26:41,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2025-03-13 22:26:41,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-13 22:26:41,207 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2025-03-13 22:26:41,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2025-03-13 22:26:41,208 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2025-03-13 22:26:41,208 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2025-03-13 22:26:41,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:41,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:41,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:41,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 22:26:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:26:41,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:41,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1696638750, now seen corresponding path program 2 times [2025-03-13 22:26:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:41,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751069813] [2025-03-13 22:26:41,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:26:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:41,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-13 22:26:41,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 233 of 325 statements. [2025-03-13 22:26:41,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:26:41,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-13 22:26:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751069813] [2025-03-13 22:26:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751069813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576491717] [2025-03-13 22:26:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:41,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:41,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:41,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:42,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-13 22:26:42,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:42,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:42,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-13 22:26:42,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:43,011 INFO L124 PetriNetUnfolderBase]: 641/3387 cut-off events. [2025-03-13 22:26:43,011 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-13 22:26:43,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 3387 events. 641/3387 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 26132 event pairs, 130 based on Foata normal form. 0/3134 useless extension candidates. Maximal degree in co-relation 5040. Up to 607 conditions per place. [2025-03-13 22:26:43,039 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-03-13 22:26:43,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2025-03-13 22:26:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-13 22:26:43,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-13 22:26:43,046 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2025-03-13 22:26:43,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2025-03-13 22:26:43,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-13 22:26:43,054 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2025-03-13 22:26:43,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2025-03-13 22:26:43,055 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2025-03-13 22:26:43,055 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2025-03-13 22:26:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:43,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:43,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:43,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:26:43,057 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:43,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash -51229836, now seen corresponding path program 1 times [2025-03-13 22:26:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:43,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103195053] [2025-03-13 22:26:43,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:43,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-13 22:26:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-13 22:26:43,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:43,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-13 22:26:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103195053] [2025-03-13 22:26:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103195053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-13 22:26:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754052815] [2025-03-13 22:26:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 22:26:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 22:26:44,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-13 22:26:48,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 507 [2025-03-13 22:26:48,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:48,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:48,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 507 [2025-03-13 22:26:48,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:50,238 INFO L124 PetriNetUnfolderBase]: 1671/7904 cut-off events. [2025-03-13 22:26:50,239 INFO L125 PetriNetUnfolderBase]: For 3474/3978 co-relation queries the response was YES. [2025-03-13 22:26:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 7904 events. 1671/7904 cut-off events. For 3474/3978 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 81536 event pairs, 448 based on Foata normal form. 180/7364 useless extension candidates. Maximal degree in co-relation 13710. Up to 1419 conditions per place. [2025-03-13 22:26:50,290 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 82 selfloop transitions, 44 changer transitions 0/468 dead transitions. [2025-03-13 22:26:50,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 468 transitions, 1579 flow [2025-03-13 22:26:50,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 22:26:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 22:26:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13254 transitions. [2025-03-13 22:26:50,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8169378698224852 [2025-03-13 22:26:50,302 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 32 states and 13254 transitions. [2025-03-13 22:26:50,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 468 transitions, 1579 flow [2025-03-13 22:26:50,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 468 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:50,310 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1330 flow [2025-03-13 22:26:50,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1330, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-03-13 22:26:50,311 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2025-03-13 22:26:50,311 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1330 flow [2025-03-13 22:26:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:50,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:50,313 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:50,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:26:50,314 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:50,315 INFO L85 PathProgramCache]: Analyzing trace with hash 43640924, now seen corresponding path program 2 times [2025-03-13 22:26:50,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602397632] [2025-03-13 22:26:50,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:26:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:50,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-13 22:26:50,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 337 statements. [2025-03-13 22:26:50,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:26:50,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-13 22:26:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602397632] [2025-03-13 22:26:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602397632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:51,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:51,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-13 22:26:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026079565] [2025-03-13 22:26:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:51,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 22:26:51,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:51,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 22:26:51,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-13 22:26:55,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 507 [2025-03-13 22:26:55,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1330 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:55,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:55,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 507 [2025-03-13 22:26:55,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,069 INFO L124 PetriNetUnfolderBase]: 2221/13284 cut-off events. [2025-03-13 22:26:58,069 INFO L125 PetriNetUnfolderBase]: For 10436/11536 co-relation queries the response was YES. [2025-03-13 22:26:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24032 conditions, 13284 events. 2221/13284 cut-off events. For 10436/11536 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 153438 event pairs, 318 based on Foata normal form. 196/12217 useless extension candidates. Maximal degree in co-relation 23979. Up to 1148 conditions per place. [2025-03-13 22:26:58,152 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 111 selfloop transitions, 54 changer transitions 0/507 dead transitions. [2025-03-13 22:26:58,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 507 transitions, 2072 flow [2025-03-13 22:26:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-13 22:26:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-13 22:26:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 13672 transitions. [2025-03-13 22:26:58,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8171657402426633 [2025-03-13 22:26:58,158 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1330 flow. Second operand 33 states and 13672 transitions. [2025-03-13 22:26:58,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 507 transitions, 2072 flow [2025-03-13 22:26:58,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 507 transitions, 2021 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-13 22:26:58,174 INFO L231 Difference]: Finished difference. Result has 450 places, 453 transitions, 1609 flow [2025-03-13 22:26:58,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1609, PETRI_PLACES=450, PETRI_TRANSITIONS=453} [2025-03-13 22:26:58,175 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 1 predicate places. [2025-03-13 22:26:58,175 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 453 transitions, 1609 flow [2025-03-13 22:26:58,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:58,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:26:58,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:26:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 897226736, now seen corresponding path program 1 times [2025-03-13 22:26:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022273989] [2025-03-13 22:26:58,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-13 22:26:58,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-13 22:26:58,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-13 22:26:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022273989] [2025-03-13 22:26:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022273989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774984313] [2025-03-13 22:26:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:58,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:59,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-13 22:26:59,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 453 transitions, 1609 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:59,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:59,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-13 22:26:59,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:02,821 INFO L124 PetriNetUnfolderBase]: 4657/18080 cut-off events. [2025-03-13 22:27:02,822 INFO L125 PetriNetUnfolderBase]: For 23725/24165 co-relation queries the response was YES. [2025-03-13 22:27:02,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38487 conditions, 18080 events. 4657/18080 cut-off events. For 23725/24165 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 209468 event pairs, 773 based on Foata normal form. 274/17107 useless extension candidates. Maximal degree in co-relation 38432. Up to 3394 conditions per place. [2025-03-13 22:27:02,927 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 76 selfloop transitions, 32 changer transitions 0/498 dead transitions. [2025-03-13 22:27:02,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 498 transitions, 2051 flow [2025-03-13 22:27:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-13 22:27:02,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-13 22:27:02,929 INFO L175 Difference]: Start difference. First operand has 450 places, 453 transitions, 1609 flow. Second operand 6 states and 2703 transitions. [2025-03-13 22:27:02,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 498 transitions, 2051 flow [2025-03-13 22:27:02,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 498 transitions, 1964 flow, removed 18 selfloop flow, removed 26 redundant places. [2025-03-13 22:27:02,961 INFO L231 Difference]: Finished difference. Result has 434 places, 479 transitions, 1868 flow [2025-03-13 22:27:02,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1868, PETRI_PLACES=434, PETRI_TRANSITIONS=479} [2025-03-13 22:27:02,962 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -15 predicate places. [2025-03-13 22:27:02,962 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 479 transitions, 1868 flow [2025-03-13 22:27:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:02,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:02,963 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:27:02,963 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:27:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1741531119, now seen corresponding path program 1 times [2025-03-13 22:27:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129141760] [2025-03-13 22:27:02,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:02,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-13 22:27:02,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-13 22:27:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-13 22:27:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129141760] [2025-03-13 22:27:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129141760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468610136] [2025-03-13 22:27:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:03,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:03,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:03,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:03,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-13 22:27:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 479 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:03,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-13 22:27:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:05,642 INFO L124 PetriNetUnfolderBase]: 3465/16521 cut-off events. [2025-03-13 22:27:05,642 INFO L125 PetriNetUnfolderBase]: For 31795/32362 co-relation queries the response was YES. [2025-03-13 22:27:05,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37519 conditions, 16521 events. 3465/16521 cut-off events. For 31795/32362 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 197843 event pairs, 918 based on Foata normal form. 157/15350 useless extension candidates. Maximal degree in co-relation 37461. Up to 2860 conditions per place. [2025-03-13 22:27:05,779 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 49 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2025-03-13 22:27:05,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 485 transitions, 2010 flow [2025-03-13 22:27:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-13 22:27:05,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-13 22:27:05,780 INFO L175 Difference]: Start difference. First operand has 434 places, 479 transitions, 1868 flow. Second operand 3 states and 1398 transitions. [2025-03-13 22:27:05,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 485 transitions, 2010 flow [2025-03-13 22:27:05,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 485 transitions, 2002 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:05,828 INFO L231 Difference]: Finished difference. Result has 435 places, 478 transitions, 1862 flow [2025-03-13 22:27:05,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1862, PETRI_PLACES=435, PETRI_TRANSITIONS=478} [2025-03-13 22:27:05,829 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -14 predicate places. [2025-03-13 22:27:05,829 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 478 transitions, 1862 flow [2025-03-13 22:27:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:05,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:05,829 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:05,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:27:05,829 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:27:05,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1471564232, now seen corresponding path program 1 times [2025-03-13 22:27:05,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:05,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584943242] [2025-03-13 22:27:05,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-13 22:27:05,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-13 22:27:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-13 22:27:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584943242] [2025-03-13 22:27:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584943242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106777002] [2025-03-13 22:27:06,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:06,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:06,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:06,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:27:06,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-13 22:27:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-13 22:27:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:06,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 22:27:06,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-13 22:27:06,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-13 22:27:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106777002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:27:07,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:27:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-13 22:27:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839226225] [2025-03-13 22:27:07,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:27:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-13 22:27:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:07,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-13 22:27:07,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-13 22:27:08,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 507 [2025-03-13 22:27:08,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 478 transitions, 1862 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:08,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 507 [2025-03-13 22:27:08,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,397 INFO L124 PetriNetUnfolderBase]: 7028/29319 cut-off events. [2025-03-13 22:27:15,398 INFO L125 PetriNetUnfolderBase]: For 77476/83567 co-relation queries the response was YES. [2025-03-13 22:27:15,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66605 conditions, 29319 events. 7028/29319 cut-off events. For 77476/83567 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 358991 event pairs, 2209 based on Foata normal form. 1049/28649 useless extension candidates. Maximal degree in co-relation 66544. Up to 6135 conditions per place. [2025-03-13 22:27:15,680 INFO L140 encePairwiseOnDemand]: 465/507 looper letters, 130 selfloop transitions, 115 changer transitions 0/613 dead transitions. [2025-03-13 22:27:15,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 613 transitions, 3069 flow [2025-03-13 22:27:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 22:27:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 22:27:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2025-03-13 22:27:15,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444135050469892 [2025-03-13 22:27:15,692 INFO L175 Difference]: Start difference. First operand has 435 places, 478 transitions, 1862 flow. Second operand 34 states and 14556 transitions. [2025-03-13 22:27:15,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 613 transitions, 3069 flow [2025-03-13 22:27:15,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 613 transitions, 3065 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:15,777 INFO L231 Difference]: Finished difference. Result has 476 places, 556 transitions, 2596 flow [2025-03-13 22:27:15,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2596, PETRI_PLACES=476, PETRI_TRANSITIONS=556} [2025-03-13 22:27:15,778 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 27 predicate places. [2025-03-13 22:27:15,778 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 556 transitions, 2596 flow [2025-03-13 22:27:15,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:15,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:15,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 22:27:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-13 22:27:15,981 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:27:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash -421008598, now seen corresponding path program 1 times [2025-03-13 22:27:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420667992] [2025-03-13 22:27:15,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-13 22:27:16,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-13 22:27:16,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420667992] [2025-03-13 22:27:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420667992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634644168] [2025-03-13 22:27:17,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:17,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:17,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:27:17,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-13 22:27:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-13 22:27:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 22:27:17,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:17,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:27:17,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:27:17,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:27:18,283 INFO L349 Elim1Store]: treesize reduction 656, result has 5.3 percent of original size [2025-03-13 22:27:18,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 81 [2025-03-13 22:27:18,295 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-13 22:27:18,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 71 [2025-03-13 22:27:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:18,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:18,462 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2025-03-13 22:27:18,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 117 [2025-03-13 22:27:18,522 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2025-03-13 22:27:18,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 132 treesize of output 141 [2025-03-13 22:27:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-13 22:27:18,591 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2025-03-13 22:27:18,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2025-03-13 22:27:18,632 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2025-03-13 22:27:18,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2025-03-13 22:27:18,674 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2025-03-13 22:27:18,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2025-03-13 22:27:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634644168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:27:19,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:27:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-13 22:27:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909804506] [2025-03-13 22:27:19,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:27:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 22:27:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:19,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 22:27:19,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-13 22:27:21,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-13 22:27:21,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 556 transitions, 2596 flow. Second operand has 22 states, 22 states have (on average 418.04545454545456) internal successors, (9197), 22 states have internal predecessors, (9197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:21,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:21,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-13 22:27:21,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:29,142 INFO L124 PetriNetUnfolderBase]: 7910/34164 cut-off events. [2025-03-13 22:27:29,142 INFO L125 PetriNetUnfolderBase]: For 78558/81432 co-relation queries the response was YES. [2025-03-13 22:27:29,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81397 conditions, 34164 events. 7910/34164 cut-off events. For 78558/81432 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 427545 event pairs, 1202 based on Foata normal form. 1107/32632 useless extension candidates. Maximal degree in co-relation 81322. Up to 3547 conditions per place. [2025-03-13 22:27:29,506 INFO L140 encePairwiseOnDemand]: 475/507 looper letters, 163 selfloop transitions, 72 changer transitions 0/656 dead transitions. [2025-03-13 22:27:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 656 transitions, 3887 flow [2025-03-13 22:27:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-13 22:27:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-13 22:27:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2025-03-13 22:27:29,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8268244575936884 [2025-03-13 22:27:29,512 INFO L175 Difference]: Start difference. First operand has 476 places, 556 transitions, 2596 flow. Second operand 25 states and 10480 transitions. [2025-03-13 22:27:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 656 transitions, 3887 flow [2025-03-13 22:27:29,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 656 transitions, 3803 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-13 22:27:29,673 INFO L231 Difference]: Finished difference. Result has 500 places, 570 transitions, 2907 flow [2025-03-13 22:27:29,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2508, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2907, PETRI_PLACES=500, PETRI_TRANSITIONS=570} [2025-03-13 22:27:29,674 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 51 predicate places. [2025-03-13 22:27:29,674 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 570 transitions, 2907 flow [2025-03-13 22:27:29,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.04545454545456) internal successors, (9197), 22 states have internal predecessors, (9197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:29,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:29,676 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:29,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 22:27:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:29,880 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:27:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1532239480, now seen corresponding path program 2 times [2025-03-13 22:27:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:29,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557144474] [2025-03-13 22:27:29,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:29,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-13 22:27:30,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-13 22:27:30,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:30,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557144474] [2025-03-13 22:27:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557144474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:27:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635550462] [2025-03-13 22:27:31,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:27:31,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:27:31,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:31,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:27:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:27:31,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-13 22:27:32,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-13 22:27:32,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:27:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:32,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-13 22:27:32,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:27:32,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:27:32,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:27:32,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:27:32,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2025-03-13 22:27:32,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2025-03-13 22:27:32,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-13 22:27:32,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-13 22:27:32,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2025-03-13 22:27:32,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-13 22:27:32,566 INFO L349 Elim1Store]: treesize reduction 468, result has 0.2 percent of original size [2025-03-13 22:27:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 45 [2025-03-13 22:27:32,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-13 22:27:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:32,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:27:32,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-13 22:27:32,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:32,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-13 22:27:32,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-13 22:27:32,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:27:32,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-13 22:27:32,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-13 22:27:32,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:32,673 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:32,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-13 22:27:32,674 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:32,677 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:32,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:27:32,679 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-13 22:27:32,682 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-13 22:27:32,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-13 22:27:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-13 22:27:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635550462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:27:33,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:27:33,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 26 [2025-03-13 22:27:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642132939] [2025-03-13 22:27:33,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:27:33,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 22:27:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:33,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 22:27:33,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-03-13 22:27:36,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 507 [2025-03-13 22:27:36,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 570 transitions, 2907 flow. Second operand has 27 states, 27 states have (on average 321.85185185185185) internal successors, (8690), 27 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:36,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:36,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 507 [2025-03-13 22:27:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:45,606 INFO L124 PetriNetUnfolderBase]: 7950/36789 cut-off events. [2025-03-13 22:27:45,606 INFO L125 PetriNetUnfolderBase]: For 125282/128838 co-relation queries the response was YES. [2025-03-13 22:27:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98362 conditions, 36789 events. 7950/36789 cut-off events. For 125282/128838 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 472591 event pairs, 1327 based on Foata normal form. 1746/36889 useless extension candidates. Maximal degree in co-relation 98281. Up to 4475 conditions per place. [2025-03-13 22:27:46,112 INFO L140 encePairwiseOnDemand]: 476/507 looper letters, 189 selfloop transitions, 110 changer transitions 0/657 dead transitions. [2025-03-13 22:27:46,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 657 transitions, 4247 flow [2025-03-13 22:27:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 22:27:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 22:27:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 8387 transitions. [2025-03-13 22:27:46,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6362463966014262 [2025-03-13 22:27:46,117 INFO L175 Difference]: Start difference. First operand has 500 places, 570 transitions, 2907 flow. Second operand 26 states and 8387 transitions. [2025-03-13 22:27:46,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 657 transitions, 4247 flow [2025-03-13 22:27:46,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 657 transitions, 4186 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-03-13 22:27:46,411 INFO L231 Difference]: Finished difference. Result has 510 places, 599 transitions, 3539 flow [2025-03-13 22:27:46,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2849, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3539, PETRI_PLACES=510, PETRI_TRANSITIONS=599} [2025-03-13 22:27:46,412 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 61 predicate places. [2025-03-13 22:27:46,412 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 599 transitions, 3539 flow [2025-03-13 22:27:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 321.85185185185185) internal successors, (8690), 27 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:46,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:46,413 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:46,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 22:27:46,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-13 22:27:46,614 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-13 22:27:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1846234691, now seen corresponding path program 1 times [2025-03-13 22:27:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317458423] [2025-03-13 22:27:46,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:46,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-13 22:27:46,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-13 22:27:46,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:46,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-13 22:27:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317458423] [2025-03-13 22:27:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317458423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957885418] [2025-03-13 22:27:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:46,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:46,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:46,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-13 22:27:46,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 599 transitions, 3539 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:27:46,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:46,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-13 22:27:46,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand