./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.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-prod-cons-eq.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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:16,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:16,648 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:16,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:16,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:16,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:16,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:16,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:16,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:16,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:16,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:16,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:16,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:16,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:16,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:16,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:16,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:16,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:16,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:16,683 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2025-03-13 22:26:16,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:16,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:16,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:16,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:16,937 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:16,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-13 22:26:18,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d5be085/16f14e8239714459bf8b91631edbdbbc/FLAG7a0a645e1 [2025-03-13 22:26:18,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:18,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-03-13 22:26:18,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d5be085/16f14e8239714459bf8b91631edbdbbc/FLAG7a0a645e1 [2025-03-13 22:26:18,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d5be085/16f14e8239714459bf8b91631edbdbbc [2025-03-13 22:26:18,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:18,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:18,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:18,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:18,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:18,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:18" (1/1) ... [2025-03-13 22:26:18,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ac0aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:18, skipping insertion in model container [2025-03-13 22:26:18,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:18" (1/1) ... [2025-03-13 22:26:18,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:18,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:18,873 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:18,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:18,941 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:18,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:18 WrapperNode [2025-03-13 22:26:18,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:18,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:18,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:18,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:18,948 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:18" (1/1) ... [2025-03-13 22:26:18,959 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:18" (1/1) ... [2025-03-13 22:26:19,002 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 817 [2025-03-13 22:26:19,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:19,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:19,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:19,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:19,007 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:18" (1/1) ... [2025-03-13 22:26:19,007 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:18" (1/1) ... [2025-03-13 22:26:19,017 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:18" (1/1) ... [2025-03-13 22:26:19,019 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:18" (1/1) ... [2025-03-13 22:26:19,044 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:18" (1/1) ... [2025-03-13 22:26:19,050 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:18" (1/1) ... [2025-03-13 22:26:19,055 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:18" (1/1) ... [2025-03-13 22:26:19,060 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:18" (1/1) ... [2025-03-13 22:26:19,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:19,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:19,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:19,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:19,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:18" (1/1) ... [2025-03-13 22:26:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:19,097 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:19,101 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:19,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:19,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:26:19,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:26:19,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:26:19,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:26:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:26:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:26:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:26:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:19,122 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:19,234 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:19,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:20,215 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:20,216 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:20,216 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:20,949 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:20,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:20 BoogieIcfgContainer [2025-03-13 22:26:20,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:20,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:20,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:20,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:20,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:18" (1/3) ... [2025-03-13 22:26:20,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3468cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:20, skipping insertion in model container [2025-03-13 22:26:20,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:18" (2/3) ... [2025-03-13 22:26:20,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3468cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:20, skipping insertion in model container [2025-03-13 22:26:20,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:20" (3/3) ... [2025-03-13 22:26:20,959 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2025-03-13 22:26:20,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:20,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons-eq.wvr.c that has 4 procedures, 808 locations, 1 initial locations, 9 loop locations, and 133 error locations. [2025-03-13 22:26:20,973 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:21,148 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:26:21,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 846 transitions, 1713 flow [2025-03-13 22:26:21,443 INFO L124 PetriNetUnfolderBase]: 39/843 cut-off events. [2025-03-13 22:26:21,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:26:21,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 843 events. 39/843 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1660 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 599. Up to 2 conditions per place. [2025-03-13 22:26:21,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 846 transitions, 1713 flow [2025-03-13 22:26:21,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 826 transitions, 1670 flow [2025-03-13 22:26:21,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:21,501 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;@63d464a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:21,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2025-03-13 22:26:21,508 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:21,508 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 22:26:21,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:21,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:21,509 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] [2025-03-13 22:26:21,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:21,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -856325579, now seen corresponding path program 1 times [2025-03-13 22:26:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497309526] [2025-03-13 22:26:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:26:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:26:21,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:21,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:21,681 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:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497309526] [2025-03-13 22:26:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497309526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91938492] [2025-03-13 22:26:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:21,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:21,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:21,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:21,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:21,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 826 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 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:21,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:21,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:21,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:22,102 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2025-03-13 22:26:22,102 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 22:26:22,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3619 event pairs, 19 based on Foata normal form. 65/966 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2025-03-13 22:26:22,119 INFO L140 encePairwiseOnDemand]: 770/846 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2025-03-13 22:26:22,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2025-03-13 22:26:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2349 transitions. [2025-03-13 22:26:22,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925531914893617 [2025-03-13 22:26:22,145 INFO L175 Difference]: Start difference. First operand has 798 places, 826 transitions, 1670 flow. Second operand 3 states and 2349 transitions. [2025-03-13 22:26:22,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2025-03-13 22:26:22,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:26:22,168 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2025-03-13 22:26:22,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2025-03-13 22:26:22,174 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2025-03-13 22:26:22,174 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2025-03-13 22:26:22,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 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:22,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:22,176 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] [2025-03-13 22:26:22,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:22,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:22,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash 5314622, now seen corresponding path program 1 times [2025-03-13 22:26:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487271246] [2025-03-13 22:26:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:22,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:26:22,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:26:22,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:22,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:22,258 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:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487271246] [2025-03-13 22:26:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487271246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040377749] [2025-03-13 22:26:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:22,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:22,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:22,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-03-13 22:26:22,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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:22,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:22,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-03-13 22:26:22,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:22,601 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2025-03-13 22:26:22,602 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:22,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4367 event pairs, 67 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2025-03-13 22:26:22,617 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2025-03-13 22:26:22,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2025-03-13 22:26:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2025-03-13 22:26:22,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912529550827423 [2025-03-13 22:26:22,622 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2025-03-13 22:26:22,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2025-03-13 22:26:22,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:22,632 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2025-03-13 22:26:22,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2025-03-13 22:26:22,633 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2025-03-13 22:26:22,634 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2025-03-13 22:26:22,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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:22,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:22,635 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] [2025-03-13 22:26:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:22,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash -925310534, now seen corresponding path program 1 times [2025-03-13 22:26:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:22,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649556184] [2025-03-13 22:26:22,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:22,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:26:22,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:26:22,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:22,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:22,677 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:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649556184] [2025-03-13 22:26:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649556184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039822681] [2025-03-13 22:26:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:22,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:22,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:22,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:22,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 846 [2025-03-13 22:26:22,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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:22,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:22,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 846 [2025-03-13 22:26:22,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:22,981 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2025-03-13 22:26:22,982 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:26:22,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5363 event pairs, 99 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2025-03-13 22:26:23,000 INFO L140 encePairwiseOnDemand]: 837/846 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2025-03-13 22:26:23,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2025-03-13 22:26:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2025-03-13 22:26:23,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-13 22:26:23,005 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2025-03-13 22:26:23,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2025-03-13 22:26:23,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:23,014 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2025-03-13 22:26:23,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2025-03-13 22:26:23,016 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2025-03-13 22:26:23,016 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2025-03-13 22:26:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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:23,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:23,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:23,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:23,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 234534759, now seen corresponding path program 1 times [2025-03-13 22:26:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858643249] [2025-03-13 22:26:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:23,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:26:23,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:26:23,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:23,061 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:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:23,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858643249] [2025-03-13 22:26:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858643249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195416458] [2025-03-13 22:26:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:23,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:23,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:23,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-03-13 22:26:23,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 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:23,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:23,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-03-13 22:26:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:23,515 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2025-03-13 22:26:23,515 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-13 22:26:23,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 13296 event pairs, 235 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2025-03-13 22:26:23,530 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-03-13 22:26:23,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2025-03-13 22:26:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2025-03-13 22:26:23,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8873128447596532 [2025-03-13 22:26:23,534 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2025-03-13 22:26:23,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2025-03-13 22:26:23,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:23,546 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2025-03-13 22:26:23,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2025-03-13 22:26:23,547 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2025-03-13 22:26:23,547 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2025-03-13 22:26:23,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 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:23,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:23,549 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] [2025-03-13 22:26:23,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:23,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2067086619, now seen corresponding path program 1 times [2025-03-13 22:26:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559021079] [2025-03-13 22:26:23,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:23,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:26:23,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:26:23,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:23,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:23,608 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:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559021079] [2025-03-13 22:26:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559021079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:23,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:23,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:23,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790655082] [2025-03-13 22:26:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:23,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:23,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:23,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-13 22:26:23,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:23,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:23,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-13 22:26:23,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:23,768 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2025-03-13 22:26:23,768 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:26:23,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3339 event pairs, 19 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2025-03-13 22:26:23,776 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-03-13 22:26:23,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2025-03-13 22:26:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-13 22:26:23,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-13 22:26:23,780 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2025-03-13 22:26:23,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2025-03-13 22:26:23,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:23,787 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2025-03-13 22:26:23,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-13 22:26:23,789 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-13 22:26:23,789 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2025-03-13 22:26:23,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:23,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:23,791 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] [2025-03-13 22:26:23,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:23,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash -824391857, now seen corresponding path program 1 times [2025-03-13 22:26:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799533730] [2025-03-13 22:26:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:23,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:26:23,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:26:23,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:23,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:23,851 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:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799533730] [2025-03-13 22:26:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799533730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:23,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090447264] [2025-03-13 22:26:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:23,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:23,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:23,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:23,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:23,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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:23,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:23,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:23,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:24,049 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2025-03-13 22:26:24,050 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:26:24,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3259 event pairs, 11 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2025-03-13 22:26:24,061 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2025-03-13 22:26:24,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2025-03-13 22:26:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-03-13 22:26:24,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-03-13 22:26:24,066 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2025-03-13 22:26:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2025-03-13 22:26:24,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:24,076 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2025-03-13 22:26:24,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-03-13 22:26:24,079 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-03-13 22:26:24,080 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2025-03-13 22:26:24,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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:24,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:24,081 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] [2025-03-13 22:26:24,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:24,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:24,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash -43258859, now seen corresponding path program 1 times [2025-03-13 22:26:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919367835] [2025-03-13 22:26:24,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:26:24,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:26:24,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:24,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:24,127 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:24,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:24,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919367835] [2025-03-13 22:26:24,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919367835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:24,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695783030] [2025-03-13 22:26:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:24,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:24,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:24,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:24,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-13 22:26:24,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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:24,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:24,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-13 22:26:24,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:24,490 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2025-03-13 22:26:24,490 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-13 22:26:24,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8163 event pairs, 131 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2025-03-13 22:26:24,504 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-03-13 22:26:24,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2025-03-13 22:26:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-13 22:26:24,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-03-13 22:26:24,510 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2025-03-13 22:26:24,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2025-03-13 22:26:24,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:24,521 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2025-03-13 22:26:24,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2025-03-13 22:26:24,523 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2025-03-13 22:26:24,524 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2025-03-13 22:26:24,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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:24,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:24,525 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] [2025-03-13 22:26:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:24,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1220055648, now seen corresponding path program 1 times [2025-03-13 22:26:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:24,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515870285] [2025-03-13 22:26:24,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:24,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:24,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:26:24,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:26:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:24,563 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:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515870285] [2025-03-13 22:26:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515870285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:24,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888682363] [2025-03-13 22:26:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:24,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:24,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:24,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-13 22:26:24,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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:24,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:24,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-13 22:26:24,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:24,768 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2025-03-13 22:26:24,769 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:26:24,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3747 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2025-03-13 22:26:24,777 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-03-13 22:26:24,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2025-03-13 22:26:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-13 22:26:24,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-03-13 22:26:24,781 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2025-03-13 22:26:24,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2025-03-13 22:26:24,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:24,789 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2025-03-13 22:26:24,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2025-03-13 22:26:24,792 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2025-03-13 22:26:24,792 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2025-03-13 22:26:24,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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:24,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:24,794 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] [2025-03-13 22:26:24,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:24,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 84871342, now seen corresponding path program 1 times [2025-03-13 22:26:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835626160] [2025-03-13 22:26:24,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:24,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:26:24,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:26:24,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:24,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:24,829 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:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835626160] [2025-03-13 22:26:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835626160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12911917] [2025-03-13 22:26:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:24,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:24,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-13 22:26:24,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:24,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:24,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-13 22:26:24,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:25,039 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2025-03-13 22:26:25,039 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 22:26:25,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5000 event pairs, 53 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2025-03-13 22:26:25,048 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-03-13 22:26:25,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2025-03-13 22:26:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-13 22:26:25,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-13 22:26:25,052 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2025-03-13 22:26:25,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2025-03-13 22:26:25,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:25,060 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2025-03-13 22:26:25,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2025-03-13 22:26:25,061 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2025-03-13 22:26:25,061 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2025-03-13 22:26:25,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:25,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:25,062 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] [2025-03-13 22:26:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:25,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:25,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:25,063 INFO L85 PathProgramCache]: Analyzing trace with hash 824972066, now seen corresponding path program 1 times [2025-03-13 22:26:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318185228] [2025-03-13 22:26:25,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:25,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:26:25,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:26:25,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:25,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:25,117 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:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318185228] [2025-03-13 22:26:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318185228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822097234] [2025-03-13 22:26:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:25,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:25,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:25,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:25,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 846 [2025-03-13 22:26:25,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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:25,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:25,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 846 [2025-03-13 22:26:25,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:25,363 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2025-03-13 22:26:25,364 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-13 22:26:25,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7023 event pairs, 129 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2025-03-13 22:26:25,374 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-03-13 22:26:25,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2025-03-13 22:26:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2025-03-13 22:26:25,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8920409771473601 [2025-03-13 22:26:25,378 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2025-03-13 22:26:25,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2025-03-13 22:26:25,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:25,386 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2025-03-13 22:26:25,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2025-03-13 22:26:25,388 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2025-03-13 22:26:25,388 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2025-03-13 22:26:25,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 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:25,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:25,389 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] [2025-03-13 22:26:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:25,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:25,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash -532822209, now seen corresponding path program 1 times [2025-03-13 22:26:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141785272] [2025-03-13 22:26:25,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:26:25,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:26:25,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:25,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:25,439 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:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141785272] [2025-03-13 22:26:25,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141785272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:25,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:25,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937663269] [2025-03-13 22:26:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:25,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:25,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:25,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:25,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-13 22:26:25,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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:25,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:25,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-13 22:26:25,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:25,625 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2025-03-13 22:26:25,625 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 22:26:25,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4921 event pairs, 53 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2025-03-13 22:26:25,634 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-03-13 22:26:25,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2025-03-13 22:26:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-03-13 22:26:25,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-03-13 22:26:25,637 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2025-03-13 22:26:25,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2025-03-13 22:26:25,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:25,644 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2025-03-13 22:26:25,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2025-03-13 22:26:25,646 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2025-03-13 22:26:25,646 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2025-03-13 22:26:25,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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:25,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:25,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:25,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:25,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:25,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash -883893181, now seen corresponding path program 1 times [2025-03-13 22:26:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:25,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501655412] [2025-03-13 22:26:25,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:25,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:26:25,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:26:25,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:25,681 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:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501655412] [2025-03-13 22:26:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501655412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312209059] [2025-03-13 22:26:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:25,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:25,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:25,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:25,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-13 22:26:25,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:25,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:25,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-13 22:26:25,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:25,851 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2025-03-13 22:26:25,852 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 22:26:25,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4853 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2025-03-13 22:26:25,862 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-03-13 22:26:25,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2025-03-13 22:26:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-13 22:26:25,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-13 22:26:25,865 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2025-03-13 22:26:25,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2025-03-13 22:26:25,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:25,872 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2025-03-13 22:26:25,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2025-03-13 22:26:25,873 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2025-03-13 22:26:25,874 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2025-03-13 22:26:25,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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:25,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:25,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:25,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:25,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -953492446, now seen corresponding path program 1 times [2025-03-13 22:26:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740453071] [2025-03-13 22:26:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:25,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-13 22:26:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-13 22:26:25,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:25,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:25,903 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:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740453071] [2025-03-13 22:26:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740453071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862177350] [2025-03-13 22:26:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:25,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:25,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:25,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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:25,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:25,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:25,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:26,502 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2025-03-13 22:26:26,502 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-13 22:26:26,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 35840 event pairs, 79 based on Foata normal form. 0/3902 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2025-03-13 22:26:26,528 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2025-03-13 22:26:26,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2025-03-13 22:26:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2025-03-13 22:26:26,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-13 22:26:26,531 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2025-03-13 22:26:26,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2025-03-13 22:26:26,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:26,538 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2025-03-13 22:26:26,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2025-03-13 22:26:26,540 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-13 22:26:26,540 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2025-03-13 22:26:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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:26,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:26,541 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] [2025-03-13 22:26:26,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:26,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:26,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1992054102, now seen corresponding path program 1 times [2025-03-13 22:26:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466404534] [2025-03-13 22:26:26,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:26,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-13 22:26:26,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-13 22:26:26,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:26,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:27,021 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:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:27,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466404534] [2025-03-13 22:26:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466404534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251212243] [2025-03-13 22:26:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:27,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:27,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:27,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:27,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 846 [2025-03-13 22:26:27,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 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:27,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:27,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 846 [2025-03-13 22:26:27,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:28,885 INFO L124 PetriNetUnfolderBase]: 2081/10266 cut-off events. [2025-03-13 22:26:28,885 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-13 22:26:28,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 10266 events. 2081/10266 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 91807 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13486. Up to 2842 conditions per place. [2025-03-13 22:26:28,935 INFO L140 encePairwiseOnDemand]: 822/846 looper letters, 78 selfloop transitions, 20 changer transitions 0/719 dead transitions. [2025-03-13 22:26:28,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 719 transitions, 1652 flow [2025-03-13 22:26:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2025-03-13 22:26:28,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118597320724981 [2025-03-13 22:26:28,941 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 6 states and 4121 transitions. [2025-03-13 22:26:28,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 719 transitions, 1652 flow [2025-03-13 22:26:28,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 719 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:28,948 INFO L231 Difference]: Finished difference. Result has 713 places, 719 transitions, 1495 flow [2025-03-13 22:26:28,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=713, PETRI_TRANSITIONS=719} [2025-03-13 22:26:28,950 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-03-13 22:26:28,950 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 719 transitions, 1495 flow [2025-03-13 22:26:28,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 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:28,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:28,952 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] [2025-03-13 22:26:28,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:28,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:28,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1055325926, now seen corresponding path program 1 times [2025-03-13 22:26:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:28,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065080768] [2025-03-13 22:26:28,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:28,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-13 22:26:28,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-13 22:26:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,000 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:29,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065080768] [2025-03-13 22:26:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065080768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326708102] [2025-03-13 22:26:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-13 22:26:29,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 719 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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:29,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-13 22:26:29,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:29,278 INFO L124 PetriNetUnfolderBase]: 190/1516 cut-off events. [2025-03-13 22:26:29,278 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-13 22:26:29,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1516 events. 190/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7112 event pairs, 105 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1787. Up to 253 conditions per place. [2025-03-13 22:26:29,288 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 18 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2025-03-13 22:26:29,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1533 flow [2025-03-13 22:26:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2025-03-13 22:26:29,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944050433412135 [2025-03-13 22:26:29,292 INFO L175 Difference]: Start difference. First operand has 713 places, 719 transitions, 1495 flow. Second operand 3 states and 2270 transitions. [2025-03-13 22:26:29,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1533 flow [2025-03-13 22:26:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1493 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:29,299 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1457 flow [2025-03-13 22:26:29,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2025-03-13 22:26:29,300 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -89 predicate places. [2025-03-13 22:26:29,300 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1457 flow [2025-03-13 22:26:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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:29,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:29,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:29,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:29,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1741184882, now seen corresponding path program 1 times [2025-03-13 22:26:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779435008] [2025-03-13 22:26:29,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:29,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-13 22:26:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-13 22:26:29,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:29,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:29,341 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:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779435008] [2025-03-13 22:26:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779435008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846787893] [2025-03-13 22:26:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:29,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:29,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:29,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-03-13 22:26:29,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 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:29,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:29,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-03-13 22:26:29,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,561 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2025-03-13 22:26:30,561 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-13 22:26:30,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83948 event pairs, 287 based on Foata normal form. 0/7284 useless extension candidates. Maximal degree in co-relation 9825. Up to 689 conditions per place. [2025-03-13 22:26:30,613 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2025-03-13 22:26:30,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 712 transitions, 1495 flow [2025-03-13 22:26:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2025-03-13 22:26:30,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877068557919622 [2025-03-13 22:26:30,616 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1457 flow. Second operand 3 states and 2253 transitions. [2025-03-13 22:26:30,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 712 transitions, 1495 flow [2025-03-13 22:26:30,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:30,623 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2025-03-13 22:26:30,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2025-03-13 22:26:30,624 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-13 22:26:30,624 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2025-03-13 22:26:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 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,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:30,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:30,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:30,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1662694344, now seen corresponding path program 1 times [2025-03-13 22:26:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935399205] [2025-03-13 22:26:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-13 22:26:30,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-13 22:26:30,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:30,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,664 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,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935399205] [2025-03-13 22:26:30,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935399205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558950932] [2025-03-13 22:26:30,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-13 22:26:30,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-13 22:26:30,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:30,860 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2025-03-13 22:26:30,860 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-13 22:26:30,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4950 event pairs, 71 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2025-03-13 22:26:30,869 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2025-03-13 22:26:30,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2025-03-13 22:26:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-13 22:26:30,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-13 22:26:30,873 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2025-03-13 22:26:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2025-03-13 22:26:30,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:30,879 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2025-03-13 22:26:30,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2025-03-13 22:26:30,881 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-03-13 22:26:30,881 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2025-03-13 22:26:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:30,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:26:30,882 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:30,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 798808655, now seen corresponding path program 1 times [2025-03-13 22:26:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278796165] [2025-03-13 22:26:30,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:30,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:26:30,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:26:30,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:30,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:30,917 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,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278796165] [2025-03-13 22:26:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278796165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:30,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:30,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140732979] [2025-03-13 22:26:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:30,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:30,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:30,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:30,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-13 22:26:30,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:30,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-13 22:26:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:31,048 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2025-03-13 22:26:31,049 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:26:31,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3603 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2025-03-13 22:26:31,057 INFO L140 encePairwiseOnDemand]: 844/846 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2025-03-13 22:26:31,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2025-03-13 22:26:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2025-03-13 22:26:31,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995271867612293 [2025-03-13 22:26:31,060 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2025-03-13 22:26:31,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2025-03-13 22:26:31,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:31,068 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2025-03-13 22:26:31,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2025-03-13 22:26:31,069 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-13 22:26:31,070 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2025-03-13 22:26:31,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,070 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] [2025-03-13 22:26:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:26:31,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -527695642, now seen corresponding path program 1 times [2025-03-13 22:26:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888905084] [2025-03-13 22:26:31,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-13 22:26:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-13 22:26:31,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,127 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,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888905084] [2025-03-13 22:26:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888905084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668135393] [2025-03-13 22:26:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:31,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:31,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:31,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 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,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:31,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:31,336 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2025-03-13 22:26:31,337 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:26:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3578 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2025-03-13 22:26:31,348 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2025-03-13 22:26:31,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2025-03-13 22:26:31,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-13 22:26:31,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-03-13 22:26:31,353 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2025-03-13 22:26:31,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2025-03-13 22:26:31,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:31,365 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2025-03-13 22:26:31,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2025-03-13 22:26:31,366 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-03-13 22:26:31,367 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2025-03-13 22:26:31,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 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,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:31,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:26:31,368 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:31,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1459363496, now seen corresponding path program 1 times [2025-03-13 22:26:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:31,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746435718] [2025-03-13 22:26:31,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:31,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-13 22:26:31,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-13 22:26:31,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:31,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:31,499 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,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746435718] [2025-03-13 22:26:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746435718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713641332] [2025-03-13 22:26:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:31,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:31,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:31,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:31,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 846 [2025-03-13 22:26:31,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:31,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 846 [2025-03-13 22:26:31,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,460 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2025-03-13 22:26:33,460 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-03-13 22:26:33,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 90758 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2025-03-13 22:26:33,521 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2025-03-13 22:26:33,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2025-03-13 22:26:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2025-03-13 22:26:33,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855397951142632 [2025-03-13 22:26:33,524 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2025-03-13 22:26:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2025-03-13 22:26:33,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,531 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2025-03-13 22:26:33,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2025-03-13 22:26:33,532 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2025-03-13 22:26:33,532 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2025-03-13 22:26:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,533 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] [2025-03-13 22:26:33,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:26:33,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:33,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1494376013, now seen corresponding path program 1 times [2025-03-13 22:26:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569547596] [2025-03-13 22:26:33,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-13 22:26:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-13 22:26:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,579 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,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569547596] [2025-03-13 22:26:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569547596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562673093] [2025-03-13 22:26:33,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-13 22:26:33,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-13 22:26:33,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:33,740 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2025-03-13 22:26:33,741 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 22:26:33,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4347 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2025-03-13 22:26:33,751 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2025-03-13 22:26:33,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2025-03-13 22:26:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-03-13 22:26:33,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-03-13 22:26:33,755 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2025-03-13 22:26:33,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2025-03-13 22:26:33,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:33,762 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2025-03-13 22:26:33,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2025-03-13 22:26:33,763 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2025-03-13 22:26:33,764 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2025-03-13 22:26:33,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 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,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:33,765 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] [2025-03-13 22:26:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:26:33,765 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1249365395, now seen corresponding path program 1 times [2025-03-13 22:26:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159661652] [2025-03-13 22:26:33,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:33,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-13 22:26:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-13 22:26:33,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:33,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:33,820 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,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159661652] [2025-03-13 22:26:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159661652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386982374] [2025-03-13 22:26:33,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:33,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:33,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:33,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:33,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 846 [2025-03-13 22:26:33,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:33,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:33,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 846 [2025-03-13 22:26:33,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,378 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2025-03-13 22:26:34,379 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-13 22:26:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 35567 event pairs, 79 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2025-03-13 22:26:34,408 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2025-03-13 22:26:34,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2025-03-13 22:26:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2025-03-13 22:26:34,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2025-03-13 22:26:34,411 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2025-03-13 22:26:34,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2025-03-13 22:26:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:34,417 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2025-03-13 22:26:34,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2025-03-13 22:26:34,418 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-13 22:26:34,419 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2025-03-13 22:26:34,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:26:34,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,420 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:34,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:26:34,420 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:34,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 297246183, now seen corresponding path program 1 times [2025-03-13 22:26:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-03-13 22:26:34,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-13 22:26:34,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-13 22:26:34,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,466 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,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46739182] [2025-03-13 22:26:34,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46739182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90604624] [2025-03-13 22:26:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-03-13 22:26:34,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-03-13 22:26:34,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:34,647 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2025-03-13 22:26:34,647 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 22:26:34,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4640 event pairs, 53 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2025-03-13 22:26:34,654 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2025-03-13 22:26:34,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2025-03-13 22:26:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-03-13 22:26:34,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-03-13 22:26:34,657 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2025-03-13 22:26:34,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2025-03-13 22:26:34,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:34,663 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2025-03-13 22:26:34,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2025-03-13 22:26:34,664 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-13 22:26:34,664 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2025-03-13 22:26:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:34,665 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] [2025-03-13 22:26:34,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:26:34,665 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 325251502, now seen corresponding path program 1 times [2025-03-13 22:26:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-03-13 22:26:34,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:34,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-13 22:26:34,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-13 22:26:34,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:34,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:34,708 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,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462158536] [2025-03-13 22:26:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462158536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170380956] [2025-03-13 22:26:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:34,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:34,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:34,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:34,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:35,321 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2025-03-13 22:26:35,321 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-13 22:26:35,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37550 event pairs, 40 based on Foata normal form. 0/4166 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2025-03-13 22:26:35,341 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-13 22:26:35,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2025-03-13 22:26:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-13 22:26:35,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-03-13 22:26:35,344 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2025-03-13 22:26:35,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2025-03-13 22:26:35,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:35,349 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2025-03-13 22:26:35,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2025-03-13 22:26:35,350 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-13 22:26:35,351 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2025-03-13 22:26:35,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:35,352 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] [2025-03-13 22:26:35,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:26:35,352 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:35,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash -965846821, now seen corresponding path program 1 times [2025-03-13 22:26:35,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:35,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882974522] [2025-03-13 22:26:35,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:35,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-13 22:26:35,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-13 22:26:35,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:35,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:35,396 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:35,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:35,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882974522] [2025-03-13 22:26:35,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882974522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:35,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:35,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16067144] [2025-03-13 22:26:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:35,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:35,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:35,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:35,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:35,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:35,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:35,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,125 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2025-03-13 22:26:36,126 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2025-03-13 22:26:36,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41670 event pairs, 54 based on Foata normal form. 0/4545 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2025-03-13 22:26:36,164 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-13 22:26:36,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2025-03-13 22:26:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-03-13 22:26:36,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-03-13 22:26:36,167 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2025-03-13 22:26:36,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2025-03-13 22:26:36,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:36,173 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2025-03-13 22:26:36,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2025-03-13 22:26:36,174 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-03-13 22:26:36,174 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2025-03-13 22:26:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 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,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,175 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:36,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:26:36,175 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1242351820, now seen corresponding path program 1 times [2025-03-13 22:26:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188128226] [2025-03-13 22:26:36,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-13 22:26:36,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-13 22:26:36,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,217 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:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188128226] [2025-03-13 22:26:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188128226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941780168] [2025-03-13 22:26:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:36,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:36,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 846 [2025-03-13 22:26:36,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 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,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 846 [2025-03-13 22:26:36,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:36,774 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2025-03-13 22:26:36,774 INFO L125 PetriNetUnfolderBase]: For 435/689 co-relation queries the response was YES. [2025-03-13 22:26:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 435/689 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29289 event pairs, 46 based on Foata normal form. 1/3569 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2025-03-13 22:26:36,797 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-03-13 22:26:36,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2025-03-13 22:26:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2025-03-13 22:26:36,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9026792750197006 [2025-03-13 22:26:36,800 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2025-03-13 22:26:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2025-03-13 22:26:36,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:36,806 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2025-03-13 22:26:36,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2025-03-13 22:26:36,807 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-13 22:26:36,807 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2025-03-13 22:26:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 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,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:36,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:26:36,808 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -958432898, now seen corresponding path program 1 times [2025-03-13 22:26:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-13 22:26:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:36,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-13 22:26:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-13 22:26:36,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:36,855 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:36,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-13 22:26:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369736712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:36,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:36,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083767439] [2025-03-13 22:26:36,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:36,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:36,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:36,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:36,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-13 22:26:36,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 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,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:36,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-13 22:26:36,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:37,834 INFO L124 PetriNetUnfolderBase]: 563/7838 cut-off events. [2025-03-13 22:26:37,835 INFO L125 PetriNetUnfolderBase]: For 844/890 co-relation queries the response was YES. [2025-03-13 22:26:37,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 7838 events. 563/7838 cut-off events. For 844/890 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67513 event pairs, 82 based on Foata normal form. 0/6480 useless extension candidates. Maximal degree in co-relation 9036. Up to 306 conditions per place. [2025-03-13 22:26:37,887 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2025-03-13 22:26:37,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2025-03-13 22:26:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2025-03-13 22:26:37,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022852639873916 [2025-03-13 22:26:37,889 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2025-03-13 22:26:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2025-03-13 22:26:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:37,895 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2025-03-13 22:26:37,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2025-03-13 22:26:37,896 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-03-13 22:26:37,896 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2025-03-13 22:26:37,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 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,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:37,897 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:26:37,898 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1251288977, now seen corresponding path program 1 times [2025-03-13 22:26:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182801468] [2025-03-13 22:26:37,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:37,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-13 22:26:37,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-13 22:26:37,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:37,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:37,966 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:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182801468] [2025-03-13 22:26:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182801468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:37,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358673613] [2025-03-13 22:26:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:37,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:37,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:37,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-03-13 22:26:37,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 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,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:37,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-03-13 22:26:37,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:39,618 INFO L124 PetriNetUnfolderBase]: 802/11926 cut-off events. [2025-03-13 22:26:39,618 INFO L125 PetriNetUnfolderBase]: For 1117/1431 co-relation queries the response was YES. [2025-03-13 22:26:39,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 11926 events. 802/11926 cut-off events. For 1117/1431 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 115411 event pairs, 89 based on Foata normal form. 2/9815 useless extension candidates. Maximal degree in co-relation 13549. Up to 609 conditions per place. [2025-03-13 22:26:39,713 INFO L140 encePairwiseOnDemand]: 842/846 looper letters, 36 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2025-03-13 22:26:39,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 719 transitions, 1639 flow [2025-03-13 22:26:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2025-03-13 22:26:39,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9014972419227738 [2025-03-13 22:26:39,715 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2288 transitions. [2025-03-13 22:26:39,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 719 transitions, 1639 flow [2025-03-13 22:26:39,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 719 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:39,722 INFO L231 Difference]: Finished difference. Result has 696 places, 705 transitions, 1500 flow [2025-03-13 22:26:39,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=696, PETRI_TRANSITIONS=705} [2025-03-13 22:26:39,723 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -102 predicate places. [2025-03-13 22:26:39,723 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 705 transitions, 1500 flow [2025-03-13 22:26:39,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 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:39,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:39,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:26:39,725 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 270906938, now seen corresponding path program 1 times [2025-03-13 22:26:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385054573] [2025-03-13 22:26:39,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:39,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-13 22:26:39,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-13 22:26:39,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:39,772 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:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385054573] [2025-03-13 22:26:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385054573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304763294] [2025-03-13 22:26:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:39,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:39,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:39,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:39,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-03-13 22:26:39,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 705 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 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:39,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:39,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-03-13 22:26:39,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:41,498 INFO L124 PetriNetUnfolderBase]: 1392/12996 cut-off events. [2025-03-13 22:26:41,499 INFO L125 PetriNetUnfolderBase]: For 2108/2200 co-relation queries the response was YES. [2025-03-13 22:26:41,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16433 conditions, 12996 events. 1392/12996 cut-off events. For 2108/2200 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 126365 event pairs, 139 based on Foata normal form. 5/10992 useless extension candidates. Maximal degree in co-relation 16315. Up to 1242 conditions per place. [2025-03-13 22:26:41,556 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2025-03-13 22:26:41,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1627 flow [2025-03-13 22:26:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2025-03-13 22:26:41,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8940110323089047 [2025-03-13 22:26:41,558 INFO L175 Difference]: Start difference. First operand has 696 places, 705 transitions, 1500 flow. Second operand 3 states and 2269 transitions. [2025-03-13 22:26:41,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1627 flow [2025-03-13 22:26:41,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:41,567 INFO L231 Difference]: Finished difference. Result has 694 places, 696 transitions, 1481 flow [2025-03-13 22:26:41,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=694, PETRI_TRANSITIONS=696} [2025-03-13 22:26:41,568 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-03-13 22:26:41,568 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 1481 flow [2025-03-13 22:26:41,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 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,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:41,569 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, 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,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:26:41,570 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1809647221, now seen corresponding path program 1 times [2025-03-13 22:26:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:41,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485090517] [2025-03-13 22:26:41,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:41,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-13 22:26:41,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-13 22:26:41,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:41,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:41,732 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:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485090517] [2025-03-13 22:26:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485090517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359147535] [2025-03-13 22:26:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:41,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:41,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:41,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:41,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-03-13 22:26:41,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 696 transitions, 1481 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 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,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:41,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-03-13 22:26:41,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:43,800 INFO L124 PetriNetUnfolderBase]: 745/11284 cut-off events. [2025-03-13 22:26:43,800 INFO L125 PetriNetUnfolderBase]: For 1367/1536 co-relation queries the response was YES. [2025-03-13 22:26:43,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13296 conditions, 11284 events. 745/11284 cut-off events. For 1367/1536 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 107261 event pairs, 100 based on Foata normal form. 0/9466 useless extension candidates. Maximal degree in co-relation 13176. Up to 271 conditions per place. [2025-03-13 22:26:43,878 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2025-03-13 22:26:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 713 transitions, 1669 flow [2025-03-13 22:26:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:26:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:26:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2025-03-13 22:26:43,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-13 22:26:43,884 INFO L175 Difference]: Start difference. First operand has 694 places, 696 transitions, 1481 flow. Second operand 4 states and 3036 transitions. [2025-03-13 22:26:43,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 713 transitions, 1669 flow [2025-03-13 22:26:43,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:43,891 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2025-03-13 22:26:43,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2025-03-13 22:26:43,892 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-03-13 22:26:43,892 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2025-03-13 22:26:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 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,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:43,892 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, 1, 1, 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,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:26:43,893 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:43,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1814665108, now seen corresponding path program 1 times [2025-03-13 22:26:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:43,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750246451] [2025-03-13 22:26:43,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:43,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-13 22:26:43,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-13 22:26:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:43,946 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:43,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750246451] [2025-03-13 22:26:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750246451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:43,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056902850] [2025-03-13 22:26:43,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:43,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:43,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:43,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 846 [2025-03-13 22:26:43,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:43,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 846 [2025-03-13 22:26:43,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:46,259 INFO L124 PetriNetUnfolderBase]: 2838/15314 cut-off events. [2025-03-13 22:26:46,259 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2025-03-13 22:26:46,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23253 conditions, 15314 events. 2838/15314 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 154801 event pairs, 112 based on Foata normal form. 0/13633 useless extension candidates. Maximal degree in co-relation 23132. Up to 3602 conditions per place. [2025-03-13 22:26:46,357 INFO L140 encePairwiseOnDemand]: 832/846 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2025-03-13 22:26:46,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2025-03-13 22:26:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-03-13 22:26:46,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778565799842396 [2025-03-13 22:26:46,359 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2025-03-13 22:26:46,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2025-03-13 22:26:46,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:26:46,366 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2025-03-13 22:26:46,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2025-03-13 22:26:46,367 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2025-03-13 22:26:46,367 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2025-03-13 22:26:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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:46,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:46,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:26:46,368 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1877403065, now seen corresponding path program 1 times [2025-03-13 22:26:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-03-13 22:26:46,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:46,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-13 22:26:46,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-13 22:26:46,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:46,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:46,628 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:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-03-13 22:26:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490196702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:46,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:46,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 22:26:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583236919] [2025-03-13 22:26:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 22:26:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:46,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 22:26:46,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-13 22:26:46,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 846 [2025-03-13 22:26:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 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:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 846 [2025-03-13 22:26:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:48,417 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2025-03-13 22:26:48,417 INFO L125 PetriNetUnfolderBase]: For 1914/2695 co-relation queries the response was YES. [2025-03-13 22:26:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1914/2695 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 56997 event pairs, 269 based on Foata normal form. 20/6444 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2025-03-13 22:26:48,510 INFO L140 encePairwiseOnDemand]: 835/846 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2025-03-13 22:26:48,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2025-03-13 22:26:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:26:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:26:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2025-03-13 22:26:48,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565799842395587 [2025-03-13 22:26:48,514 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2025-03-13 22:26:48,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2025-03-13 22:26:48,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:48,520 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2025-03-13 22:26:48,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2025-03-13 22:26:48,521 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-03-13 22:26:48,521 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2025-03-13 22:26:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 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,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:48,522 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, 1, 1, 1, 1, 1, 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:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:26:48,523 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1863562498, now seen corresponding path program 1 times [2025-03-13 22:26:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:48,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774224949] [2025-03-13 22:26:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:48,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-13 22:26:48,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-13 22:26:48,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:48,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:48,916 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:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774224949] [2025-03-13 22:26:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774224949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:48,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:48,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285174136] [2025-03-13 22:26:48,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:48,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:48,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:48,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:49,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 846 [2025-03-13 22:26:49,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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:49,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:49,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 846 [2025-03-13 22:26:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:54,625 INFO L124 PetriNetUnfolderBase]: 6432/29512 cut-off events. [2025-03-13 22:26:54,626 INFO L125 PetriNetUnfolderBase]: For 10817/10821 co-relation queries the response was YES. [2025-03-13 22:26:54,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46828 conditions, 29512 events. 6432/29512 cut-off events. For 10817/10821 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 324458 event pairs, 3864 based on Foata normal form. 0/26341 useless extension candidates. Maximal degree in co-relation 46701. Up to 9066 conditions per place. [2025-03-13 22:26:54,810 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2025-03-13 22:26:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2025-03-13 22:26:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2025-03-13 22:26:54,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8400315208825847 [2025-03-13 22:26:54,814 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2025-03-13 22:26:54,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2025-03-13 22:26:54,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:54,824 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2025-03-13 22:26:54,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2025-03-13 22:26:54,825 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2025-03-13 22:26:54,825 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2025-03-13 22:26:54,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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:54,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:54,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:26:54,826 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 261836112, now seen corresponding path program 1 times [2025-03-13 22:26:54,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:54,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784987546] [2025-03-13 22:26:54,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-13 22:26:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-13 22:26:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:54,885 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:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784987546] [2025-03-13 22:26:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784987546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011597827] [2025-03-13 22:26:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:54,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:54,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:54,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-13 22:26:54,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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:54,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:54,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-13 22:26:54,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,403 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2025-03-13 22:26:58,403 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2025-03-13 22:26:58,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212892 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2025-03-13 22:26:58,515 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2025-03-13 22:26:58,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2025-03-13 22:26:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2025-03-13 22:26:58,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979511426319937 [2025-03-13 22:26:58,517 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2025-03-13 22:26:58,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2025-03-13 22:26:58,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:58,523 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2025-03-13 22:26:58,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2025-03-13 22:26:58,524 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2025-03-13 22:26:58,524 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2025-03-13 22:26:58,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:26:58,525 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:26:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1337847785, now seen corresponding path program 1 times [2025-03-13 22:26:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434990967] [2025-03-13 22:26:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-13 22:26:58,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-13 22:26:58,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,933 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:58,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434990967] [2025-03-13 22:26:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434990967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229926031] [2025-03-13 22:26:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:58,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:59,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-13 22:26:59,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 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,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:59,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-13 22:26:59,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:00,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2723] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_785 4)) (.cse10 (* v_~size1~0_499 4)) (.cse15 (* v_~state11~0_195 4))) (let ((.cse1 (not |v_thread1_#t~short2#1_388|)) (.cse2 (select |v_#race_1775| v_~produce~0.base_115)) (.cse4 (+ v_~produce~0.offset_115 .cse15 1)) (.cse3 (+ 2 v_~produce~0.offset_115 .cse15)) (.cse5 (+ 3 v_~produce~0.offset_115 .cse15)) (.cse6 (+ v_~produce~0.offset_115 .cse15)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_453)) (.cse14 (not |v_thread1_#t~short1#1_344|)) (.cse13 (+ v_~front1~0_785 v_~size1~0_499))) (and (= |v_#race~front1~0_1604| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (let ((.cse0 (= |v_#race~state11~0_447| 0))) (or (and .cse0 .cse1 (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) (= |v_thread1_#t~short2#1_387| |v_thread1_#t~short2#1_388|)) (and (= |v_#race~n_produce~0_229| 0) .cse0 |v_thread1_#t~short2#1_388| (or (and |v_thread1_#t~short2#1_387| (< v_~state11~0_195 v_~n_produce~0_66)) (and (not |v_thread1_#t~short2#1_387|) (<= v_~n_produce~0_66 v_~state11~0_195)))))) (or (and |v_thread1_#t~short2#1_388| (<= 0 v_~state11~0_195)) (and .cse1 (< v_~state11~0_195 0))) (= (select .cse2 .cse3) 0) (= |v_#race~state11~0_437| 0) (= (select .cse2 .cse4) 0) (= 0 (select .cse2 .cse5)) (not (= (ite |v_thread1_#t~short2#1_387| 1 0) 0)) (= (select .cse2 .cse6) 0) (= |v_#race_1775| (let ((.cse7 (store |v_#race_1776| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1776| v_~queue1~0.base_453) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_453 1) 0) (+ 2 .cse9 .cse10 v_~queue1~0.offset_453) 0) (+ 3 .cse9 .cse10 v_~queue1~0.offset_453) 0)))) (store .cse7 v_~produce~0.base_115 (store (store (store (store (select .cse7 v_~produce~0.base_115) .cse6 0) .cse4 0) .cse3 0) .cse5 0)))) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_115) .cse6) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse8)) 1 0) 0)) (= |v_#race~produce~0_172| 0) (= v_~size1~0_498 (+ v_~size1~0_499 1)) (= |v_#race~queue1~0_976| 0) (let ((.cse11 (= |v_#race~front1~0_1638| 0)) (.cse12 (= |v_#race~size1~0_833| 0))) (or (and (= |v_#race~n_queue~0_595| 0) .cse11 |v_thread1_#t~short1#1_344| .cse12 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse13)) (and (< .cse13 v_~n_queue~0_174) |v_thread1_#t~short1#1_343|))) (and .cse11 .cse12 (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse14))) (or (and (< .cse13 0) .cse14) (and |v_thread1_#t~short1#1_344| (<= 0 .cse13)))))) InVars {#race=|v_#race_1776|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_499, ~produce~0.base=v_~produce~0.base_115, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_115, #race~size1~0=|v_#race~size1~0_799|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1604|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1775|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_498, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_387|, |v_#race~size1~0_833|, |v_#race~front1~0_1638|, |v_thread1_#t~short2#1_388|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][559], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 607#L83true, 860#(= |#race~n_produce~0| 0)]) [2025-03-13 22:27:00,818 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-03-13 22:27:00,818 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-03-13 22:27:00,818 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-13 22:27:00,818 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-13 22:27:00,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2723] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_785 4)) (.cse10 (* v_~size1~0_499 4)) (.cse15 (* v_~state11~0_195 4))) (let ((.cse1 (not |v_thread1_#t~short2#1_388|)) (.cse2 (select |v_#race_1775| v_~produce~0.base_115)) (.cse4 (+ v_~produce~0.offset_115 .cse15 1)) (.cse3 (+ 2 v_~produce~0.offset_115 .cse15)) (.cse5 (+ 3 v_~produce~0.offset_115 .cse15)) (.cse6 (+ v_~produce~0.offset_115 .cse15)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_453)) (.cse14 (not |v_thread1_#t~short1#1_344|)) (.cse13 (+ v_~front1~0_785 v_~size1~0_499))) (and (= |v_#race~front1~0_1604| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (let ((.cse0 (= |v_#race~state11~0_447| 0))) (or (and .cse0 .cse1 (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) (= |v_thread1_#t~short2#1_387| |v_thread1_#t~short2#1_388|)) (and (= |v_#race~n_produce~0_229| 0) .cse0 |v_thread1_#t~short2#1_388| (or (and |v_thread1_#t~short2#1_387| (< v_~state11~0_195 v_~n_produce~0_66)) (and (not |v_thread1_#t~short2#1_387|) (<= v_~n_produce~0_66 v_~state11~0_195)))))) (or (and |v_thread1_#t~short2#1_388| (<= 0 v_~state11~0_195)) (and .cse1 (< v_~state11~0_195 0))) (= (select .cse2 .cse3) 0) (= |v_#race~state11~0_437| 0) (= (select .cse2 .cse4) 0) (= 0 (select .cse2 .cse5)) (not (= (ite |v_thread1_#t~short2#1_387| 1 0) 0)) (= (select .cse2 .cse6) 0) (= |v_#race_1775| (let ((.cse7 (store |v_#race_1776| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1776| v_~queue1~0.base_453) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_453 1) 0) (+ 2 .cse9 .cse10 v_~queue1~0.offset_453) 0) (+ 3 .cse9 .cse10 v_~queue1~0.offset_453) 0)))) (store .cse7 v_~produce~0.base_115 (store (store (store (store (select .cse7 v_~produce~0.base_115) .cse6 0) .cse4 0) .cse3 0) .cse5 0)))) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_115) .cse6) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse8)) 1 0) 0)) (= |v_#race~produce~0_172| 0) (= v_~size1~0_498 (+ v_~size1~0_499 1)) (= |v_#race~queue1~0_976| 0) (let ((.cse11 (= |v_#race~front1~0_1638| 0)) (.cse12 (= |v_#race~size1~0_833| 0))) (or (and (= |v_#race~n_queue~0_595| 0) .cse11 |v_thread1_#t~short1#1_344| .cse12 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse13)) (and (< .cse13 v_~n_queue~0_174) |v_thread1_#t~short1#1_343|))) (and .cse11 .cse12 (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse14))) (or (and (< .cse13 0) .cse14) (and |v_thread1_#t~short1#1_344| (<= 0 .cse13)))))) InVars {#race=|v_#race_1776|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_499, ~produce~0.base=v_~produce~0.base_115, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_115, #race~size1~0=|v_#race~size1~0_799|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1604|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1775|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_498, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_387|, |v_#race~size1~0_833|, |v_#race~front1~0_1638|, |v_thread1_#t~short2#1_388|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][559], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-13 22:27:00,825 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-03-13 22:27:00,825 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-03-13 22:27:00,825 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-13 22:27:00,825 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-03-13 22:27:01,010 INFO L124 PetriNetUnfolderBase]: 678/8521 cut-off events. [2025-03-13 22:27:01,010 INFO L125 PetriNetUnfolderBase]: For 1741/2167 co-relation queries the response was YES. [2025-03-13 22:27:01,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 8521 events. 678/8521 cut-off events. For 1741/2167 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 70532 event pairs, 114 based on Foata normal form. 53/7656 useless extension candidates. Maximal degree in co-relation 10603. Up to 464 conditions per place. [2025-03-13 22:27:01,093 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 79 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-03-13 22:27:01,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 723 transitions, 1896 flow [2025-03-13 22:27:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2025-03-13 22:27:01,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727344365642238 [2025-03-13 22:27:01,096 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 6 states and 4430 transitions. [2025-03-13 22:27:01,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 723 transitions, 1896 flow [2025-03-13 22:27:01,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 723 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:01,102 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2025-03-13 22:27:01,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=691, PETRI_TRANSITIONS=687} [2025-03-13 22:27:01,103 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-03-13 22:27:01,103 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2025-03-13 22:27:01,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 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:01,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:01,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:27:01,104 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash -992910796, now seen corresponding path program 1 times [2025-03-13 22:27:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291531043] [2025-03-13 22:27:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:01,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-13 22:27:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-13 22:27:01,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:01,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:01,534 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:27:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291531043] [2025-03-13 22:27:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291531043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980706123] [2025-03-13 22:27:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:01,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:01,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:01,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:01,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 846 [2025-03-13 22:27:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 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:01,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:01,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 846 [2025-03-13 22:27:01,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:06,209 INFO L124 PetriNetUnfolderBase]: 3558/18443 cut-off events. [2025-03-13 22:27:06,209 INFO L125 PetriNetUnfolderBase]: For 7268/7294 co-relation queries the response was YES. [2025-03-13 22:27:06,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29013 conditions, 18443 events. 3558/18443 cut-off events. For 7268/7294 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 186731 event pairs, 147 based on Foata normal form. 0/16999 useless extension candidates. Maximal degree in co-relation 28886. Up to 3586 conditions per place. [2025-03-13 22:27:06,362 INFO L140 encePairwiseOnDemand]: 838/846 looper letters, 101 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2025-03-13 22:27:06,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 732 transitions, 1980 flow [2025-03-13 22:27:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2025-03-13 22:27:06,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624901497241922 [2025-03-13 22:27:06,366 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 6 states and 4378 transitions. [2025-03-13 22:27:06,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 732 transitions, 1980 flow [2025-03-13 22:27:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 732 transitions, 1970 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:06,377 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1516 flow [2025-03-13 22:27:06,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1516, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2025-03-13 22:27:06,378 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2025-03-13 22:27:06,378 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1516 flow [2025-03-13 22:27:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 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:06,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:06,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:27:06,379 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1493167399, now seen corresponding path program 1 times [2025-03-13 22:27:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73628442] [2025-03-13 22:27:06,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:06,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-13 22:27:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-13 22:27:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:06,434 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:27:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73628442] [2025-03-13 22:27:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73628442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057413940] [2025-03-13 22:27:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:06,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-03-13 22:27:06,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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:06,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:06,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-03-13 22:27:06,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:08,021 INFO L124 PetriNetUnfolderBase]: 817/8647 cut-off events. [2025-03-13 22:27:08,021 INFO L125 PetriNetUnfolderBase]: For 2104/2479 co-relation queries the response was YES. [2025-03-13 22:27:08,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 8647 events. 817/8647 cut-off events. For 2104/2479 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 71905 event pairs, 270 based on Foata normal form. 14/7818 useless extension candidates. Maximal degree in co-relation 11337. Up to 789 conditions per place. [2025-03-13 22:27:08,108 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 35 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-03-13 22:27:08,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 692 transitions, 1642 flow [2025-03-13 22:27:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2025-03-13 22:27:08,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947990543735225 [2025-03-13 22:27:08,109 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1516 flow. Second operand 3 states and 2271 transitions. [2025-03-13 22:27:08,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 692 transitions, 1642 flow [2025-03-13 22:27:08,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:08,116 INFO L231 Difference]: Finished difference. Result has 684 places, 683 transitions, 1508 flow [2025-03-13 22:27:08,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=684, PETRI_TRANSITIONS=683} [2025-03-13 22:27:08,117 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -114 predicate places. [2025-03-13 22:27:08,117 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 683 transitions, 1508 flow [2025-03-13 22:27:08,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:08,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:27:08,118 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2036484145, now seen corresponding path program 1 times [2025-03-13 22:27:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:08,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114596179] [2025-03-13 22:27:08,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:08,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-13 22:27:08,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-13 22:27:08,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:08,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:08,474 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:27:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114596179] [2025-03-13 22:27:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114596179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:08,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449503001] [2025-03-13 22:27:08,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:08,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:08,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:08,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:08,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-13 22:27:08,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 683 transitions, 1508 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:08,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-13 22:27:08,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:11,118 INFO L124 PetriNetUnfolderBase]: 1570/10902 cut-off events. [2025-03-13 22:27:11,118 INFO L125 PetriNetUnfolderBase]: For 3396/3636 co-relation queries the response was YES. [2025-03-13 22:27:11,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 10902 events. 1570/10902 cut-off events. For 3396/3636 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 96593 event pairs, 192 based on Foata normal form. 1/9980 useless extension candidates. Maximal degree in co-relation 15457. Up to 682 conditions per place. [2025-03-13 22:27:11,236 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/726 dead transitions. [2025-03-13 22:27:11,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 726 transitions, 1902 flow [2025-03-13 22:27:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-13 22:27:11,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-03-13 22:27:11,239 INFO L175 Difference]: Start difference. First operand has 684 places, 683 transitions, 1508 flow. Second operand 6 states and 4438 transitions. [2025-03-13 22:27:11,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 726 transitions, 1902 flow [2025-03-13 22:27:11,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 726 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:11,247 INFO L231 Difference]: Finished difference. Result has 686 places, 682 transitions, 1512 flow [2025-03-13 22:27:11,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=686, PETRI_TRANSITIONS=682} [2025-03-13 22:27:11,248 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -112 predicate places. [2025-03-13 22:27:11,248 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 682 transitions, 1512 flow [2025-03-13 22:27:11,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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:11,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:11,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 22:27:11,249 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:11,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:11,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1249558329, now seen corresponding path program 1 times [2025-03-13 22:27:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:11,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511059735] [2025-03-13 22:27:11,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:11,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:11,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-13 22:27:11,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-13 22:27:11,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:11,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:11,636 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:27:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:11,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511059735] [2025-03-13 22:27:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511059735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48302466] [2025-03-13 22:27:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:11,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 846 [2025-03-13 22:27:11,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 682 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 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:11,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:11,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 846 [2025-03-13 22:27:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2723] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_785 4)) (.cse10 (* v_~size1~0_499 4)) (.cse15 (* v_~state11~0_195 4))) (let ((.cse1 (not |v_thread1_#t~short2#1_388|)) (.cse2 (select |v_#race_1775| v_~produce~0.base_115)) (.cse4 (+ v_~produce~0.offset_115 .cse15 1)) (.cse3 (+ 2 v_~produce~0.offset_115 .cse15)) (.cse5 (+ 3 v_~produce~0.offset_115 .cse15)) (.cse6 (+ v_~produce~0.offset_115 .cse15)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_453)) (.cse14 (not |v_thread1_#t~short1#1_344|)) (.cse13 (+ v_~front1~0_785 v_~size1~0_499))) (and (= |v_#race~front1~0_1604| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (let ((.cse0 (= |v_#race~state11~0_447| 0))) (or (and .cse0 .cse1 (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) (= |v_thread1_#t~short2#1_387| |v_thread1_#t~short2#1_388|)) (and (= |v_#race~n_produce~0_229| 0) .cse0 |v_thread1_#t~short2#1_388| (or (and |v_thread1_#t~short2#1_387| (< v_~state11~0_195 v_~n_produce~0_66)) (and (not |v_thread1_#t~short2#1_387|) (<= v_~n_produce~0_66 v_~state11~0_195)))))) (or (and |v_thread1_#t~short2#1_388| (<= 0 v_~state11~0_195)) (and .cse1 (< v_~state11~0_195 0))) (= (select .cse2 .cse3) 0) (= |v_#race~state11~0_437| 0) (= (select .cse2 .cse4) 0) (= 0 (select .cse2 .cse5)) (not (= (ite |v_thread1_#t~short2#1_387| 1 0) 0)) (= (select .cse2 .cse6) 0) (= |v_#race_1775| (let ((.cse7 (store |v_#race_1776| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1776| v_~queue1~0.base_453) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_453 1) 0) (+ 2 .cse9 .cse10 v_~queue1~0.offset_453) 0) (+ 3 .cse9 .cse10 v_~queue1~0.offset_453) 0)))) (store .cse7 v_~produce~0.base_115 (store (store (store (store (select .cse7 v_~produce~0.base_115) .cse6 0) .cse4 0) .cse3 0) .cse5 0)))) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_115) .cse6) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse8)) 1 0) 0)) (= |v_#race~produce~0_172| 0) (= v_~size1~0_498 (+ v_~size1~0_499 1)) (= |v_#race~queue1~0_976| 0) (let ((.cse11 (= |v_#race~front1~0_1638| 0)) (.cse12 (= |v_#race~size1~0_833| 0))) (or (and (= |v_#race~n_queue~0_595| 0) .cse11 |v_thread1_#t~short1#1_344| .cse12 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse13)) (and (< .cse13 v_~n_queue~0_174) |v_thread1_#t~short1#1_343|))) (and .cse11 .cse12 (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse14))) (or (and (< .cse13 0) .cse14) (and |v_thread1_#t~short1#1_344| (<= 0 .cse13)))))) InVars {#race=|v_#race_1776|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_499, ~produce~0.base=v_~produce~0.base_115, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_115, #race~size1~0=|v_#race~size1~0_799|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1604|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1775|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_498, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_387|, |v_#race~size1~0_833|, |v_#race~front1~0_1638|, |v_thread1_#t~short2#1_388|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 714#L135-1true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 909#true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0), 607#L83true]) [2025-03-13 22:27:15,139 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-03-13 22:27:15,139 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-03-13 22:27:15,139 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-13 22:27:15,139 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-03-13 22:27:15,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2723] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_785 4)) (.cse10 (* v_~size1~0_499 4)) (.cse15 (* v_~state11~0_195 4))) (let ((.cse1 (not |v_thread1_#t~short2#1_388|)) (.cse2 (select |v_#race_1775| v_~produce~0.base_115)) (.cse4 (+ v_~produce~0.offset_115 .cse15 1)) (.cse3 (+ 2 v_~produce~0.offset_115 .cse15)) (.cse5 (+ 3 v_~produce~0.offset_115 .cse15)) (.cse6 (+ v_~produce~0.offset_115 .cse15)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_453)) (.cse14 (not |v_thread1_#t~short1#1_344|)) (.cse13 (+ v_~front1~0_785 v_~size1~0_499))) (and (= |v_#race~front1~0_1604| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (let ((.cse0 (= |v_#race~state11~0_447| 0))) (or (and .cse0 .cse1 (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) (= |v_thread1_#t~short2#1_387| |v_thread1_#t~short2#1_388|)) (and (= |v_#race~n_produce~0_229| 0) .cse0 |v_thread1_#t~short2#1_388| (or (and |v_thread1_#t~short2#1_387| (< v_~state11~0_195 v_~n_produce~0_66)) (and (not |v_thread1_#t~short2#1_387|) (<= v_~n_produce~0_66 v_~state11~0_195)))))) (or (and |v_thread1_#t~short2#1_388| (<= 0 v_~state11~0_195)) (and .cse1 (< v_~state11~0_195 0))) (= (select .cse2 .cse3) 0) (= |v_#race~state11~0_437| 0) (= (select .cse2 .cse4) 0) (= 0 (select .cse2 .cse5)) (not (= (ite |v_thread1_#t~short2#1_387| 1 0) 0)) (= (select .cse2 .cse6) 0) (= |v_#race_1775| (let ((.cse7 (store |v_#race_1776| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1776| v_~queue1~0.base_453) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_453 1) 0) (+ 2 .cse9 .cse10 v_~queue1~0.offset_453) 0) (+ 3 .cse9 .cse10 v_~queue1~0.offset_453) 0)))) (store .cse7 v_~produce~0.base_115 (store (store (store (store (select .cse7 v_~produce~0.base_115) .cse6 0) .cse4 0) .cse3 0) .cse5 0)))) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_115) .cse6) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse8)) 1 0) 0)) (= |v_#race~produce~0_172| 0) (= v_~size1~0_498 (+ v_~size1~0_499 1)) (= |v_#race~queue1~0_976| 0) (let ((.cse11 (= |v_#race~front1~0_1638| 0)) (.cse12 (= |v_#race~size1~0_833| 0))) (or (and (= |v_#race~n_queue~0_595| 0) .cse11 |v_thread1_#t~short1#1_344| .cse12 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse13)) (and (< .cse13 v_~n_queue~0_174) |v_thread1_#t~short1#1_343|))) (and .cse11 .cse12 (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse14))) (or (and (< .cse13 0) .cse14) (and |v_thread1_#t~short1#1_344| (<= 0 .cse13)))))) InVars {#race=|v_#race_1776|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_499, ~produce~0.base=v_~produce~0.base_115, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_115, #race~size1~0=|v_#race~size1~0_799|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1604|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1775|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_498, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_387|, |v_#race~size1~0_833|, |v_#race~front1~0_1638|, |v_thread1_#t~short2#1_388|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 714#L135-1true, 896#(= |#race~consume~0| 0), 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-13 22:27:15,152 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-03-13 22:27:15,152 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-13 22:27:15,152 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-03-13 22:27:15,152 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-03-13 22:27:15,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2723] L52-->L58-12: Formula: (let ((.cse9 (* v_~front1~0_785 4)) (.cse10 (* v_~size1~0_499 4)) (.cse15 (* v_~state11~0_195 4))) (let ((.cse1 (not |v_thread1_#t~short2#1_388|)) (.cse2 (select |v_#race_1775| v_~produce~0.base_115)) (.cse4 (+ v_~produce~0.offset_115 .cse15 1)) (.cse3 (+ 2 v_~produce~0.offset_115 .cse15)) (.cse5 (+ 3 v_~produce~0.offset_115 .cse15)) (.cse6 (+ v_~produce~0.offset_115 .cse15)) (.cse8 (+ .cse9 .cse10 v_~queue1~0.offset_453)) (.cse14 (not |v_thread1_#t~short1#1_344|)) (.cse13 (+ v_~front1~0_785 v_~size1~0_499))) (and (= |v_#race~front1~0_1604| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (let ((.cse0 (= |v_#race~state11~0_447| 0))) (or (and .cse0 .cse1 (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) (= |v_thread1_#t~short2#1_387| |v_thread1_#t~short2#1_388|)) (and (= |v_#race~n_produce~0_229| 0) .cse0 |v_thread1_#t~short2#1_388| (or (and |v_thread1_#t~short2#1_387| (< v_~state11~0_195 v_~n_produce~0_66)) (and (not |v_thread1_#t~short2#1_387|) (<= v_~n_produce~0_66 v_~state11~0_195)))))) (or (and |v_thread1_#t~short2#1_388| (<= 0 v_~state11~0_195)) (and .cse1 (< v_~state11~0_195 0))) (= (select .cse2 .cse3) 0) (= |v_#race~state11~0_437| 0) (= (select .cse2 .cse4) 0) (= 0 (select .cse2 .cse5)) (not (= (ite |v_thread1_#t~short2#1_387| 1 0) 0)) (= (select .cse2 .cse6) 0) (= |v_#race_1775| (let ((.cse7 (store |v_#race_1776| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1776| v_~queue1~0.base_453) .cse8 0) (+ .cse9 .cse10 v_~queue1~0.offset_453 1) 0) (+ 2 .cse9 .cse10 v_~queue1~0.offset_453) 0) (+ 3 .cse9 .cse10 v_~queue1~0.offset_453) 0)))) (store .cse7 v_~produce~0.base_115 (store (store (store (store (select .cse7 v_~produce~0.base_115) .cse6 0) .cse4 0) .cse3 0) .cse5 0)))) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_115) .cse6) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse8)) 1 0) 0)) (= |v_#race~produce~0_172| 0) (= v_~size1~0_498 (+ v_~size1~0_499 1)) (= |v_#race~queue1~0_976| 0) (let ((.cse11 (= |v_#race~front1~0_1638| 0)) (.cse12 (= |v_#race~size1~0_833| 0))) (or (and (= |v_#race~n_queue~0_595| 0) .cse11 |v_thread1_#t~short1#1_344| .cse12 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse13)) (and (< .cse13 v_~n_queue~0_174) |v_thread1_#t~short1#1_343|))) (and .cse11 .cse12 (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse14))) (or (and (< .cse13 0) .cse14) (and |v_thread1_#t~short1#1_344| (<= 0 .cse13)))))) InVars {#race=|v_#race_1776|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_499, ~produce~0.base=v_~produce~0.base_115, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_115, #race~size1~0=|v_#race~size1~0_799|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1604|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1775|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_195, ~size1~0=v_~size1~0_498, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_115, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_387|, |v_#race~size1~0_833|, |v_#race~front1~0_1638|, |v_thread1_#t~short2#1_388|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][536], [Black: 894#true, 678#L58-12true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, 911#(= |#race~update~0| 0), Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 714#L135-1true, 559#L73true, 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), 7#L95-28true, Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-03-13 22:27:15,263 INFO L294 olderBase$Statistics]: this new event has 530 ancestors and is cut-off event [2025-03-13 22:27:15,263 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-03-13 22:27:15,263 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2025-03-13 22:27:15,263 INFO L297 olderBase$Statistics]: existing Event has 530 ancestors and is cut-off event [2025-03-13 22:27:15,406 INFO L124 PetriNetUnfolderBase]: 2318/17388 cut-off events. [2025-03-13 22:27:15,406 INFO L125 PetriNetUnfolderBase]: For 4391/4542 co-relation queries the response was YES. [2025-03-13 22:27:15,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 17388 events. 2318/17388 cut-off events. For 4391/4542 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 180044 event pairs, 496 based on Foata normal form. 1/15828 useless extension candidates. Maximal degree in co-relation 24063. Up to 1506 conditions per place. [2025-03-13 22:27:15,517 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 86 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2025-03-13 22:27:15,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 725 transitions, 1904 flow [2025-03-13 22:27:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2025-03-13 22:27:15,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752955082742316 [2025-03-13 22:27:15,519 INFO L175 Difference]: Start difference. First operand has 686 places, 682 transitions, 1512 flow. Second operand 6 states and 4443 transitions. [2025-03-13 22:27:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 725 transitions, 1904 flow [2025-03-13 22:27:15,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 725 transitions, 1894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:15,529 INFO L231 Difference]: Finished difference. Result has 685 places, 681 transitions, 1510 flow [2025-03-13 22:27:15,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=681} [2025-03-13 22:27:15,530 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -113 predicate places. [2025-03-13 22:27:15,530 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 681 transitions, 1510 flow [2025-03-13 22:27:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 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,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-13 22:27:15,531 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:15,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 159859579, now seen corresponding path program 1 times [2025-03-13 22:27:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637570848] [2025-03-13 22:27:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-13 22:27:15,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-13 22:27:15,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,583 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:27:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637570848] [2025-03-13 22:27:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637570848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904878273] [2025-03-13 22:27:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:15,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:15,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-03-13 22:27:15,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 681 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 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,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-03-13 22:27:15,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:18,869 INFO L124 PetriNetUnfolderBase]: 2113/17881 cut-off events. [2025-03-13 22:27:18,869 INFO L125 PetriNetUnfolderBase]: For 3818/3914 co-relation queries the response was YES. [2025-03-13 22:27:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 17881 events. 2113/17881 cut-off events. For 3818/3914 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 187368 event pairs, 699 based on Foata normal form. 3/16372 useless extension candidates. Maximal degree in co-relation 23908. Up to 1921 conditions per place. [2025-03-13 22:27:19,044 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 34 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2025-03-13 22:27:19,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 691 transitions, 1633 flow [2025-03-13 22:27:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-03-13 22:27:19,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-03-13 22:27:19,046 INFO L175 Difference]: Start difference. First operand has 685 places, 681 transitions, 1510 flow. Second operand 3 states and 2276 transitions. [2025-03-13 22:27:19,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 691 transitions, 1633 flow [2025-03-13 22:27:19,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 691 transitions, 1623 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:19,057 INFO L231 Difference]: Finished difference. Result has 681 places, 680 transitions, 1502 flow [2025-03-13 22:27:19,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=681, PETRI_TRANSITIONS=680} [2025-03-13 22:27:19,058 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-13 22:27:19,058 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 680 transitions, 1502 flow [2025-03-13 22:27:19,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 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:19,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-13 22:27:19,059 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1352689678, now seen corresponding path program 1 times [2025-03-13 22:27:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971936613] [2025-03-13 22:27:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-13 22:27:19,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-13 22:27:19,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:27:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971936613] [2025-03-13 22:27:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971936613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:19,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902726168] [2025-03-13 22:27:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:19,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:19,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:19,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-03-13 22:27:19,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 680 transitions, 1502 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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:19,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:19,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-03-13 22:27:19,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:21,826 INFO L124 PetriNetUnfolderBase]: 1115/8959 cut-off events. [2025-03-13 22:27:21,826 INFO L125 PetriNetUnfolderBase]: For 2443/2663 co-relation queries the response was YES. [2025-03-13 22:27:21,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 8959 events. 1115/8959 cut-off events. For 2443/2663 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 74615 event pairs, 147 based on Foata normal form. 1/8255 useless extension candidates. Maximal degree in co-relation 12261. Up to 562 conditions per place. [2025-03-13 22:27:21,909 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-03-13 22:27:21,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 723 transitions, 1896 flow [2025-03-13 22:27:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-03-13 22:27:21,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-03-13 22:27:21,912 INFO L175 Difference]: Start difference. First operand has 681 places, 680 transitions, 1502 flow. Second operand 6 states and 4438 transitions. [2025-03-13 22:27:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 723 transitions, 1896 flow [2025-03-13 22:27:21,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 723 transitions, 1892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:21,921 INFO L231 Difference]: Finished difference. Result has 683 places, 679 transitions, 1506 flow [2025-03-13 22:27:21,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1506, PETRI_PLACES=683, PETRI_TRANSITIONS=679} [2025-03-13 22:27:21,922 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -115 predicate places. [2025-03-13 22:27:21,922 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 679 transitions, 1506 flow [2025-03-13 22:27:21,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:21,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 22:27:21,923 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1066982192, now seen corresponding path program 1 times [2025-03-13 22:27:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322783377] [2025-03-13 22:27:21,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-13 22:27:21,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-13 22:27:21,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:21,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:27:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:21,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322783377] [2025-03-13 22:27:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322783377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606052967] [2025-03-13 22:27:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:21,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:21,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:21,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:22,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 846 [2025-03-13 22:27:22,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 679 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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:22,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:22,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 846 [2025-03-13 22:27:22,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:25,250 INFO L124 PetriNetUnfolderBase]: 2817/17591 cut-off events. [2025-03-13 22:27:25,250 INFO L125 PetriNetUnfolderBase]: For 5561/5629 co-relation queries the response was YES. [2025-03-13 22:27:25,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25836 conditions, 17591 events. 2817/17591 cut-off events. For 5561/5629 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 180923 event pairs, 1205 based on Foata normal form. 0/16104 useless extension candidates. Maximal degree in co-relation 25711. Up to 3365 conditions per place. [2025-03-13 22:27:25,331 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 43 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2025-03-13 22:27:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 689 transitions, 1647 flow [2025-03-13 22:27:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2263 transitions. [2025-03-13 22:27:25,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916469661150512 [2025-03-13 22:27:25,333 INFO L175 Difference]: Start difference. First operand has 683 places, 679 transitions, 1506 flow. Second operand 3 states and 2263 transitions. [2025-03-13 22:27:25,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 689 transitions, 1647 flow [2025-03-13 22:27:25,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 689 transitions, 1637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:25,340 INFO L231 Difference]: Finished difference. Result has 679 places, 678 transitions, 1498 flow [2025-03-13 22:27:25,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=679, PETRI_TRANSITIONS=678} [2025-03-13 22:27:25,341 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-03-13 22:27:25,341 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 678 transitions, 1498 flow [2025-03-13 22:27:25,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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:25,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:25,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-13 22:27:25,342 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:25,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1525885696, now seen corresponding path program 1 times [2025-03-13 22:27:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664375246] [2025-03-13 22:27:25,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:25,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-13 22:27:25,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-13 22:27:25,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:25,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:27:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:25,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664375246] [2025-03-13 22:27:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664375246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860281587] [2025-03-13 22:27:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:25,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:25,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:25,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-03-13 22:27:25,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 678 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 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:25,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:25,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-03-13 22:27:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:28,063 INFO L124 PetriNetUnfolderBase]: 986/15168 cut-off events. [2025-03-13 22:27:28,064 INFO L125 PetriNetUnfolderBase]: For 1642/1790 co-relation queries the response was YES. [2025-03-13 22:27:28,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17834 conditions, 15168 events. 986/15168 cut-off events. For 1642/1790 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 151524 event pairs, 81 based on Foata normal form. 5/14044 useless extension candidates. Maximal degree in co-relation 17710. Up to 635 conditions per place. [2025-03-13 22:27:28,138 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-03-13 22:27:28,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 692 transitions, 1642 flow [2025-03-13 22:27:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2025-03-13 22:27:28,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030732860520094 [2025-03-13 22:27:28,140 INFO L175 Difference]: Start difference. First operand has 679 places, 678 transitions, 1498 flow. Second operand 3 states and 2292 transitions. [2025-03-13 22:27:28,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 692 transitions, 1642 flow [2025-03-13 22:27:28,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 692 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:28,146 INFO L231 Difference]: Finished difference. Result has 679 places, 679 transitions, 1508 flow [2025-03-13 22:27:28,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=679, PETRI_TRANSITIONS=679} [2025-03-13 22:27:28,147 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-03-13 22:27:28,147 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 679 transitions, 1508 flow [2025-03-13 22:27:28,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 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:28,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:28,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-13 22:27:28,148 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:28,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1873100510, now seen corresponding path program 1 times [2025-03-13 22:27:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:28,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190339352] [2025-03-13 22:27:28,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:28,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-13 22:27:28,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-13 22:27:28,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-13 22:27:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190339352] [2025-03-13 22:27:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190339352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008613570] [2025-03-13 22:27:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:28,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:28,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:28,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:28,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 846 [2025-03-13 22:27:28,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 679 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 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:28,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:28,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 846 [2025-03-13 22:27:28,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:31,398 INFO L124 PetriNetUnfolderBase]: 1177/16318 cut-off events. [2025-03-13 22:27:31,398 INFO L125 PetriNetUnfolderBase]: For 2113/2261 co-relation queries the response was YES. [2025-03-13 22:27:31,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19644 conditions, 16318 events. 1177/16318 cut-off events. For 2113/2261 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 166283 event pairs, 222 based on Foata normal form. 1/15149 useless extension candidates. Maximal degree in co-relation 19517. Up to 767 conditions per place. [2025-03-13 22:27:31,545 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 56 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2025-03-13 22:27:31,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 690 transitions, 1679 flow [2025-03-13 22:27:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-03-13 22:27:31,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825847123719465 [2025-03-13 22:27:31,546 INFO L175 Difference]: Start difference. First operand has 679 places, 679 transitions, 1508 flow. Second operand 3 states and 2240 transitions. [2025-03-13 22:27:31,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 690 transitions, 1679 flow [2025-03-13 22:27:31,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 690 transitions, 1679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:31,553 INFO L231 Difference]: Finished difference. Result has 681 places, 679 transitions, 1516 flow [2025-03-13 22:27:31,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=681, PETRI_TRANSITIONS=679} [2025-03-13 22:27:31,554 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-13 22:27:31,554 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 679 transitions, 1516 flow [2025-03-13 22:27:31,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 0 states have call successors, (0), 0 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:31,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:31,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-13 22:27:31,554 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-03-13 22:27:31,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2054759844, now seen corresponding path program 1 times [2025-03-13 22:27:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647030843] [2025-03-13 22:27:31,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-13 22:27:31,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-13 22:27:31,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:31,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-13 22:27:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647030843] [2025-03-13 22:27:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647030843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:31,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665673730] [2025-03-13 22:27:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:31,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 846 [2025-03-13 22:27:31,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 679 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 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:31,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:31,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 846 [2025-03-13 22:27:31,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:35,127 INFO L124 PetriNetUnfolderBase]: 1572/21035 cut-off events. [2025-03-13 22:27:35,127 INFO L125 PetriNetUnfolderBase]: For 2704/2753 co-relation queries the response was YES. [2025-03-13 22:27:35,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25626 conditions, 21035 events. 1572/21035 cut-off events. For 2704/2753 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 222576 event pairs, 347 based on Foata normal form. 1/19685 useless extension candidates. Maximal degree in co-relation 25500. Up to 1134 conditions per place. [2025-03-13 22:27:35,233 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 0 selfloop transitions, 0 changer transitions 689/689 dead transitions. [2025-03-13 22:27:35,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 689 transitions, 1637 flow [2025-03-13 22:27:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-03-13 22:27:35,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-03-13 22:27:35,234 INFO L175 Difference]: Start difference. First operand has 681 places, 679 transitions, 1516 flow. Second operand 3 states and 2285 transitions. [2025-03-13 22:27:35,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 689 transitions, 1637 flow [2025-03-13 22:27:35,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 689 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:35,240 INFO L231 Difference]: Finished difference. Result has 681 places, 0 transitions, 0 flow [2025-03-13 22:27:35,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=681, PETRI_TRANSITIONS=0} [2025-03-13 22:27:35,241 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-03-13 22:27:35,241 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 0 transitions, 0 flow [2025-03-13 22:27:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 0 states have call successors, (0), 0 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:35,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (233 of 234 remaining) [2025-03-13 22:27:35,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (232 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (231 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (230 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (229 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (228 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (227 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (226 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (225 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (224 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (223 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (222 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (221 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (220 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (219 of 234 remaining) [2025-03-13 22:27:35,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (218 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (217 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (216 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (215 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (214 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (213 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (212 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (211 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (210 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (209 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (208 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (207 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (206 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (205 of 234 remaining) [2025-03-13 22:27:35,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (204 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (203 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (202 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (201 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (200 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (199 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (198 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (197 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (196 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (195 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (194 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (193 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (192 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (191 of 234 remaining) [2025-03-13 22:27:35,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (190 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (189 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (188 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (187 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (186 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (185 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (184 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (183 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (182 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (181 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (180 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (179 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (178 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (177 of 234 remaining) [2025-03-13 22:27:35,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (176 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (175 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (174 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (173 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (172 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (171 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (170 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (169 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (168 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (167 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (166 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (165 of 234 remaining) [2025-03-13 22:27:35,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (164 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (163 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (162 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (161 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (160 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (159 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (158 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (157 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (156 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (155 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (154 of 234 remaining) [2025-03-13 22:27:35,249 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (153 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (152 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (151 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (150 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (149 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (148 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (147 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (146 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (145 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (144 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (143 of 234 remaining) [2025-03-13 22:27:35,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (142 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (140 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (139 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (138 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (136 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (135 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (134 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (133 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (132 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (131 of 234 remaining) [2025-03-13 22:27:35,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (130 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (129 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (128 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (127 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (126 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (125 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (124 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (123 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (122 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (121 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (120 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (119 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (118 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (117 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (116 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (115 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (114 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (113 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (112 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (111 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (110 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (109 of 234 remaining) [2025-03-13 22:27:35,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (108 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (107 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (106 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (105 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (104 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (102 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (101 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 234 remaining) [2025-03-13 22:27:35,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (98 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (97 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (96 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (95 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (94 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (93 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (92 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (91 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (90 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (89 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (88 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (87 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (86 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (84 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (83 of 234 remaining) [2025-03-13 22:27:35,254 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (82 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (81 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (80 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (79 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (78 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (77 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (76 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (71 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (70 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (65 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (64 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (63 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (62 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (61 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (60 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (59 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (58 of 234 remaining) [2025-03-13 22:27:35,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (57 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (56 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (55 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (54 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (53 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (52 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (51 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (50 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (49 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (47 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (44 of 234 remaining) [2025-03-13 22:27:35,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (42 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 234 remaining) [2025-03-13 22:27:35,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (35 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (34 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (33 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (32 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (31 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (30 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (29 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (28 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (27 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (26 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (25 of 234 remaining) [2025-03-13 22:27:35,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (24 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (23 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (22 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (21 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (20 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (19 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 234 remaining) [2025-03-13 22:27:35,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 234 remaining) [2025-03-13 22:27:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 234 remaining) [2025-03-13 22:27:35,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-13 22:27:35,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,267 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:27:35,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:27:35,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:27:35 BasicIcfg [2025-03-13 22:27:35,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:27:35,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:27:35,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:27:35,275 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:27:35,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:20" (3/4) ... [2025-03-13 22:27:35,277 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:27:35,280 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:27:35,280 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:27:35,280 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:27:35,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-13 22:27:35,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:27:35,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:27:35,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:27:35,370 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:27:35,370 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:27:35,370 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:27:35,371 INFO L158 Benchmark]: Toolchain (without parser) took 76720.69ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 102.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-03-13 22:27:35,371 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:35,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 87.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:35,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.48ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 81.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:35,372 INFO L158 Benchmark]: Boogie Preprocessor took 62.53ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 78.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:35,372 INFO L158 Benchmark]: IcfgBuilder took 1884.90ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 57.2MB in the end (delta: 19.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-03-13 22:27:35,372 INFO L158 Benchmark]: TraceAbstraction took 74321.85ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 56.2MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2025-03-13 22:27:35,372 INFO L158 Benchmark]: Witness Printer took 96.15ms. Allocated memory is still 4.9GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:35,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.12ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 87.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.48ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 81.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.53ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 78.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1884.90ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 57.2MB in the end (delta: 19.8MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * TraceAbstraction took 74321.85ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 56.2MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. * Witness Printer took 96.15ms. Allocated memory is still 4.9GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1149 locations, 234 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 74.1s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 68.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3873 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2077 mSDsluCounter, 1817 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1513 mSDsCounter, 868 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6406 IncrementalHoareTripleChecker+Invalid, 7274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 868 mSolverCounterUnsat, 304 mSDtfsCounter, 6406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=0, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 10218 NumberOfCodeBlocks, 10218 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 10173 ConstructedInterpolants, 0 QuantifiedInterpolants, 11435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 64/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 133 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:27:35,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE