./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:01,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:01,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:40:01,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:01,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:01,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:01,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:01,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:01,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:01,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:01,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:01,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:01,696 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:01,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:01,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:01,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:01,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:01,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:01,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:01,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:01,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:01,699 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 [2025-02-08 05:40:01,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:01,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:01,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:01,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:01,935 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:01,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-02-08 05:40:03,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e678069d/f744c99c6b3d45db9db10f5716eb607c/FLAG96aec17d2 [2025-02-08 05:40:03,443 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:03,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2025-02-08 05:40:03,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e678069d/f744c99c6b3d45db9db10f5716eb607c/FLAG96aec17d2 [2025-02-08 05:40:03,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e678069d/f744c99c6b3d45db9db10f5716eb607c [2025-02-08 05:40:03,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:03,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:03,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:03,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:03,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:03,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c881f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03, skipping insertion in model container [2025-02-08 05:40:03,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:03,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:03,695 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:03,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:03,758 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:03,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03 WrapperNode [2025-02-08 05:40:03,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:03,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:03,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:03,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:03,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,833 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 977 [2025-02-08 05:40:03,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:03,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:03,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:03,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:03,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:03,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:03,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:03,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:03,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (1/1) ... [2025-02-08 05:40:03,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:03,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:03,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:40:03,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:40:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:03,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 05:40:03,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 05:40:03,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:03,971 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:04,076 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:04,077 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:04,960 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:04,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:05,525 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:05,525 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:05,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:05 BoogieIcfgContainer [2025-02-08 05:40:05,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:05,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:05,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:05,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:05,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:03" (1/3) ... [2025-02-08 05:40:05,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3ab022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:05, skipping insertion in model container [2025-02-08 05:40:05,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:03" (2/3) ... [2025-02-08 05:40:05,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3ab022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:05, skipping insertion in model container [2025-02-08 05:40:05,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:05" (3/3) ... [2025-02-08 05:40:05,532 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2025-02-08 05:40:05,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:05,545 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-02-08 05:40:05,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:05,712 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:40:05,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 622 transitions, 1272 flow [2025-02-08 05:40:05,948 INFO L124 PetriNetUnfolderBase]: 21/618 cut-off events. [2025-02-08 05:40:05,949 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:05,960 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 18. Compared 1152 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-02-08 05:40:05,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 614 places, 622 transitions, 1272 flow [2025-02-08 05:40:05,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 594 places, 601 transitions, 1226 flow [2025-02-08 05:40:05,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:05,994 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;@36436d4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:05,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 300 error locations. [2025-02-08 05:40:06,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:06,005 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-02-08 05:40:06,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:06,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:06,006 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-02-08 05:40:06,006 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-02-08 05:40:06,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash 57375927, now seen corresponding path program 1 times [2025-02-08 05:40:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71467330] [2025-02-08 05:40:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:06,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:40:06,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:40:06,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:06,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:06,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71467330] [2025-02-08 05:40:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71467330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:06,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:06,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692169250] [2025-02-08 05:40:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:06,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:06,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:06,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:06,219 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-02-08 05:40:06,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:06,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:06,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:07,027 INFO L124 PetriNetUnfolderBase]: 934/3110 cut-off events. [2025-02-08 05:40:07,027 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-02-08 05:40:07,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 3110 events. 934/3110 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23078 event pairs, 578 based on Foata normal form. 613/3436 useless extension candidates. Maximal degree in co-relation 3674. Up to 1248 conditions per place. [2025-02-08 05:40:07,046 INFO L140 encePairwiseOnDemand]: 475/622 looper letters, 24 selfloop transitions, 2 changer transitions 8/456 dead transitions. [2025-02-08 05:40:07,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 456 transitions, 988 flow [2025-02-08 05:40:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2025-02-08 05:40:07,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118971061093248 [2025-02-08 05:40:07,062 INFO L175 Difference]: Start difference. First operand has 594 places, 601 transitions, 1226 flow. Second operand 3 states and 1515 transitions. [2025-02-08 05:40:07,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 456 transitions, 988 flow [2025-02-08 05:40:07,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 972 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:40:07,078 INFO L231 Difference]: Finished difference. Result has 455 places, 448 transitions, 908 flow [2025-02-08 05:40:07,081 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-02-08 05:40:07,083 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -139 predicate places. [2025-02-08 05:40:07,084 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 448 transitions, 908 flow [2025-02-08 05:40:07,085 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-02-08 05:40:07,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:07,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:07,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:07,085 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-02-08 05:40:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -115418236, now seen corresponding path program 1 times [2025-02-08 05:40:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312010865] [2025-02-08 05:40:07,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:07,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:40:07,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:40:07,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:07,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312010865] [2025-02-08 05:40:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312010865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852323590] [2025-02-08 05:40:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:07,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:07,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:07,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:07,166 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-02-08 05:40:07,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:07,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:07,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:07,840 INFO L124 PetriNetUnfolderBase]: 934/3101 cut-off events. [2025-02-08 05:40:07,840 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:40:07,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 3101 events. 934/3101 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23045 event pairs, 578 based on Foata normal form. 0/2823 useless extension candidates. Maximal degree in co-relation 4400. Up to 1248 conditions per place. [2025-02-08 05:40:07,856 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2025-02-08 05:40:07,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 958 flow [2025-02-08 05:40:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:07,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:07,861 INFO L175 Difference]: Start difference. First operand has 455 places, 448 transitions, 908 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:07,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 958 flow [2025-02-08 05:40:07,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:07,867 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 906 flow [2025-02-08 05:40:07,867 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-02-08 05:40:07,868 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -148 predicate places. [2025-02-08 05:40:07,868 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 906 flow [2025-02-08 05:40:07,869 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-02-08 05:40:07,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:07,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:07,869 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-02-08 05:40:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash 878486346, now seen corresponding path program 1 times [2025-02-08 05:40:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870405067] [2025-02-08 05:40:07,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:07,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:40:07,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:40:07,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:07,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870405067] [2025-02-08 05:40:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870405067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:07,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20157354] [2025-02-08 05:40:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:07,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:07,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:07,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:07,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:07,922 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-02-08 05:40:07,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:07,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:07,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:08,487 INFO L124 PetriNetUnfolderBase]: 934/3100 cut-off events. [2025-02-08 05:40:08,488 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:40:08,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 3100 events. 934/3100 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23090 event pairs, 578 based on Foata normal form. 0/2823 useless extension candidates. Maximal degree in co-relation 4391. Up to 1248 conditions per place. [2025-02-08 05:40:08,504 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-02-08 05:40:08,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 446 transitions, 956 flow [2025-02-08 05:40:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:08,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:08,507 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 906 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:08,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 446 transitions, 956 flow [2025-02-08 05:40:08,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 446 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:08,512 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 904 flow [2025-02-08 05:40:08,513 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-02-08 05:40:08,513 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-02-08 05:40:08,514 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 904 flow [2025-02-08 05:40:08,514 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-02-08 05:40:08,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:08,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-02-08 05:40:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:08,515 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-02-08 05:40:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1473256764, now seen corresponding path program 1 times [2025-02-08 05:40:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-02-08 05:40:08,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:08,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:40:08,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:40:08,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:08,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-02-08 05:40:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732473965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:08,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402106251] [2025-02-08 05:40:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:08,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:08,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:08,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:08,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:08,571 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-02-08 05:40:08,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:08,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:08,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:09,158 INFO L124 PetriNetUnfolderBase]: 1031/2523 cut-off events. [2025-02-08 05:40:09,158 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 05:40:09,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 2523 events. 1031/2523 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14577 event pairs, 122 based on Foata normal form. 0/2390 useless extension candidates. Maximal degree in co-relation 3947. Up to 1124 conditions per place. [2025-02-08 05:40:09,174 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 35 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-02-08 05:40:09,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 459 transitions, 1011 flow [2025-02-08 05:40:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1394 transitions. [2025-02-08 05:40:09,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7470525187566989 [2025-02-08 05:40:09,178 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 904 flow. Second operand 3 states and 1394 transitions. [2025-02-08 05:40:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 459 transitions, 1011 flow [2025-02-08 05:40:09,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 459 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:09,185 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 908 flow [2025-02-08 05:40:09,185 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-02-08 05:40:09,186 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-02-08 05:40:09,187 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 908 flow [2025-02-08 05:40:09,187 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-02-08 05:40:09,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:09,188 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-02-08 05:40:09,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:09,188 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-02-08 05:40:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2024628882, now seen corresponding path program 1 times [2025-02-08 05:40:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591887819] [2025-02-08 05:40:09,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:09,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:40:09,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:40:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591887819] [2025-02-08 05:40:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591887819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077045141] [2025-02-08 05:40:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:09,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:09,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:09,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:09,240 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-02-08 05:40:09,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:09,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:09,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:09,880 INFO L124 PetriNetUnfolderBase]: 1023/3374 cut-off events. [2025-02-08 05:40:09,880 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-02-08 05:40:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 3374 events. 1023/3374 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25617 event pairs, 647 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 3582. Up to 1377 conditions per place. [2025-02-08 05:40:09,897 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-02-08 05:40:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 445 transitions, 958 flow [2025-02-08 05:40:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:09,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:09,900 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 908 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 445 transitions, 958 flow [2025-02-08 05:40:09,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:09,905 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 908 flow [2025-02-08 05:40:09,906 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-02-08 05:40:09,906 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2025-02-08 05:40:09,906 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 908 flow [2025-02-08 05:40:09,907 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-02-08 05:40:09,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:09,907 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-02-08 05:40:09,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:09,907 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-02-08 05:40:09,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1495693109, now seen corresponding path program 1 times [2025-02-08 05:40:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210661513] [2025-02-08 05:40:09,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:09,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:40:09,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:40:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210661513] [2025-02-08 05:40:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210661513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:09,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416826657] [2025-02-08 05:40:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:09,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:09,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:09,970 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-02-08 05:40:09,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:09,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:09,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:10,463 INFO L124 PetriNetUnfolderBase]: 1023/3373 cut-off events. [2025-02-08 05:40:10,464 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:40:10,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 3373 events. 1023/3373 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25625 event pairs, 647 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 4854. Up to 1375 conditions per place. [2025-02-08 05:40:10,479 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 23 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2025-02-08 05:40:10,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 444 transitions, 954 flow [2025-02-08 05:40:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-02-08 05:40:10,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-02-08 05:40:10,483 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 908 flow. Second operand 3 states and 1380 transitions. [2025-02-08 05:40:10,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 444 transitions, 954 flow [2025-02-08 05:40:10,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:10,487 INFO L231 Difference]: Finished difference. Result has 444 places, 444 transitions, 904 flow [2025-02-08 05:40:10,488 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-02-08 05:40:10,489 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-02-08 05:40:10,489 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 444 transitions, 904 flow [2025-02-08 05:40:10,489 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-02-08 05:40:10,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:10,490 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-02-08 05:40:10,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:10,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-02-08 05:40:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1750808105, now seen corresponding path program 1 times [2025-02-08 05:40:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:10,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050926536] [2025-02-08 05:40:10,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:10,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:40:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:40:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:10,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050926536] [2025-02-08 05:40:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050926536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237297152] [2025-02-08 05:40:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:10,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:10,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:10,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:11,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 622 [2025-02-08 05:40:11,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 444 transitions, 904 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-02-08 05:40:11,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:11,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 622 [2025-02-08 05:40:11,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:11,607 INFO L124 PetriNetUnfolderBase]: 1023/3369 cut-off events. [2025-02-08 05:40:11,607 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:40:11,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4965 conditions, 3369 events. 1023/3369 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25659 event pairs, 647 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 4899. Up to 1406 conditions per place. [2025-02-08 05:40:11,619 INFO L140 encePairwiseOnDemand]: 598/622 looper letters, 53 selfloop transitions, 20 changer transitions 0/440 dead transitions. [2025-02-08 05:40:11,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1042 flow [2025-02-08 05:40:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2025-02-08 05:40:11,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6634512325830654 [2025-02-08 05:40:11,624 INFO L175 Difference]: Start difference. First operand has 444 places, 444 transitions, 904 flow. Second operand 6 states and 2476 transitions. [2025-02-08 05:40:11,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1042 flow [2025-02-08 05:40:11,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:11,628 INFO L231 Difference]: Finished difference. Result has 444 places, 440 transitions, 935 flow [2025-02-08 05:40:11,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=440} [2025-02-08 05:40:11,629 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2025-02-08 05:40:11,629 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 440 transitions, 935 flow [2025-02-08 05:40:11,631 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-02-08 05:40:11,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:11,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:11,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:11,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE, thread1Err63ASSERT_VIOLATIONDATA_RACE, thread1Err62ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2025-02-08 05:40:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1102363496, now seen corresponding path program 1 times [2025-02-08 05:40:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425024842] [2025-02-08 05:40:11,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:11,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:40:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:40:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425024842] [2025-02-08 05:40:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425024842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79022760] [2025-02-08 05:40:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:11,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:11,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:11,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 440 transitions, 935 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-02-08 05:40:11,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:11,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:11,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:12,180 INFO L124 PetriNetUnfolderBase]: 1023/3368 cut-off events. [2025-02-08 05:40:12,180 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:40:12,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4937 conditions, 3368 events. 1023/3368 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25637 event pairs, 647 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 4873. Up to 1377 conditions per place. [2025-02-08 05:40:12,194 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 24 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2025-02-08 05:40:12,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 985 flow [2025-02-08 05:40:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:12,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:12,197 INFO L175 Difference]: Start difference. First operand has 444 places, 440 transitions, 935 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:12,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 985 flow [2025-02-08 05:40:12,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 945 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:12,203 INFO L231 Difference]: Finished difference. Result has 440 places, 439 transitions, 897 flow [2025-02-08 05:40:12,203 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=440, PETRI_TRANSITIONS=439} [2025-02-08 05:40:12,204 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -154 predicate places. [2025-02-08 05:40:12,204 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 439 transitions, 897 flow [2025-02-08 05:40:12,204 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-02-08 05:40:12,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:12,205 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-02-08 05:40:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:12,205 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-02-08 05:40:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -946004427, now seen corresponding path program 1 times [2025-02-08 05:40:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087892250] [2025-02-08 05:40:12,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:12,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:40:12,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:40:12,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:12,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087892250] [2025-02-08 05:40:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087892250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:12,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:12,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189212600] [2025-02-08 05:40:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:12,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:12,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:12,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:12,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 439 transitions, 897 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-02-08 05:40:12,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:12,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:12,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:12,992 INFO L124 PetriNetUnfolderBase]: 1023/3367 cut-off events. [2025-02-08 05:40:12,993 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-02-08 05:40:13,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4919 conditions, 3367 events. 1023/3367 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 25646 event pairs, 647 based on Foata normal form. 0/3076 useless extension candidates. Maximal degree in co-relation 4852. Up to 1378 conditions per place. [2025-02-08 05:40:13,011 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-02-08 05:40:13,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 949 flow [2025-02-08 05:40:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:13,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:13,014 INFO L175 Difference]: Start difference. First operand has 440 places, 439 transitions, 897 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:13,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 949 flow [2025-02-08 05:40:13,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 438 transitions, 945 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:13,020 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 895 flow [2025-02-08 05:40:13,021 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-02-08 05:40:13,021 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-02-08 05:40:13,021 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 895 flow [2025-02-08 05:40:13,022 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-02-08 05:40:13,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:13,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:13,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:13,022 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-02-08 05:40:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1600694218, now seen corresponding path program 1 times [2025-02-08 05:40:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940796315] [2025-02-08 05:40:13,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:40:13,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:40:13,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:13,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940796315] [2025-02-08 05:40:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940796315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:13,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944334722] [2025-02-08 05:40:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:13,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:13,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:13,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:13,065 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-02-08 05:40:13,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:13,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:13,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:13,620 INFO L124 PetriNetUnfolderBase]: 1293/3813 cut-off events. [2025-02-08 05:40:13,621 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-02-08 05:40:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 3813 events. 1293/3813 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28898 event pairs, 462 based on Foata normal form. 0/3548 useless extension candidates. Maximal degree in co-relation 5678. Up to 939 conditions per place. [2025-02-08 05:40:13,636 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 39 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2025-02-08 05:40:13,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 454 transitions, 1017 flow [2025-02-08 05:40:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-02-08 05:40:13,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-02-08 05:40:13,639 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 895 flow. Second operand 3 states and 1396 transitions. [2025-02-08 05:40:13,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 454 transitions, 1017 flow [2025-02-08 05:40:13,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 454 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:13,643 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 899 flow [2025-02-08 05:40:13,644 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-02-08 05:40:13,644 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-02-08 05:40:13,644 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 899 flow [2025-02-08 05:40:13,645 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-02-08 05:40:13,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:13,645 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-02-08 05:40:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:13,645 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-02-08 05:40:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1409712072, now seen corresponding path program 1 times [2025-02-08 05:40:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524157757] [2025-02-08 05:40:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:13,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:40:13,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:40:13,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:13,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524157757] [2025-02-08 05:40:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524157757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142243462] [2025-02-08 05:40:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:13,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:13,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:13,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:13,684 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-02-08 05:40:13,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:13,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:14,206 INFO L124 PetriNetUnfolderBase]: 1293/3748 cut-off events. [2025-02-08 05:40:14,206 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-02-08 05:40:14,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 3748 events. 1293/3748 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28169 event pairs, 846 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 5880. Up to 1740 conditions per place. [2025-02-08 05:40:14,224 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-02-08 05:40:14,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 437 transitions, 951 flow [2025-02-08 05:40:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:14,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:14,227 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 899 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:14,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 437 transitions, 951 flow [2025-02-08 05:40:14,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 437 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:14,232 INFO L231 Difference]: Finished difference. Result has 439 places, 437 transitions, 899 flow [2025-02-08 05:40:14,232 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-02-08 05:40:14,233 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2025-02-08 05:40:14,233 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 437 transitions, 899 flow [2025-02-08 05:40:14,234 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-02-08 05:40:14,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:14,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:14,234 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-02-08 05:40:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 744948332, now seen corresponding path program 1 times [2025-02-08 05:40:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345815704] [2025-02-08 05:40:14,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:40:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:40:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345815704] [2025-02-08 05:40:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345815704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:14,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:14,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763083967] [2025-02-08 05:40:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:14,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:14,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:14,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:14,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:14,270 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-02-08 05:40:14,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:14,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:14,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:14,769 INFO L124 PetriNetUnfolderBase]: 1293/3747 cut-off events. [2025-02-08 05:40:14,769 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-02-08 05:40:14,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5861 conditions, 3747 events. 1293/3747 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28333 event pairs, 846 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 5793. Up to 1741 conditions per place. [2025-02-08 05:40:14,787 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-02-08 05:40:14,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 436 transitions, 953 flow [2025-02-08 05:40:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:14,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:14,789 INFO L175 Difference]: Start difference. First operand has 439 places, 437 transitions, 899 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:14,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 436 transitions, 953 flow [2025-02-08 05:40:14,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 436 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:14,794 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 897 flow [2025-02-08 05:40:14,795 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-02-08 05:40:14,795 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -156 predicate places. [2025-02-08 05:40:14,795 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 897 flow [2025-02-08 05:40:14,796 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-02-08 05:40:14,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:14,796 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-02-08 05:40:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:14,796 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-02-08 05:40:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash -938137597, now seen corresponding path program 1 times [2025-02-08 05:40:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-02-08 05:40:14,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:14,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:40:14,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:40:14,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:14,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-02-08 05:40:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930461410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715264013] [2025-02-08 05:40:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:14,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:14,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:14,832 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-02-08 05:40:14,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:14,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:15,353 INFO L124 PetriNetUnfolderBase]: 1293/3746 cut-off events. [2025-02-08 05:40:15,354 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-02-08 05:40:15,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 3746 events. 1293/3746 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28218 event pairs, 846 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 5790. Up to 1738 conditions per place. [2025-02-08 05:40:15,367 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 24 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2025-02-08 05:40:15,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 435 transitions, 945 flow [2025-02-08 05:40:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-02-08 05:40:15,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-02-08 05:40:15,370 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 897 flow. Second operand 3 states and 1380 transitions. [2025-02-08 05:40:15,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 435 transitions, 945 flow [2025-02-08 05:40:15,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:15,374 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 893 flow [2025-02-08 05:40:15,375 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-02-08 05:40:15,375 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-02-08 05:40:15,375 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 893 flow [2025-02-08 05:40:15,376 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-02-08 05:40:15,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:15,376 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-02-08 05:40:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:15,376 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-02-08 05:40:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2137327734, now seen corresponding path program 1 times [2025-02-08 05:40:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71498498] [2025-02-08 05:40:15,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:15,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:40:15,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:40:15,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:15,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:15,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71498498] [2025-02-08 05:40:15,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71498498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:15,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:15,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443850111] [2025-02-08 05:40:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:15,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:15,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:15,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:15,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:15,422 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-02-08 05:40:15,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:15,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:15,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:15,962 INFO L124 PetriNetUnfolderBase]: 1293/3745 cut-off events. [2025-02-08 05:40:15,962 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-02-08 05:40:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 3745 events. 1293/3745 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28212 event pairs, 846 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 5789. Up to 1740 conditions per place. [2025-02-08 05:40:15,980 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-02-08 05:40:15,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 434 transitions, 945 flow [2025-02-08 05:40:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:15,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:15,983 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:15,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 434 transitions, 945 flow [2025-02-08 05:40:15,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 944 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:15,988 INFO L231 Difference]: Finished difference. Result has 437 places, 434 transitions, 894 flow [2025-02-08 05:40:15,988 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-02-08 05:40:15,988 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2025-02-08 05:40:15,989 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 434 transitions, 894 flow [2025-02-08 05:40:15,989 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-02-08 05:40:15,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:15,989 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-02-08 05:40:15,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:15,990 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-02-08 05:40:15,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2120537191, now seen corresponding path program 1 times [2025-02-08 05:40:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:15,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122526120] [2025-02-08 05:40:15,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:15,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:15,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-08 05:40:16,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-08 05:40:16,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:16,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122526120] [2025-02-08 05:40:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122526120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425739065] [2025-02-08 05:40:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:16,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:16,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:16,042 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-02-08 05:40:16,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:16,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:16,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:16,543 INFO L124 PetriNetUnfolderBase]: 1293/3744 cut-off events. [2025-02-08 05:40:16,544 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-02-08 05:40:16,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5859 conditions, 3744 events. 1293/3744 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28274 event pairs, 846 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 5791. Up to 1741 conditions per place. [2025-02-08 05:40:16,561 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-02-08 05:40:16,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 948 flow [2025-02-08 05:40:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:16,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:16,563 INFO L175 Difference]: Start difference. First operand has 437 places, 434 transitions, 894 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:16,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 948 flow [2025-02-08 05:40:16,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:16,567 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 892 flow [2025-02-08 05:40:16,568 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-02-08 05:40:16,568 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-02-08 05:40:16,568 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 892 flow [2025-02-08 05:40:16,569 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-02-08 05:40:16,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:16,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:16,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:16,569 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-02-08 05:40:16,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1499281388, now seen corresponding path program 1 times [2025-02-08 05:40:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:16,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002083774] [2025-02-08 05:40:16,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:16,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:40:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:40:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:16,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-02-08 05:40:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002083774] [2025-02-08 05:40:16,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002083774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:16,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:16,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112616205] [2025-02-08 05:40:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:16,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:16,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:16,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:16,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-02-08 05:40:16,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:16,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:17,161 INFO L124 PetriNetUnfolderBase]: 1337/3825 cut-off events. [2025-02-08 05:40:17,162 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2025-02-08 05:40:17,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6038 conditions, 3825 events. 1337/3825 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 28660 event pairs, 224 based on Foata normal form. 0/3571 useless extension candidates. Maximal degree in co-relation 5971. Up to 1310 conditions per place. [2025-02-08 05:40:17,173 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 42 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-02-08 05:40:17,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 451 transitions, 1030 flow [2025-02-08 05:40:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2025-02-08 05:40:17,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7486602357984995 [2025-02-08 05:40:17,175 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 892 flow. Second operand 3 states and 1397 transitions. [2025-02-08 05:40:17,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 451 transitions, 1030 flow [2025-02-08 05:40:17,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 451 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:17,180 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 896 flow [2025-02-08 05:40:17,180 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-02-08 05:40:17,180 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-02-08 05:40:17,180 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 896 flow [2025-02-08 05:40:17,181 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-02-08 05:40:17,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:17,182 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-02-08 05:40:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:17,182 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-02-08 05:40:17,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1917881512, now seen corresponding path program 1 times [2025-02-08 05:40:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487945762] [2025-02-08 05:40:17,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 05:40:17,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 05:40:17,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:17,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:17,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487945762] [2025-02-08 05:40:17,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487945762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:17,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407966607] [2025-02-08 05:40:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:17,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:17,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:17,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:17,223 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-02-08 05:40:17,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:17,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:17,757 INFO L124 PetriNetUnfolderBase]: 1337/3920 cut-off events. [2025-02-08 05:40:17,757 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-02-08 05:40:17,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6539 conditions, 3920 events. 1337/3920 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 29997 event pairs, 890 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6470. Up to 1822 conditions per place. [2025-02-08 05:40:17,776 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-02-08 05:40:17,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 950 flow [2025-02-08 05:40:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:17,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:17,777 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 896 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:17,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 950 flow [2025-02-08 05:40:17,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 432 transitions, 948 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:17,782 INFO L231 Difference]: Finished difference. Result has 436 places, 432 transitions, 896 flow [2025-02-08 05:40:17,782 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-02-08 05:40:17,783 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2025-02-08 05:40:17,783 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 432 transitions, 896 flow [2025-02-08 05:40:17,783 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-02-08 05:40:17,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:17,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:17,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:17,784 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-02-08 05:40:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1098054197, now seen corresponding path program 1 times [2025-02-08 05:40:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:17,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67765440] [2025-02-08 05:40:17,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:17,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:17,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:40:17,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:40:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67765440] [2025-02-08 05:40:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67765440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499521755] [2025-02-08 05:40:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:17,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:17,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:17,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:17,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:17,824 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-02-08 05:40:17,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:17,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:17,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:18,540 INFO L124 PetriNetUnfolderBase]: 1337/3919 cut-off events. [2025-02-08 05:40:18,540 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2025-02-08 05:40:18,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 3919 events. 1337/3919 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30022 event pairs, 890 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6338. Up to 1823 conditions per place. [2025-02-08 05:40:18,558 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-02-08 05:40:18,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 431 transitions, 952 flow [2025-02-08 05:40:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:18,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:18,559 INFO L175 Difference]: Start difference. First operand has 436 places, 432 transitions, 896 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 431 transitions, 952 flow [2025-02-08 05:40:18,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 431 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:18,564 INFO L231 Difference]: Finished difference. Result has 435 places, 431 transitions, 894 flow [2025-02-08 05:40:18,564 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-02-08 05:40:18,564 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -159 predicate places. [2025-02-08 05:40:18,564 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 431 transitions, 894 flow [2025-02-08 05:40:18,565 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-02-08 05:40:18,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,565 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-02-08 05:40:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:18,565 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-02-08 05:40:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 44913256, now seen corresponding path program 1 times [2025-02-08 05:40:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939330263] [2025-02-08 05:40:18,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 05:40:18,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 05:40:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939330263] [2025-02-08 05:40:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939330263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:18,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275860501] [2025-02-08 05:40:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:18,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:18,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:18,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:18,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:18,607 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-02-08 05:40:18,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:18,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:18,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,188 INFO L124 PetriNetUnfolderBase]: 1337/3918 cut-off events. [2025-02-08 05:40:19,188 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-02-08 05:40:19,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6403 conditions, 3918 events. 1337/3918 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 29993 event pairs, 890 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6335. Up to 1820 conditions per place. [2025-02-08 05:40:19,199 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 25 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2025-02-08 05:40:19,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 430 transitions, 944 flow [2025-02-08 05:40:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-02-08 05:40:19,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-02-08 05:40:19,201 INFO L175 Difference]: Start difference. First operand has 435 places, 431 transitions, 894 flow. Second operand 3 states and 1380 transitions. [2025-02-08 05:40:19,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 430 transitions, 944 flow [2025-02-08 05:40:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 430 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:19,205 INFO L231 Difference]: Finished difference. Result has 434 places, 430 transitions, 890 flow [2025-02-08 05:40:19,205 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-02-08 05:40:19,205 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-02-08 05:40:19,205 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 430 transitions, 890 flow [2025-02-08 05:40:19,206 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-02-08 05:40:19,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,206 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-02-08 05:40:19,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:40:19,206 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-02-08 05:40:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash 617923443, now seen corresponding path program 1 times [2025-02-08 05:40:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93770946] [2025-02-08 05:40:19,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:40:19,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:40:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93770946] [2025-02-08 05:40:19,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93770946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408864010] [2025-02-08 05:40:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:19,251 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-02-08 05:40:19,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:19,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,783 INFO L124 PetriNetUnfolderBase]: 1337/3917 cut-off events. [2025-02-08 05:40:19,783 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2025-02-08 05:40:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6403 conditions, 3917 events. 1337/3917 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30044 event pairs, 890 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6334. Up to 1822 conditions per place. [2025-02-08 05:40:19,802 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 26 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-02-08 05:40:19,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 429 transitions, 944 flow [2025-02-08 05:40:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:19,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:19,804 INFO L175 Difference]: Start difference. First operand has 434 places, 430 transitions, 890 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 429 transitions, 944 flow [2025-02-08 05:40:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 429 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:19,808 INFO L231 Difference]: Finished difference. Result has 434 places, 429 transitions, 891 flow [2025-02-08 05:40:19,809 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-02-08 05:40:19,809 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2025-02-08 05:40:19,809 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 429 transitions, 891 flow [2025-02-08 05:40:19,810 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-02-08 05:40:19,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,810 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-02-08 05:40:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:40:19,810 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-02-08 05:40:19,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1352898606, now seen corresponding path program 1 times [2025-02-08 05:40:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802492818] [2025-02-08 05:40:19,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-08 05:40:19,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-08 05:40:19,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802492818] [2025-02-08 05:40:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802492818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813740923] [2025-02-08 05:40:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:19,856 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-02-08 05:40:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:20,406 INFO L124 PetriNetUnfolderBase]: 1337/3916 cut-off events. [2025-02-08 05:40:20,406 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2025-02-08 05:40:20,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 3916 events. 1337/3916 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30034 event pairs, 890 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6336. Up to 1823 conditions per place. [2025-02-08 05:40:20,419 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-02-08 05:40:20,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 428 transitions, 947 flow [2025-02-08 05:40:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:20,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:20,421 INFO L175 Difference]: Start difference. First operand has 434 places, 429 transitions, 891 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:20,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 428 transitions, 947 flow [2025-02-08 05:40:20,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 428 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:20,425 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 889 flow [2025-02-08 05:40:20,426 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-02-08 05:40:20,426 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-02-08 05:40:20,426 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 889 flow [2025-02-08 05:40:20,427 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-02-08 05:40:20,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,427 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-02-08 05:40:20,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:40:20,427 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-02-08 05:40:20,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1559587183, now seen corresponding path program 1 times [2025-02-08 05:40:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403231775] [2025-02-08 05:40:20,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 05:40:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 05:40:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403231775] [2025-02-08 05:40:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403231775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958749197] [2025-02-08 05:40:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:20,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:20,466 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-02-08 05:40:20,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,008 INFO L124 PetriNetUnfolderBase]: 1343/4011 cut-off events. [2025-02-08 05:40:21,008 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2025-02-08 05:40:21,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 4011 events. 1343/4011 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 30608 event pairs, 236 based on Foata normal form. 0/3746 useless extension candidates. Maximal degree in co-relation 6474. Up to 1315 conditions per place. [2025-02-08 05:40:21,028 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 43 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-02-08 05:40:21,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 446 transitions, 1032 flow [2025-02-08 05:40:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-02-08 05:40:21,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7481243301178992 [2025-02-08 05:40:21,030 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 889 flow. Second operand 3 states and 1396 transitions. [2025-02-08 05:40:21,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 446 transitions, 1032 flow [2025-02-08 05:40:21,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 446 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:21,034 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 893 flow [2025-02-08 05:40:21,035 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-02-08 05:40:21,035 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-02-08 05:40:21,035 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 893 flow [2025-02-08 05:40:21,036 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-02-08 05:40:21,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,036 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-02-08 05:40:21,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:40:21,036 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-02-08 05:40:21,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1403453750, now seen corresponding path program 1 times [2025-02-08 05:40:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834922027] [2025-02-08 05:40:21,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 05:40:21,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 05:40:21,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834922027] [2025-02-08 05:40:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834922027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41884095] [2025-02-08 05:40:21,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:21,087 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-02-08 05:40:21,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,634 INFO L124 PetriNetUnfolderBase]: 1343/3994 cut-off events. [2025-02-08 05:40:21,634 INFO L125 PetriNetUnfolderBase]: For 896/896 co-relation queries the response was YES. [2025-02-08 05:40:21,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 3994 events. 1343/3994 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30800 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6892. Up to 1854 conditions per place. [2025-02-08 05:40:21,652 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-02-08 05:40:21,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 427 transitions, 949 flow [2025-02-08 05:40:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:21,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:21,654 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:21,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 427 transitions, 949 flow [2025-02-08 05:40:21,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 427 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,658 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 893 flow [2025-02-08 05:40:21,659 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-02-08 05:40:21,659 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2025-02-08 05:40:21,659 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 893 flow [2025-02-08 05:40:21,660 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-02-08 05:40:21,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,660 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-02-08 05:40:21,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:40:21,660 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-02-08 05:40:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2442284, now seen corresponding path program 1 times [2025-02-08 05:40:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118038570] [2025-02-08 05:40:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:40:21,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:40:21,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118038570] [2025-02-08 05:40:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118038570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799157898] [2025-02-08 05:40:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 622 [2025-02-08 05:40:21,709 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-02-08 05:40:21,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 622 [2025-02-08 05:40:21,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,323 INFO L124 PetriNetUnfolderBase]: 1343/3993 cut-off events. [2025-02-08 05:40:22,323 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2025-02-08 05:40:22,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 3993 events. 1343/3993 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30780 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6749. Up to 1855 conditions per place. [2025-02-08 05:40:22,337 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 28 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-02-08 05:40:22,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 426 transitions, 951 flow [2025-02-08 05:40:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2025-02-08 05:40:22,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347266881028939 [2025-02-08 05:40:22,339 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 893 flow. Second operand 3 states and 1371 transitions. [2025-02-08 05:40:22,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 426 transitions, 951 flow [2025-02-08 05:40:22,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 426 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:22,344 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 891 flow [2025-02-08 05:40:22,344 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-02-08 05:40:22,344 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -162 predicate places. [2025-02-08 05:40:22,344 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 891 flow [2025-02-08 05:40:22,345 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-02-08 05:40:22,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,345 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-02-08 05:40:22,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:40:22,345 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-02-08 05:40:22,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash -567789015, now seen corresponding path program 1 times [2025-02-08 05:40:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-02-08 05:40:22,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-08 05:40:22,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-08 05:40:22,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-02-08 05:40:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429039966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031787029] [2025-02-08 05:40:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:22,386 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-02-08 05:40:22,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,937 INFO L124 PetriNetUnfolderBase]: 1343/3992 cut-off events. [2025-02-08 05:40:22,937 INFO L125 PetriNetUnfolderBase]: For 896/896 co-relation queries the response was YES. [2025-02-08 05:40:22,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 3992 events. 1343/3992 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30839 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6746. Up to 1852 conditions per place. [2025-02-08 05:40:22,955 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 26 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2025-02-08 05:40:22,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 425 transitions, 943 flow [2025-02-08 05:40:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2025-02-08 05:40:22,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395498392282959 [2025-02-08 05:40:22,957 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 891 flow. Second operand 3 states and 1380 transitions. [2025-02-08 05:40:22,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 425 transitions, 943 flow [2025-02-08 05:40:22,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 425 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:22,961 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 887 flow [2025-02-08 05:40:22,961 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-02-08 05:40:22,962 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-02-08 05:40:22,962 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 887 flow [2025-02-08 05:40:22,962 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-02-08 05:40:22,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:22,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:40:22,963 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-02-08 05:40:22,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash -615923452, now seen corresponding path program 1 times [2025-02-08 05:40:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032168203] [2025-02-08 05:40:22,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:40:22,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:40:22,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032168203] [2025-02-08 05:40:23,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032168203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199149011] [2025-02-08 05:40:23,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:23,007 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-02-08 05:40:23,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:23,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,594 INFO L124 PetriNetUnfolderBase]: 1343/3991 cut-off events. [2025-02-08 05:40:23,594 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2025-02-08 05:40:23,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 3991 events. 1343/3991 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30836 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6745. Up to 1854 conditions per place. [2025-02-08 05:40:23,611 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-02-08 05:40:23,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 424 transitions, 943 flow [2025-02-08 05:40:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:23,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:23,613 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 887 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:23,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 424 transitions, 943 flow [2025-02-08 05:40:23,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:23,617 INFO L231 Difference]: Finished difference. Result has 431 places, 424 transitions, 888 flow [2025-02-08 05:40:23,617 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-02-08 05:40:23,617 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2025-02-08 05:40:23,617 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 424 transitions, 888 flow [2025-02-08 05:40:23,618 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-02-08 05:40:23,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,618 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-02-08 05:40:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:40:23,618 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-02-08 05:40:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2123403658, now seen corresponding path program 1 times [2025-02-08 05:40:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640861999] [2025-02-08 05:40:23,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-08 05:40:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-08 05:40:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640861999] [2025-02-08 05:40:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640861999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436543295] [2025-02-08 05:40:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:23,664 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-02-08 05:40:23,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:23,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,238 INFO L124 PetriNetUnfolderBase]: 1343/3990 cut-off events. [2025-02-08 05:40:24,238 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2025-02-08 05:40:24,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 3990 events. 1343/3990 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 30861 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6746. Up to 1854 conditions per place. [2025-02-08 05:40:24,262 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-02-08 05:40:24,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 423 transitions, 944 flow [2025-02-08 05:40:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:24,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:24,264 INFO L175 Difference]: Start difference. First operand has 431 places, 424 transitions, 888 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:24,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 423 transitions, 944 flow [2025-02-08 05:40:24,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 423 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:24,269 INFO L231 Difference]: Finished difference. Result has 430 places, 423 transitions, 886 flow [2025-02-08 05:40:24,269 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-02-08 05:40:24,269 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -164 predicate places. [2025-02-08 05:40:24,269 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 423 transitions, 886 flow [2025-02-08 05:40:24,270 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-02-08 05:40:24,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,270 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-02-08 05:40:24,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:40:24,270 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-02-08 05:40:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1395032994, now seen corresponding path program 1 times [2025-02-08 05:40:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193334743] [2025-02-08 05:40:24,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-08 05:40:24,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-08 05:40:24,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193334743] [2025-02-08 05:40:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193334743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197779090] [2025-02-08 05:40:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:24,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:24,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 622 [2025-02-08 05:40:24,320 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-02-08 05:40:24,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 622 [2025-02-08 05:40:24,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,078 INFO L124 PetriNetUnfolderBase]: 1343/3989 cut-off events. [2025-02-08 05:40:25,078 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2025-02-08 05:40:25,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 3989 events. 1343/3989 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 30862 event pairs, 908 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 6745. Up to 1854 conditions per place. [2025-02-08 05:40:25,096 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 27 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-02-08 05:40:25,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 422 transitions, 942 flow [2025-02-08 05:40:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2025-02-08 05:40:25,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7357984994640944 [2025-02-08 05:40:25,098 INFO L175 Difference]: Start difference. First operand has 430 places, 423 transitions, 886 flow. Second operand 3 states and 1373 transitions. [2025-02-08 05:40:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 422 transitions, 942 flow [2025-02-08 05:40:25,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 422 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,102 INFO L231 Difference]: Finished difference. Result has 429 places, 422 transitions, 884 flow [2025-02-08 05:40:25,102 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-02-08 05:40:25,102 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -165 predicate places. [2025-02-08 05:40:25,102 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 422 transitions, 884 flow [2025-02-08 05:40:25,103 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-02-08 05:40:25,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,103 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-02-08 05:40:25,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:40:25,103 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-02-08 05:40:25,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1623619769, now seen corresponding path program 1 times [2025-02-08 05:40:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605859357] [2025-02-08 05:40:25,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-08 05:40:25,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-08 05:40:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605859357] [2025-02-08 05:40:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605859357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:25,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650522121] [2025-02-08 05:40:25,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:25,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:25,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:25,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 622 [2025-02-08 05:40:25,155 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-02-08 05:40:25,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 622 [2025-02-08 05:40:25,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,715 INFO L124 PetriNetUnfolderBase]: 1343/3973 cut-off events. [2025-02-08 05:40:25,715 INFO L125 PetriNetUnfolderBase]: For 895/895 co-relation queries the response was YES. [2025-02-08 05:40:25,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 3973 events. 1343/3973 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 30702 event pairs, 908 based on Foata normal form. 16/3698 useless extension candidates. Maximal degree in co-relation 6741. Up to 1852 conditions per place. [2025-02-08 05:40:25,729 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 0 selfloop transitions, 0 changer transitions 421/421 dead transitions. [2025-02-08 05:40:25,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 421 transitions, 934 flow [2025-02-08 05:40:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2025-02-08 05:40:25,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7390139335476956 [2025-02-08 05:40:25,731 INFO L175 Difference]: Start difference. First operand has 429 places, 422 transitions, 884 flow. Second operand 3 states and 1379 transitions. [2025-02-08 05:40:25,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 421 transitions, 934 flow [2025-02-08 05:40:25,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 421 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:25,734 INFO L231 Difference]: Finished difference. Result has 428 places, 0 transitions, 0 flow [2025-02-08 05:40:25,735 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-02-08 05:40:25,735 INFO L279 CegarLoopForPetriNet]: 594 programPoint places, -166 predicate places. [2025-02-08 05:40:25,735 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 0 transitions, 0 flow [2025-02-08 05:40:25,736 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-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (299 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (298 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (297 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (296 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (295 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (294 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (293 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (292 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (291 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (290 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (289 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (288 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (287 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (286 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (285 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (284 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (283 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (282 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (281 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (280 of 300 remaining) [2025-02-08 05:40:25,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (279 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (278 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (277 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (276 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (275 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (274 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (273 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (272 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (271 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (270 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (269 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (268 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (267 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (266 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (265 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (264 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (263 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (262 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (261 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (260 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (259 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (258 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (257 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (256 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (255 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (254 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (253 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (252 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (251 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (250 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (249 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (248 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (247 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (246 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (245 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (244 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (243 of 300 remaining) [2025-02-08 05:40:25,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (242 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (241 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (240 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (239 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (238 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (237 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (236 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (235 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (234 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (233 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (232 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (231 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (230 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (229 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (228 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (227 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (226 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (225 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (224 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (223 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (222 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (221 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (220 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (219 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (218 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (217 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (216 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (215 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (214 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (213 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (212 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (211 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (210 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (209 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (208 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (207 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (206 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (205 of 300 remaining) [2025-02-08 05:40:25,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (204 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (203 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (202 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (201 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (200 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (199 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (198 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (197 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (196 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (195 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (194 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (193 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (192 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (191 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (190 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (189 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (188 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (187 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (186 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (185 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (184 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (183 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (182 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (181 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (180 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (179 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (178 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (177 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (176 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (175 of 300 remaining) [2025-02-08 05:40:25,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (174 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (173 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (172 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (171 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (170 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (169 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (168 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (167 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (166 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (165 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (164 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (163 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (162 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (161 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (160 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (159 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (158 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (157 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (156 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (155 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (154 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (153 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (152 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (151 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (150 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (149 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (148 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (147 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (146 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (145 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (144 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (143 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (142 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (141 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (140 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (139 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (138 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (137 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (136 of 300 remaining) [2025-02-08 05:40:25,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (135 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (134 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (133 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (132 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (131 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (130 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (129 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (128 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (127 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (126 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (125 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (124 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (123 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (122 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (121 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (120 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (119 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (118 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (117 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (116 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (115 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (114 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (113 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (112 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (111 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (110 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (109 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (108 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (107 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (106 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (105 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (104 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (103 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (102 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (101 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (100 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (99 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (98 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (97 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (96 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (95 of 300 remaining) [2025-02-08 05:40:25,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (94 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (93 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (92 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (91 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (90 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (89 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (88 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (87 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (86 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (84 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (83 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (82 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (81 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (80 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (79 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (78 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (77 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (76 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (71 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (70 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (65 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (64 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (63 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (62 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (61 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (59 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (58 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 300 remaining) [2025-02-08 05:40:25,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (54 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (53 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (50 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (46 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (43 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (42 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (41 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (40 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (39 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (38 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (37 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (36 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (35 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (34 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (33 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (32 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (31 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (30 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (29 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (28 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (27 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (21 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (20 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 300 remaining) [2025-02-08 05:40:25,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 300 remaining) [2025-02-08 05:40:25,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 300 remaining) [2025-02-08 05:40:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:40:25,746 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-02-08 05:40:25,751 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:25,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:25,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:25 BasicIcfg [2025-02-08 05:40:25,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:25,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:25,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:25,757 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:25,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:05" (3/4) ... [2025-02-08 05:40:25,759 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:25,761 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:25,761 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:25,761 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:25,761 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-08 05:40:25,766 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-02-08 05:40:25,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:25,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:40:25,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:25,841 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:25,841 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:25,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:25,842 INFO L158 Benchmark]: Toolchain (without parser) took 22369.97ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 113.6MB in the beginning and 967.9MB in the end (delta: -854.2MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-02-08 05:40:25,842 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:25,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.35ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.83ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 91.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:25,842 INFO L158 Benchmark]: Boogie Preprocessor took 76.37ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.6MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,842 INFO L158 Benchmark]: IcfgBuilder took 1611.47ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 57.2MB in the end (delta: 30.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,843 INFO L158 Benchmark]: TraceAbstraction took 20229.27ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 57.2MB in the beginning and 976.3MB in the end (delta: -919.1MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-08 05:40:25,843 INFO L158 Benchmark]: Witness Printer took 84.33ms. Allocated memory is still 2.4GB. Free memory was 976.3MB in the beginning and 967.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,844 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.35ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 97.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.83ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 91.7MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.37ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.6MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1611.47ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 57.2MB in the end (delta: 30.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20229.27ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 57.2MB in the beginning and 976.3MB in the end (delta: -919.1MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 84.33ms. Allocated memory is still 2.4GB. Free memory was 976.3MB in the beginning and 967.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 20.0s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1639 IncrementalHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 87 mSDtfsCounter, 1639 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.1s 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-02-08 05:40:25,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE