./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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-commit-2.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 ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:11,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:11,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:11,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:11,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:11,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:11,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:11,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:11,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:11,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:11,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:11,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:11,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:11,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:11,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:11,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:11,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:11,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:11,803 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 -> ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 [2025-03-14 01:45:12,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:12,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:12,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:12,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:12,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:12,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-03-14 01:45:13,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f074f95/2001be676ab64af08d1416eed34ccaf4/FLAG90ca5e897 [2025-03-14 01:45:13,513 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:13,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-03-14 01:45:13,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f074f95/2001be676ab64af08d1416eed34ccaf4/FLAG90ca5e897 [2025-03-14 01:45:13,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f074f95/2001be676ab64af08d1416eed34ccaf4 [2025-03-14 01:45:13,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:13,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:13,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:13,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:13,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:13,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:13" (1/1) ... [2025-03-14 01:45:13,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:13, skipping insertion in model container [2025-03-14 01:45:13,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:13" (1/1) ... [2025-03-14 01:45:13,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:14,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:14,054 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:14,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:14,126 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:14,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14 WrapperNode [2025-03-14 01:45:14,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:14,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:14,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:14,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:14,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,176 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 977 [2025-03-14 01:45:14,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:14,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:14,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:14,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:14,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:14,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:14,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:14,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:14,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (1/1) ... [2025-03-14 01:45:14,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:14,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:14,273 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-14 01:45:14,275 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-14 01:45:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:14,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:14,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:14,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:45:14,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:14,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:14,297 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:14,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:14,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:15,486 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:15,487 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:15,487 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:16,056 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:16,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:16 BoogieIcfgContainer [2025-03-14 01:45:16,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:16,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:16,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:16,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:16,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:13" (1/3) ... [2025-03-14 01:45:16,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4eb15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:16, skipping insertion in model container [2025-03-14 01:45:16,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:14" (2/3) ... [2025-03-14 01:45:16,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4eb15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:16, skipping insertion in model container [2025-03-14 01:45:16,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:16" (3/3) ... [2025-03-14 01:45:16,063 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-03-14 01:45:16,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:16,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-2.wvr.c that has 5 procedures, 602 locations, 1 initial locations, 8 loop locations, and 164 error locations. [2025-03-14 01:45:16,078 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:16,269 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:45:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 622 transitions, 1272 flow [2025-03-14 01:45:16,498 INFO L124 PetriNetUnfolderBase]: 21/618 cut-off events. [2025-03-14 01:45:16,500 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:45:16,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 618 events. 21/618 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1155 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2025-03-14 01:45:16,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 614 places, 622 transitions, 1272 flow [2025-03-14 01:45:16,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 594 places, 601 transitions, 1226 flow [2025-03-14 01:45:16,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:16,542 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;@1cdb7a0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:16,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 300 error locations. [2025-03-14 01:45:16,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:16,550 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:45:16,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:16,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,552 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-14 01:45:16,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:16,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -495341283, now seen corresponding path program 1 times [2025-03-14 01:45:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097415431] [2025-03-14 01:45:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:45:16,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:45:16,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:16,738 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-14 01:45:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097415431] [2025-03-14 01:45:16,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097415431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:16,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775264844] [2025-03-14 01:45:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:16,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:16,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:16,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:16,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 601 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:16,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:17,827 INFO L124 PetriNetUnfolderBase]: 873/3079 cut-off events. [2025-03-14 01:45:17,828 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-14 01:45:17,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 3079 events. 873/3079 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23520 event pairs, 510 based on Foata normal form. 560/3350 useless extension candidates. Maximal degree in co-relation 3946. Up to 1169 conditions per place. [2025-03-14 01:45:17,855 INFO L140 encePairwiseOnDemand]: 475/622 looper letters, 24 selfloop transitions, 2 changer transitions 8/456 dead transitions. [2025-03-14 01:45:17,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 456 transitions, 988 flow [2025-03-14 01:45:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-03-14 01:45:17,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118971061093248 [2025-03-14 01:45:17,874 INFO L175 Difference]: Start difference. First operand has 594 places, 601 transitions, 1226 flow. Second operand 3 states and 1515 transitions. [2025-03-14 01:45:17,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 456 transitions, 988 flow [2025-03-14 01:45:17,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 972 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:45:17,891 INFO L231 Difference]: Finished difference. Result has 455 places, 448 transitions, 908 flow [2025-03-14 01:45:17,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=455, PETRI_TRANSITIONS=448} [2025-03-14 01:45:17,899 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -139 predicate places. [2025-03-14 01:45:17,900 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 448 transitions, 908 flow [2025-03-14 01:45:17,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:17,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,901 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] [2025-03-14 01:45:17,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:17,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1218601497, now seen corresponding path program 1 times [2025-03-14 01:45:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293689737] [2025-03-14 01:45:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:45:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:45:17,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,959 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-14 01:45:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293689737] [2025-03-14 01:45:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293689737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688200768] [2025-03-14 01:45:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:17,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 448 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:17,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:17,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,807 INFO L124 PetriNetUnfolderBase]: 873/3070 cut-off events. [2025-03-14 01:45:18,807 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-14 01:45:18,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 3070 events. 873/3070 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23415 event pairs, 510 based on Foata normal form. 0/2790 useless extension candidates. Maximal degree in co-relation 4292. Up to 1169 conditions per place. [2025-03-14 01:45:18,837 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2025-03-14 01:45:18,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 958 flow [2025-03-14 01:45:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:18,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:18,846 INFO L175 Difference]: Start difference. First operand has 455 places, 448 transitions, 908 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:18,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 958 flow [2025-03-14 01:45:18,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:18,857 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 906 flow [2025-03-14 01:45:18,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-03-14 01:45:18,859 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -148 predicate places. [2025-03-14 01:45:18,859 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 906 flow [2025-03-14 01:45:18,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:18,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:18,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:18,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash -397187402, now seen corresponding path program 1 times [2025-03-14 01:45:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244131999] [2025-03-14 01:45:18,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:18,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:45:18,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:45:18,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:18,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:18,927 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-14 01:45:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244131999] [2025-03-14 01:45:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244131999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:18,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267735254] [2025-03-14 01:45:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:18,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:18,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:18,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:18,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:18,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:18,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:18,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:18,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:19,486 INFO L124 PetriNetUnfolderBase]: 873/3069 cut-off events. [2025-03-14 01:45:19,486 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-14 01:45:19,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 3069 events. 873/3069 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 23444 event pairs, 510 based on Foata normal form. 0/2790 useless extension candidates. Maximal degree in co-relation 4283. Up to 1169 conditions per place. [2025-03-14 01:45:19,504 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-03-14 01:45:19,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 446 transitions, 956 flow [2025-03-14 01:45:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:19,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:19,507 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 906 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:19,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 446 transitions, 956 flow [2025-03-14 01:45:19,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 446 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:19,512 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 904 flow [2025-03-14 01:45:19,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2025-03-14 01:45:19,513 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-03-14 01:45:19,513 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 904 flow [2025-03-14 01:45:19,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:19,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:19,514 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] [2025-03-14 01:45:19,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:19,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:19,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash 855762351, now seen corresponding path program 1 times [2025-03-14 01:45:19,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:19,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302162128] [2025-03-14 01:45:19,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:19,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:45:19,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:45:19,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:19,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:19,553 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-14 01:45:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302162128] [2025-03-14 01:45:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302162128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:19,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:19,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215617375] [2025-03-14 01:45:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:19,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:19,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:19,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:19,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:19,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:19,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:19,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:19,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:20,025 INFO L124 PetriNetUnfolderBase]: 1019/2661 cut-off events. [2025-03-14 01:45:20,025 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-14 01:45:20,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 2661 events. 1019/2661 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16195 event pairs, 131 based on Foata normal form. 0/2498 useless extension candidates. Maximal degree in co-relation 4070. Up to 1121 conditions per place. [2025-03-14 01:45:20,039 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 35 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-14 01:45:20,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 459 transitions, 1011 flow [2025-03-14 01:45:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1394 transitions. [2025-03-14 01:45:20,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7470525187566989 [2025-03-14 01:45:20,043 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 904 flow. Second operand 3 states and 1394 transitions. [2025-03-14 01:45:20,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 459 transitions, 1011 flow [2025-03-14 01:45:20,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 459 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:20,048 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 908 flow [2025-03-14 01:45:20,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2025-03-14 01:45:20,050 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-03-14 01:45:20,050 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 908 flow [2025-03-14 01:45:20,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:20,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:20,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:20,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:20,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:20,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1939825886, now seen corresponding path program 1 times [2025-03-14 01:45:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116080122] [2025-03-14 01:45:20,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:20,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:45:20,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:45:20,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:20,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:20,111 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-14 01:45:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116080122] [2025-03-14 01:45:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116080122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:20,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717162074] [2025-03-14 01:45:20,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:20,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:20,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:20,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:20,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:20,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:20,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:20,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:20,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:20,743 INFO L124 PetriNetUnfolderBase]: 962/3319 cut-off events. [2025-03-14 01:45:20,743 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-14 01:45:20,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 3319 events. 962/3319 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25760 event pairs, 576 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 2173. Up to 1298 conditions per place. [2025-03-14 01:45:20,770 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-03-14 01:45:20,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 445 transitions, 958 flow [2025-03-14 01:45:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:20,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:20,774 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 908 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:20,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 445 transitions, 958 flow [2025-03-14 01:45:20,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:20,782 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 908 flow [2025-03-14 01:45:20,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=445} [2025-03-14 01:45:20,784 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-03-14 01:45:20,784 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 908 flow [2025-03-14 01:45:20,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:20,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:20,785 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] [2025-03-14 01:45:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:20,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 570426707, now seen corresponding path program 1 times [2025-03-14 01:45:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027549791] [2025-03-14 01:45:20,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:20,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:45:20,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:45:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:20,831 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-14 01:45:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:20,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027549791] [2025-03-14 01:45:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027549791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:20,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797326843] [2025-03-14 01:45:20,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:20,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:20,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:20,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:20,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 445 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:20,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:20,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:20,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:21,523 INFO L124 PetriNetUnfolderBase]: 962/3318 cut-off events. [2025-03-14 01:45:21,523 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-14 01:45:21,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 3318 events. 962/3318 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25707 event pairs, 576 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 4716. Up to 1296 conditions per place. [2025-03-14 01:45:21,539 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 23 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2025-03-14 01:45:21,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 444 transitions, 954 flow [2025-03-14 01:45:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-03-14 01:45:21,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-03-14 01:45:21,542 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 908 flow. Second operand 3 states and 1380 transitions. [2025-03-14 01:45:21,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 444 transitions, 954 flow [2025-03-14 01:45:21,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:21,547 INFO L231 Difference]: Finished difference. Result has 444 places, 444 transitions, 904 flow [2025-03-14 01:45:21,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=444, PETRI_TRANSITIONS=444} [2025-03-14 01:45:21,548 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-03-14 01:45:21,548 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 444 transitions, 904 flow [2025-03-14 01:45:21,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:21,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:45:21,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:21,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash -882263521, now seen corresponding path program 1 times [2025-03-14 01:45:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092843971] [2025-03-14 01:45:21,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:21,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:45:21,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:45:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:21,609 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-14 01:45:21,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:21,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092843971] [2025-03-14 01:45:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092843971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:21,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054269610] [2025-03-14 01:45:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:21,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:21,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 444 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:21,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:21,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:21,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:22,134 INFO L124 PetriNetUnfolderBase]: 962/3317 cut-off events. [2025-03-14 01:45:22,134 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-14 01:45:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 3317 events. 962/3317 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25740 event pairs, 576 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 4716. Up to 1298 conditions per place. [2025-03-14 01:45:22,146 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-14 01:45:22,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 443 transitions, 954 flow [2025-03-14 01:45:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:22,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:22,149 INFO L175 Difference]: Start difference. First operand has 444 places, 444 transitions, 904 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:22,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 443 transitions, 954 flow [2025-03-14 01:45:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 443 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:22,154 INFO L231 Difference]: Finished difference. Result has 444 places, 443 transitions, 905 flow [2025-03-14 01:45:22,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=444, PETRI_TRANSITIONS=443} [2025-03-14 01:45:22,155 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-03-14 01:45:22,155 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 443 transitions, 905 flow [2025-03-14 01:45:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:22,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:22,156 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] [2025-03-14 01:45:22,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:22,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 579858616, now seen corresponding path program 1 times [2025-03-14 01:45:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724295865] [2025-03-14 01:45:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:22,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:45:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:45:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:22,615 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-14 01:45:22,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:22,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724295865] [2025-03-14 01:45:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724295865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:22,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:22,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980706123] [2025-03-14 01:45:22,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:22,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:22,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:22,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:22,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 622 [2025-03-14 01:45:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 443 transitions, 905 flow. Second operand has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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-14 01:45:22,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:22,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 622 [2025-03-14 01:45:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:23,324 INFO L124 PetriNetUnfolderBase]: 962/3313 cut-off events. [2025-03-14 01:45:23,324 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-14 01:45:23,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4828 conditions, 3313 events. 962/3313 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25672 event pairs, 576 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 4762. Up to 1327 conditions per place. [2025-03-14 01:45:23,335 INFO L140 encePairwiseOnDemand]: 598/622 looper letters, 53 selfloop transitions, 20 changer transitions 0/439 dead transitions. [2025-03-14 01:45:23,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1043 flow [2025-03-14 01:45:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2025-03-14 01:45:23,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634512325830654 [2025-03-14 01:45:23,339 INFO L175 Difference]: Start difference. First operand has 444 places, 443 transitions, 905 flow. Second operand 6 states and 2476 transitions. [2025-03-14 01:45:23,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1043 flow [2025-03-14 01:45:23,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1039 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:23,344 INFO L231 Difference]: Finished difference. Result has 443 places, 439 transitions, 933 flow [2025-03-14 01:45:23,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=439} [2025-03-14 01:45:23,345 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -151 predicate places. [2025-03-14 01:45:23,345 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 439 transitions, 933 flow [2025-03-14 01:45:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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-14 01:45:23,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:23,346 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] [2025-03-14 01:45:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:23,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -148309972, now seen corresponding path program 1 times [2025-03-14 01:45:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598493548] [2025-03-14 01:45:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:45:23,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:45:23,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:23,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:23,374 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-14 01:45:23,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598493548] [2025-03-14 01:45:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598493548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774780272] [2025-03-14 01:45:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:23,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:23,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:23,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:23,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 439 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:23,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:23,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:23,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:23,930 INFO L124 PetriNetUnfolderBase]: 962/3312 cut-off events. [2025-03-14 01:45:23,930 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-14 01:45:23,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 3312 events. 962/3312 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 25632 event pairs, 576 based on Foata normal form. 0/3025 useless extension candidates. Maximal degree in co-relation 4735. Up to 1299 conditions per place. [2025-03-14 01:45:23,958 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-03-14 01:45:23,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 438 transitions, 985 flow [2025-03-14 01:45:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:23,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:23,962 INFO L175 Difference]: Start difference. First operand has 443 places, 439 transitions, 933 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:23,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 438 transitions, 985 flow [2025-03-14 01:45:23,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 438 transitions, 945 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:24,031 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 895 flow [2025-03-14 01:45:24,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2025-03-14 01:45:24,032 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-03-14 01:45:24,032 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 895 flow [2025-03-14 01:45:24,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:24,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:24,033 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] [2025-03-14 01:45:24,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:24,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:24,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash -788881816, now seen corresponding path program 1 times [2025-03-14 01:45:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936381592] [2025-03-14 01:45:24,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:24,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-14 01:45:24,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-14 01:45:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936381592] [2025-03-14 01:45:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936381592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:24,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164801951] [2025-03-14 01:45:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:24,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:24,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:24,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:24,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:24,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:24,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:24,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:24,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:24,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:24,893 INFO L124 PetriNetUnfolderBase]: 1298/4004 cut-off events. [2025-03-14 01:45:24,894 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-14 01:45:24,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 4004 events. 1298/4004 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 32175 event pairs, 467 based on Foata normal form. 0/3720 useless extension candidates. Maximal degree in co-relation 5878. Up to 946 conditions per place. [2025-03-14 01:45:24,916 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 39 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-03-14 01:45:24,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 454 transitions, 1017 flow [2025-03-14 01:45:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-14 01:45:24,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-03-14 01:45:24,919 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 895 flow. Second operand 3 states and 1396 transitions. [2025-03-14 01:45:24,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 454 transitions, 1017 flow [2025-03-14 01:45:24,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 454 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:24,924 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 899 flow [2025-03-14 01:45:24,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2025-03-14 01:45:24,925 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-03-14 01:45:24,925 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 899 flow [2025-03-14 01:45:24,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:24,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:24,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:24,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:24,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2141741422, now seen corresponding path program 1 times [2025-03-14 01:45:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576648422] [2025-03-14 01:45:24,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:24,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-14 01:45:24,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-14 01:45:24,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:24,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:24,964 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-14 01:45:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576648422] [2025-03-14 01:45:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576648422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133578241] [2025-03-14 01:45:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:24,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:24,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:24,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:24,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:24,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:24,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:24,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:25,567 INFO L124 PetriNetUnfolderBase]: 1298/3939 cut-off events. [2025-03-14 01:45:25,567 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-03-14 01:45:25,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 3939 events. 1298/3939 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31443 event pairs, 851 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 6080. Up to 1747 conditions per place. [2025-03-14 01:45:25,589 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-03-14 01:45:25,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 437 transitions, 951 flow [2025-03-14 01:45:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:25,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:25,592 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 899 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:25,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 437 transitions, 951 flow [2025-03-14 01:45:25,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 437 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:25,597 INFO L231 Difference]: Finished difference. Result has 439 places, 437 transitions, 899 flow [2025-03-14 01:45:25,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=437} [2025-03-14 01:45:25,598 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-03-14 01:45:25,598 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 437 transitions, 899 flow [2025-03-14 01:45:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:25,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:25,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:25,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:25,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1243661673, now seen corresponding path program 1 times [2025-03-14 01:45:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372456555] [2025-03-14 01:45:25,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:25,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-14 01:45:25,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-14 01:45:25,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:25,631 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-14 01:45:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:25,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372456555] [2025-03-14 01:45:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372456555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714534181] [2025-03-14 01:45:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:25,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:25,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:25,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:25,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 437 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:25,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:25,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:25,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:26,201 INFO L124 PetriNetUnfolderBase]: 1298/3938 cut-off events. [2025-03-14 01:45:26,201 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-14 01:45:26,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6061 conditions, 3938 events. 1298/3938 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31472 event pairs, 851 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 5993. Up to 1748 conditions per place. [2025-03-14 01:45:26,220 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-14 01:45:26,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 436 transitions, 953 flow [2025-03-14 01:45:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:26,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:26,223 INFO L175 Difference]: Start difference. First operand has 439 places, 437 transitions, 899 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:26,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 436 transitions, 953 flow [2025-03-14 01:45:26,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 436 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:26,227 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 897 flow [2025-03-14 01:45:26,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2025-03-14 01:45:26,228 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -156 predicate places. [2025-03-14 01:45:26,228 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 897 flow [2025-03-14 01:45:26,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:26,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:26,229 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] [2025-03-14 01:45:26,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:26,229 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:26,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash -317547470, now seen corresponding path program 1 times [2025-03-14 01:45:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326605943] [2025-03-14 01:45:26,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-14 01:45:26,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-14 01:45:26,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:26,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:26,261 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-14 01:45:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326605943] [2025-03-14 01:45:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326605943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058073066] [2025-03-14 01:45:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:26,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:26,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:26,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:26,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:26,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:26,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:26,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:26,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:26,847 INFO L124 PetriNetUnfolderBase]: 1298/3937 cut-off events. [2025-03-14 01:45:26,847 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-03-14 01:45:26,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 3937 events. 1298/3937 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31460 event pairs, 851 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 5990. Up to 1745 conditions per place. [2025-03-14 01:45:26,867 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 24 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2025-03-14 01:45:26,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 435 transitions, 945 flow [2025-03-14 01:45:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-03-14 01:45:26,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-03-14 01:45:26,869 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 897 flow. Second operand 3 states and 1380 transitions. [2025-03-14 01:45:26,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 435 transitions, 945 flow [2025-03-14 01:45:26,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:26,875 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 893 flow [2025-03-14 01:45:26,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=437, PETRI_TRANSITIONS=435} [2025-03-14 01:45:26,877 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-03-14 01:45:26,877 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 893 flow [2025-03-14 01:45:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:26,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:26,878 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] [2025-03-14 01:45:26,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:26,878 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1235257694, now seen corresponding path program 1 times [2025-03-14 01:45:26,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:26,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188788437] [2025-03-14 01:45:26,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:26,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:26,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:45:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:45:26,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:26,918 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-14 01:45:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188788437] [2025-03-14 01:45:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188788437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720043083] [2025-03-14 01:45:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:26,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:26,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 435 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:26,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:26,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:26,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:27,572 INFO L124 PetriNetUnfolderBase]: 1298/3936 cut-off events. [2025-03-14 01:45:27,572 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-14 01:45:27,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 3936 events. 1298/3936 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31453 event pairs, 851 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 5989. Up to 1747 conditions per place. [2025-03-14 01:45:27,590 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-14 01:45:27,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 434 transitions, 945 flow [2025-03-14 01:45:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:27,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:27,596 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:27,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 434 transitions, 945 flow [2025-03-14 01:45:27,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 944 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:27,601 INFO L231 Difference]: Finished difference. Result has 437 places, 434 transitions, 894 flow [2025-03-14 01:45:27,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=437, PETRI_TRANSITIONS=434} [2025-03-14 01:45:27,602 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-03-14 01:45:27,602 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 434 transitions, 894 flow [2025-03-14 01:45:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:27,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:27,603 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] [2025-03-14 01:45:27,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:27,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1756411776, now seen corresponding path program 1 times [2025-03-14 01:45:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969895373] [2025-03-14 01:45:27,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-14 01:45:27,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-14 01:45:27,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:27,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969895373] [2025-03-14 01:45:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969895373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624405560] [2025-03-14 01:45:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:27,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:27,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:27,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:27,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 434 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:27,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:27,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:28,527 INFO L124 PetriNetUnfolderBase]: 1298/3935 cut-off events. [2025-03-14 01:45:28,527 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-14 01:45:28,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 3935 events. 1298/3935 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 31420 event pairs, 851 based on Foata normal form. 0/3632 useless extension candidates. Maximal degree in co-relation 5991. Up to 1748 conditions per place. [2025-03-14 01:45:28,558 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-14 01:45:28,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 948 flow [2025-03-14 01:45:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:28,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:28,560 INFO L175 Difference]: Start difference. First operand has 437 places, 434 transitions, 894 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:28,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 948 flow [2025-03-14 01:45:28,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:28,564 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 892 flow [2025-03-14 01:45:28,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2025-03-14 01:45:28,565 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-03-14 01:45:28,565 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 892 flow [2025-03-14 01:45:28,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:28,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:28,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:28,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:28,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:28,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:28,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1503910716, now seen corresponding path program 1 times [2025-03-14 01:45:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:28,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705024668] [2025-03-14 01:45:28,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:28,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:45:28,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:45:28,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:28,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:28,611 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-14 01:45:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705024668] [2025-03-14 01:45:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705024668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803468136] [2025-03-14 01:45:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:28,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:28,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:28,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:28,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:28,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:28,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:28,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:28,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:29,236 INFO L124 PetriNetUnfolderBase]: 1340/3859 cut-off events. [2025-03-14 01:45:29,236 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2025-03-14 01:45:29,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6077 conditions, 3859 events. 1340/3859 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 29232 event pairs, 225 based on Foata normal form. 0/3620 useless extension candidates. Maximal degree in co-relation 6010. Up to 1311 conditions per place. [2025-03-14 01:45:29,252 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 42 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-14 01:45:29,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 451 transitions, 1030 flow [2025-03-14 01:45:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-03-14 01:45:29,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7486602357984995 [2025-03-14 01:45:29,254 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 892 flow. Second operand 3 states and 1397 transitions. [2025-03-14 01:45:29,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 451 transitions, 1030 flow [2025-03-14 01:45:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 451 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:29,259 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 896 flow [2025-03-14 01:45:29,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2025-03-14 01:45:29,260 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-03-14 01:45:29,260 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 896 flow [2025-03-14 01:45:29,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:29,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:29,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:29,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -433837465, now seen corresponding path program 1 times [2025-03-14 01:45:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449503001] [2025-03-14 01:45:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:29,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:45:29,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:45:29,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:29,298 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-14 01:45:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:29,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449503001] [2025-03-14 01:45:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449503001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:29,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:29,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:29,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935327494] [2025-03-14 01:45:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:29,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:29,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:29,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:29,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:29,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:29,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:29,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:29,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:29,888 INFO L124 PetriNetUnfolderBase]: 1340/4060 cut-off events. [2025-03-14 01:45:29,888 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2025-03-14 01:45:29,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 4060 events. 1340/4060 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32490 event pairs, 893 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6617. Up to 1826 conditions per place. [2025-03-14 01:45:29,916 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-14 01:45:29,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 950 flow [2025-03-14 01:45:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:29,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:29,919 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 896 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:29,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 950 flow [2025-03-14 01:45:29,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 432 transitions, 948 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:29,926 INFO L231 Difference]: Finished difference. Result has 436 places, 432 transitions, 896 flow [2025-03-14 01:45:29,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=432} [2025-03-14 01:45:29,927 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-03-14 01:45:29,927 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 432 transitions, 896 flow [2025-03-14 01:45:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:29,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:29,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:29,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:29,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash -41266220, now seen corresponding path program 1 times [2025-03-14 01:45:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:29,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845774703] [2025-03-14 01:45:29,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:29,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:45:29,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:45:29,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:29,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:29,968 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-14 01:45:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845774703] [2025-03-14 01:45:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845774703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062382212] [2025-03-14 01:45:29,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:29,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:29,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:29,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:29,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:29,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 432 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:29,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:29,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:29,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:30,576 INFO L124 PetriNetUnfolderBase]: 1340/4059 cut-off events. [2025-03-14 01:45:30,577 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-03-14 01:45:30,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6553 conditions, 4059 events. 1340/4059 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32528 event pairs, 893 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6484. Up to 1827 conditions per place. [2025-03-14 01:45:30,599 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-03-14 01:45:30,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 431 transitions, 952 flow [2025-03-14 01:45:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:30,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:30,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:30,601 INFO L175 Difference]: Start difference. First operand has 436 places, 432 transitions, 896 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:30,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 431 transitions, 952 flow [2025-03-14 01:45:30,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 431 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:30,605 INFO L231 Difference]: Finished difference. Result has 435 places, 431 transitions, 894 flow [2025-03-14 01:45:30,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=435, PETRI_TRANSITIONS=431} [2025-03-14 01:45:30,606 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -159 predicate places. [2025-03-14 01:45:30,606 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 431 transitions, 894 flow [2025-03-14 01:45:30,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:30,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:30,607 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] [2025-03-14 01:45:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:45:30,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -902598848, now seen corresponding path program 1 times [2025-03-14 01:45:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125529649] [2025-03-14 01:45:30,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:30,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-14 01:45:30,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-14 01:45:30,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:30,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:30,644 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-14 01:45:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125529649] [2025-03-14 01:45:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125529649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667760939] [2025-03-14 01:45:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:30,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:30,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:30,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 431 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:30,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:30,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:31,302 INFO L124 PetriNetUnfolderBase]: 1340/4058 cut-off events. [2025-03-14 01:45:31,302 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2025-03-14 01:45:31,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 4058 events. 1340/4058 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32508 event pairs, 893 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6481. Up to 1824 conditions per place. [2025-03-14 01:45:31,316 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 25 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2025-03-14 01:45:31,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 430 transitions, 944 flow [2025-03-14 01:45:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-03-14 01:45:31,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-03-14 01:45:31,318 INFO L175 Difference]: Start difference. First operand has 435 places, 431 transitions, 894 flow. Second operand 3 states and 1380 transitions. [2025-03-14 01:45:31,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 430 transitions, 944 flow [2025-03-14 01:45:31,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 430 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:31,322 INFO L231 Difference]: Finished difference. Result has 434 places, 430 transitions, 890 flow [2025-03-14 01:45:31,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=434, PETRI_TRANSITIONS=430} [2025-03-14 01:45:31,323 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-03-14 01:45:31,323 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 430 transitions, 890 flow [2025-03-14 01:45:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:31,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:31,324 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] [2025-03-14 01:45:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:45:31,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1643337436, now seen corresponding path program 1 times [2025-03-14 01:45:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092065662] [2025-03-14 01:45:31,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-14 01:45:31,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-14 01:45:31,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:31,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:31,368 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-14 01:45:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092065662] [2025-03-14 01:45:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092065662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430649462] [2025-03-14 01:45:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:31,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:31,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:31,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:31,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 430 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:31,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:31,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:31,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:31,992 INFO L124 PetriNetUnfolderBase]: 1340/4057 cut-off events. [2025-03-14 01:45:31,992 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-03-14 01:45:32,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 4057 events. 1340/4057 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32503 event pairs, 893 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6480. Up to 1826 conditions per place. [2025-03-14 01:45:32,018 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-03-14 01:45:32,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 429 transitions, 944 flow [2025-03-14 01:45:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:32,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:32,020 INFO L175 Difference]: Start difference. First operand has 434 places, 430 transitions, 890 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:32,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 429 transitions, 944 flow [2025-03-14 01:45:32,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 429 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:32,025 INFO L231 Difference]: Finished difference. Result has 434 places, 429 transitions, 891 flow [2025-03-14 01:45:32,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=434, PETRI_TRANSITIONS=429} [2025-03-14 01:45:32,026 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-03-14 01:45:32,026 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 429 transitions, 891 flow [2025-03-14 01:45:32,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:32,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:32,027 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] [2025-03-14 01:45:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:45:32,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -990755652, now seen corresponding path program 1 times [2025-03-14 01:45:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417504587] [2025-03-14 01:45:32,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:32,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-14 01:45:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:45:32,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:32,067 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-14 01:45:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417504587] [2025-03-14 01:45:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417504587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:32,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083023177] [2025-03-14 01:45:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:32,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:32,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:32,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:32,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 429 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:32,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:32,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:32,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:32,650 INFO L124 PetriNetUnfolderBase]: 1340/4056 cut-off events. [2025-03-14 01:45:32,650 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-03-14 01:45:32,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 4056 events. 1340/4056 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32526 event pairs, 893 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6482. Up to 1827 conditions per place. [2025-03-14 01:45:32,669 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-03-14 01:45:32,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 428 transitions, 947 flow [2025-03-14 01:45:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:32,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:32,671 INFO L175 Difference]: Start difference. First operand has 434 places, 429 transitions, 891 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:32,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 428 transitions, 947 flow [2025-03-14 01:45:32,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 428 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:32,675 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 889 flow [2025-03-14 01:45:32,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2025-03-14 01:45:32,675 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-03-14 01:45:32,675 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 889 flow [2025-03-14 01:45:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:32,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:32,676 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] [2025-03-14 01:45:32,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:45:32,676 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:32,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash -920635909, now seen corresponding path program 1 times [2025-03-14 01:45:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:32,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243044400] [2025-03-14 01:45:32,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:32,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-14 01:45:32,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-14 01:45:32,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:32,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:32,707 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-14 01:45:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243044400] [2025-03-14 01:45:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243044400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988473594] [2025-03-14 01:45:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:32,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:32,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:32,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:32,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:32,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:32,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:32,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:33,327 INFO L124 PetriNetUnfolderBase]: 1343/3972 cut-off events. [2025-03-14 01:45:33,328 INFO L125 PetriNetUnfolderBase]: For 678/678 co-relation queries the response was YES. [2025-03-14 01:45:33,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6503 conditions, 3972 events. 1343/3972 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 30226 event pairs, 236 based on Foata normal form. 0/3735 useless extension candidates. Maximal degree in co-relation 6435. Up to 1315 conditions per place. [2025-03-14 01:45:33,355 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 43 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-03-14 01:45:33,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 446 transitions, 1032 flow [2025-03-14 01:45:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-14 01:45:33,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-03-14 01:45:33,357 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 889 flow. Second operand 3 states and 1396 transitions. [2025-03-14 01:45:33,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 446 transitions, 1032 flow [2025-03-14 01:45:33,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 446 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:33,365 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 893 flow [2025-03-14 01:45:33,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2025-03-14 01:45:33,366 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-03-14 01:45:33,366 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 893 flow [2025-03-14 01:45:33,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:33,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:33,367 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] [2025-03-14 01:45:33,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:45:33,367 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:33,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 905338836, now seen corresponding path program 1 times [2025-03-14 01:45:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615270222] [2025-03-14 01:45:33,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:33,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-14 01:45:33,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-14 01:45:33,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:33,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:33,408 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-14 01:45:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615270222] [2025-03-14 01:45:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615270222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107871050] [2025-03-14 01:45:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:33,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:33,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:33,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:33,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:33,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:33,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:33,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:34,019 INFO L124 PetriNetUnfolderBase]: 1343/4106 cut-off events. [2025-03-14 01:45:34,019 INFO L125 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2025-03-14 01:45:34,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 4106 events. 1343/4106 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33065 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 7004. Up to 1854 conditions per place. [2025-03-14 01:45:34,043 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-03-14 01:45:34,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 427 transitions, 949 flow [2025-03-14 01:45:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:34,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:34,046 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:34,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 427 transitions, 949 flow [2025-03-14 01:45:34,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 427 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:34,050 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 893 flow [2025-03-14 01:45:34,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2025-03-14 01:45:34,051 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-03-14 01:45:34,051 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 893 flow [2025-03-14 01:45:34,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:34,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:34,052 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] [2025-03-14 01:45:34,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:45:34,052 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:34,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2071983118, now seen corresponding path program 1 times [2025-03-14 01:45:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525643478] [2025-03-14 01:45:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-14 01:45:34,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-14 01:45:34,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:34,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:34,088 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-14 01:45:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525643478] [2025-03-14 01:45:34,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525643478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:34,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:34,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566702879] [2025-03-14 01:45:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:34,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:34,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:34,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-03-14 01:45:34,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:34,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:34,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-03-14 01:45:34,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:34,734 INFO L124 PetriNetUnfolderBase]: 1343/4105 cut-off events. [2025-03-14 01:45:34,734 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-03-14 01:45:34,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 4105 events. 1343/4105 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33056 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 6861. Up to 1855 conditions per place. [2025-03-14 01:45:34,750 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 28 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-03-14 01:45:34,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 426 transitions, 951 flow [2025-03-14 01:45:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-03-14 01:45:34,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-03-14 01:45:34,752 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 893 flow. Second operand 3 states and 1371 transitions. [2025-03-14 01:45:34,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 426 transitions, 951 flow [2025-03-14 01:45:34,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 426 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:34,757 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 891 flow [2025-03-14 01:45:34,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2025-03-14 01:45:34,757 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -162 predicate places. [2025-03-14 01:45:34,758 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 891 flow [2025-03-14 01:45:34,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 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-14 01:45:34,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:34,758 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] [2025-03-14 01:45:34,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:45:34,758 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:34,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -246550366, now seen corresponding path program 1 times [2025-03-14 01:45:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894219933] [2025-03-14 01:45:34,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:34,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-14 01:45:34,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-14 01:45:34,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:34,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:34,799 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-14 01:45:34,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:34,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894219933] [2025-03-14 01:45:34,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894219933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:34,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:34,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874391006] [2025-03-14 01:45:34,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:34,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:34,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:34,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:34,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:34,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:34,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:34,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:34,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:35,391 INFO L124 PetriNetUnfolderBase]: 1343/4104 cut-off events. [2025-03-14 01:45:35,392 INFO L125 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2025-03-14 01:45:35,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6927 conditions, 4104 events. 1343/4104 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33066 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 6858. Up to 1852 conditions per place. [2025-03-14 01:45:35,420 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 26 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2025-03-14 01:45:35,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 425 transitions, 943 flow [2025-03-14 01:45:35,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-03-14 01:45:35,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-03-14 01:45:35,422 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 891 flow. Second operand 3 states and 1380 transitions. [2025-03-14 01:45:35,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 425 transitions, 943 flow [2025-03-14 01:45:35,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 425 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:35,427 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 887 flow [2025-03-14 01:45:35,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2025-03-14 01:45:35,427 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-03-14 01:45:35,427 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 887 flow [2025-03-14 01:45:35,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 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-14 01:45:35,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:35,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:35,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:45:35,428 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:35,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 943584189, now seen corresponding path program 1 times [2025-03-14 01:45:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48302466] [2025-03-14 01:45:35,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:35,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-14 01:45:35,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-14 01:45:35,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:35,471 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-14 01:45:35,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48302466] [2025-03-14 01:45:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48302466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:35,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734395146] [2025-03-14 01:45:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:35,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:35,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:35,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:35,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:35,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:35,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:35,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:35,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:35,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:36,355 INFO L124 PetriNetUnfolderBase]: 1343/4103 cut-off events. [2025-03-14 01:45:36,355 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-03-14 01:45:36,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6927 conditions, 4103 events. 1343/4103 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33030 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 6857. Up to 1854 conditions per place. [2025-03-14 01:45:36,381 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-03-14 01:45:36,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 424 transitions, 943 flow [2025-03-14 01:45:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:36,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:36,384 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 887 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:36,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 424 transitions, 943 flow [2025-03-14 01:45:36,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:36,390 INFO L231 Difference]: Finished difference. Result has 431 places, 424 transitions, 888 flow [2025-03-14 01:45:36,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=431, PETRI_TRANSITIONS=424} [2025-03-14 01:45:36,391 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-03-14 01:45:36,391 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 424 transitions, 888 flow [2025-03-14 01:45:36,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:36,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:36,391 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] [2025-03-14 01:45:36,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:45:36,391 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1345089330, now seen corresponding path program 1 times [2025-03-14 01:45:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904878273] [2025-03-14 01:45:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:36,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-14 01:45:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-14 01:45:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:36,450 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-14 01:45:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904878273] [2025-03-14 01:45:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904878273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:36,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:36,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994653556] [2025-03-14 01:45:36,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:36,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:36,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:36,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:36,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:36,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 424 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:36,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:36,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:36,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:37,141 INFO L124 PetriNetUnfolderBase]: 1343/4102 cut-off events. [2025-03-14 01:45:37,141 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-03-14 01:45:37,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6928 conditions, 4102 events. 1343/4102 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33066 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 6858. Up to 1854 conditions per place. [2025-03-14 01:45:37,171 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-14 01:45:37,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 423 transitions, 944 flow [2025-03-14 01:45:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:37,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:37,173 INFO L175 Difference]: Start difference. First operand has 431 places, 424 transitions, 888 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:37,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 423 transitions, 944 flow [2025-03-14 01:45:37,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 423 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:37,190 INFO L231 Difference]: Finished difference. Result has 430 places, 423 transitions, 886 flow [2025-03-14 01:45:37,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=430, PETRI_TRANSITIONS=423} [2025-03-14 01:45:37,191 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -164 predicate places. [2025-03-14 01:45:37,192 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 423 transitions, 886 flow [2025-03-14 01:45:37,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:37,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:37,192 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] [2025-03-14 01:45:37,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:45:37,193 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:37,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1131320900, now seen corresponding path program 1 times [2025-03-14 01:45:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111732214] [2025-03-14 01:45:37,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:37,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-14 01:45:37,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-14 01:45:37,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:37,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:37,238 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-14 01:45:37,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111732214] [2025-03-14 01:45:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111732214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081329202] [2025-03-14 01:45:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:37,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-03-14 01:45:37,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 423 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:37,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:37,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-03-14 01:45:37,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:37,876 INFO L124 PetriNetUnfolderBase]: 1343/4101 cut-off events. [2025-03-14 01:45:37,877 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-03-14 01:45:37,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6927 conditions, 4101 events. 1343/4101 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 33030 event pairs, 908 based on Foata normal form. 0/3805 useless extension candidates. Maximal degree in co-relation 6857. Up to 1854 conditions per place. [2025-03-14 01:45:37,899 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-14 01:45:37,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 422 transitions, 942 flow [2025-03-14 01:45:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-03-14 01:45:37,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-03-14 01:45:37,901 INFO L175 Difference]: Start difference. First operand has 430 places, 423 transitions, 886 flow. Second operand 3 states and 1373 transitions. [2025-03-14 01:45:37,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 422 transitions, 942 flow [2025-03-14 01:45:37,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 422 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:37,905 INFO L231 Difference]: Finished difference. Result has 429 places, 422 transitions, 884 flow [2025-03-14 01:45:37,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=429, PETRI_TRANSITIONS=422} [2025-03-14 01:45:37,906 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -165 predicate places. [2025-03-14 01:45:37,906 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 422 transitions, 884 flow [2025-03-14 01:45:37,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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-14 01:45:37,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:37,906 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] [2025-03-14 01:45:37,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:45:37,907 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-03-14 01:45:37,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1312256756, now seen corresponding path program 1 times [2025-03-14 01:45:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:37,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248555497] [2025-03-14 01:45:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:37,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-14 01:45:37,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-14 01:45:37,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:37,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:37,967 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-14 01:45:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248555497] [2025-03-14 01:45:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248555497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156288572] [2025-03-14 01:45:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:37,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:37,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:37,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-03-14 01:45:37,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 422 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 0 states have call successors, (0), 0 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-14 01:45:37,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:37,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-03-14 01:45:37,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:38,589 INFO L124 PetriNetUnfolderBase]: 1343/4085 cut-off events. [2025-03-14 01:45:38,589 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2025-03-14 01:45:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6923 conditions, 4085 events. 1343/4085 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 33050 event pairs, 908 based on Foata normal form. 16/3805 useless extension candidates. Maximal degree in co-relation 6853. Up to 1852 conditions per place. [2025-03-14 01:45:38,609 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 0 selfloop transitions, 0 changer transitions 421/421 dead transitions. [2025-03-14 01:45:38,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 421 transitions, 934 flow [2025-03-14 01:45:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2025-03-14 01:45:38,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7390139335476956 [2025-03-14 01:45:38,612 INFO L175 Difference]: Start difference. First operand has 429 places, 422 transitions, 884 flow. Second operand 3 states and 1379 transitions. [2025-03-14 01:45:38,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 421 transitions, 934 flow [2025-03-14 01:45:38,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 421 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:38,616 INFO L231 Difference]: Finished difference. Result has 428 places, 0 transitions, 0 flow [2025-03-14 01:45:38,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=428, PETRI_TRANSITIONS=0} [2025-03-14 01:45:38,617 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -166 predicate places. [2025-03-14 01:45:38,617 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 0 transitions, 0 flow [2025-03-14 01:45:38,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 0 states have call successors, (0), 0 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-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (299 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (298 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (297 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (296 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (295 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (294 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (293 of 300 remaining) [2025-03-14 01:45:38,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (292 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (291 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (290 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (289 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (288 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (287 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (286 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (285 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (284 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (283 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (282 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (281 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (280 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (279 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (278 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (277 of 300 remaining) [2025-03-14 01:45:38,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (276 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (275 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (274 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (273 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (272 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (271 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (270 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (269 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (268 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (267 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (266 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (265 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (264 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (263 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (262 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (261 of 300 remaining) [2025-03-14 01:45:38,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (260 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (259 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (258 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (257 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (256 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (255 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (254 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (253 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (252 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (251 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (250 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (249 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (248 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (247 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (246 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (245 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (244 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (243 of 300 remaining) [2025-03-14 01:45:38,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (242 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (241 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (240 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (239 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (238 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (237 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (236 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (235 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (234 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (233 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (232 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (231 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (230 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (229 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (228 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (227 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (226 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (225 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (224 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (223 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (222 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (221 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (220 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (219 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (218 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (217 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (216 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (215 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (214 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (213 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (212 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (211 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (210 of 300 remaining) [2025-03-14 01:45:38,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (209 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (208 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (207 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (206 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (205 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (204 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (203 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (202 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (201 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (200 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (199 of 300 remaining) [2025-03-14 01:45:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (198 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (197 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (196 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (195 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (194 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (193 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (192 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (191 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (190 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (189 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (187 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (186 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (185 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (184 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (183 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (182 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (181 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (180 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (179 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (178 of 300 remaining) [2025-03-14 01:45:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (177 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (176 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (175 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (174 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (173 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (172 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (171 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (170 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (169 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (168 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (167 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (166 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (165 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (164 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (163 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (162 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (161 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (160 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (159 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (158 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (157 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (156 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (155 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (154 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (153 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (152 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (151 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (150 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (149 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (148 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (147 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (146 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (145 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (144 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (143 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (142 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (141 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (140 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (139 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (138 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (137 of 300 remaining) [2025-03-14 01:45:38,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (136 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (135 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (134 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (133 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (132 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (131 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (130 of 300 remaining) [2025-03-14 01:45:38,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (129 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (128 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (127 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (126 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (125 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (124 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (123 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (122 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (121 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (120 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (119 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (118 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (117 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (116 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (115 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (114 of 300 remaining) [2025-03-14 01:45:38,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (113 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (112 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (111 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (110 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (109 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (108 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (107 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (106 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (105 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (104 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (103 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (102 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (101 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (100 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (99 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (98 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (97 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (96 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (95 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (94 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (93 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (92 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (91 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (90 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (89 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (88 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (87 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (86 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 300 remaining) [2025-03-14 01:45:38,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (84 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (83 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (82 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (81 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (80 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (79 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (78 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (77 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (76 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (71 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (70 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (65 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (64 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (63 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (62 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (61 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (59 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (58 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 300 remaining) [2025-03-14 01:45:38,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (54 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (53 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (50 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (46 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (43 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (42 of 300 remaining) [2025-03-14 01:45:38,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (41 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (40 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (39 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (38 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (37 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (36 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (35 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (34 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (33 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (32 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (31 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (30 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (29 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (28 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (27 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (21 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (20 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 300 remaining) [2025-03-14 01:45:38,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 300 remaining) [2025-03-14 01:45:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:45:38,634 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] [2025-03-14 01:45:38,638 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:45:38,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:45:38,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:45:38 BasicIcfg [2025-03-14 01:45:38,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:45:38,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:45:38,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:45:38,645 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:45:38,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:16" (3/4) ... [2025-03-14 01:45:38,647 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:45:38,648 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:45:38,648 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:45:38,648 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:45:38,649 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-14 01:45:38,656 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-14 01:45:38,658 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:45:38,659 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-14 01:45:38,659 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:45:38,744 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:45:38,744 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:45:38,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:45:38,745 INFO L158 Benchmark]: Toolchain (without parser) took 24907.09ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 132.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-14 01:45:38,745 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:38,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.77ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 116.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:45:38,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.30ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 110.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:38,746 INFO L158 Benchmark]: Boogie Preprocessor took 58.51ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 106.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:38,746 INFO L158 Benchmark]: IcfgBuilder took 1820.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 50.4MB in the end (delta: 56.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-03-14 01:45:38,746 INFO L158 Benchmark]: TraceAbstraction took 22586.56ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 49.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-14 01:45:38,747 INFO L158 Benchmark]: Witness Printer took 99.67ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:38,747 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 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.77ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 116.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.30ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 110.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.51ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 106.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1820.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 50.4MB in the end (delta: 56.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22586.56ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 49.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 99.67ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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: 115]: 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: 115]: 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: 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: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: 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: 121]: 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: 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: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: 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: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: 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: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 169]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 786 locations, 300 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: 22.3s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 162 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1226occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 4461 NumberOfCodeBlocks, 4461 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4432 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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 164 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:45:38,766 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