./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:06:49,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:06:49,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:06:49,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:06:49,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:06:49,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:06:49,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:06:49,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:06:49,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:06:49,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:06:49,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:06:49,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:06:49,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:06:49,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:06:49,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:06:49,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:06:49,461 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2025-03-08 22:06:49,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:06:49,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:06:49,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:06:49,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:06:49,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:06:49,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-08 22:06:50,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6053d8a4/3c54cfb673e54170afa0fa177902cb6f/FLAGcf7158ee9 [2025-03-08 22:06:51,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:06:51,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-08 22:06:51,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6053d8a4/3c54cfb673e54170afa0fa177902cb6f/FLAGcf7158ee9 [2025-03-08 22:06:51,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6053d8a4/3c54cfb673e54170afa0fa177902cb6f [2025-03-08 22:06:51,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:06:51,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:06:51,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:06:51,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:06:51,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:06:51,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352846ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51, skipping insertion in model container [2025-03-08 22:06:51,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:06:51,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:06:51,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:06:51,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:06:51,399 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:06:51,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51 WrapperNode [2025-03-08 22:06:51,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:06:51,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:06:51,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:06:51,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:06:51,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,446 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 1037 [2025-03-08 22:06:51,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:06:51,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:06:51,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:06:51,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:06:51,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:06:51,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:06:51,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:06:51,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:06:51,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (1/1) ... [2025-03-08 22:06:51,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:06:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:06:51,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:06:51,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:06:51,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:06:51,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:06:51,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-08 22:06:51,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:06:51,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:06:51,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 22:06:51,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 22:06:51,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:06:51,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:06:51,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:06:51,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:06:51,559 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:06:51,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:06:51,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:06:52,685 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:06:52,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:06:53,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:06:53,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:06:53,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:53 BoogieIcfgContainer [2025-03-08 22:06:53,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:06:53,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:06:53,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:06:53,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:06:53,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:06:51" (1/3) ... [2025-03-08 22:06:53,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d294f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:06:53, skipping insertion in model container [2025-03-08 22:06:53,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:51" (2/3) ... [2025-03-08 22:06:53,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d294f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:06:53, skipping insertion in model container [2025-03-08 22:06:53,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:53" (3/3) ... [2025-03-08 22:06:53,254 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-03-08 22:06:53,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:06:53,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 656 locations, 1 initial locations, 8 loop locations, and 182 error locations. [2025-03-08 22:06:53,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:06:53,468 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 22:06:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 668 places, 688 transitions, 1404 flow [2025-03-08 22:06:53,721 INFO L124 PetriNetUnfolderBase]: 33/684 cut-off events. [2025-03-08 22:06:53,724 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:06:53,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 684 events. 33/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1648 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 620. Up to 8 conditions per place. [2025-03-08 22:06:53,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 668 places, 688 transitions, 1404 flow [2025-03-08 22:06:53,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 648 places, 667 transitions, 1358 flow [2025-03-08 22:06:53,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:06:53,773 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;@24ef06bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:06:53,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 336 error locations. [2025-03-08 22:06:53,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:06:53,782 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2025-03-08 22:06:53,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:06:53,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:53,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] [2025-03-08 22:06:53,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:53,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1945137658, now seen corresponding path program 1 times [2025-03-08 22:06:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571165600] [2025-03-08 22:06:53,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:53,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:06:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:06:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571165600] [2025-03-08 22:06:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571165600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:53,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121774285] [2025-03-08 22:06:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:53,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:53,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:53,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:53,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 667 transitions, 1358 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:54,199 INFO L124 PetriNetUnfolderBase]: 56/552 cut-off events. [2025-03-08 22:06:54,200 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:06:54,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 552 events. 56/552 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 607 event pairs, 0 based on Foata normal form. 24/489 useless extension candidates. Maximal degree in co-relation 539. Up to 61 conditions per place. [2025-03-08 22:06:54,205 INFO L140 encePairwiseOnDemand]: 535/688 looper letters, 24 selfloop transitions, 2 changer transitions 8/516 dead transitions. [2025-03-08 22:06:54,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 516 transitions, 1108 flow [2025-03-08 22:06:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1701 transitions. [2025-03-08 22:06:54,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8241279069767442 [2025-03-08 22:06:54,219 INFO L175 Difference]: Start difference. First operand has 648 places, 667 transitions, 1358 flow. Second operand 3 states and 1701 transitions. [2025-03-08 22:06:54,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 516 transitions, 1108 flow [2025-03-08 22:06:54,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 516 transitions, 1092 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-08 22:06:54,231 INFO L231 Difference]: Finished difference. Result has 503 places, 508 transitions, 1028 flow [2025-03-08 22:06:54,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=501, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=503, PETRI_TRANSITIONS=508} [2025-03-08 22:06:54,238 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -145 predicate places. [2025-03-08 22:06:54,238 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 508 transitions, 1028 flow [2025-03-08 22:06:54,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:54,239 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] [2025-03-08 22:06:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:06:54,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1998092760, now seen corresponding path program 1 times [2025-03-08 22:06:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648515563] [2025-03-08 22:06:54,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:06:54,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:06:54,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648515563] [2025-03-08 22:06:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648515563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669216208] [2025-03-08 22:06:54,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:54,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:54,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:54,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:54,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:54,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 508 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:54,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:54,437 INFO L124 PetriNetUnfolderBase]: 56/543 cut-off events. [2025-03-08 22:06:54,437 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:06:54,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 543 events. 56/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 568. Up to 61 conditions per place. [2025-03-08 22:06:54,441 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 24 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-03-08 22:06:54,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 507 transitions, 1078 flow [2025-03-08 22:06:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:54,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:54,444 INFO L175 Difference]: Start difference. First operand has 503 places, 508 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:54,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 507 transitions, 1078 flow [2025-03-08 22:06:54,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 507 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:54,456 INFO L231 Difference]: Finished difference. Result has 494 places, 507 transitions, 1026 flow [2025-03-08 22:06:54,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=494, PETRI_TRANSITIONS=507} [2025-03-08 22:06:54,458 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -154 predicate places. [2025-03-08 22:06:54,458 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 507 transitions, 1026 flow [2025-03-08 22:06:54,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:54,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:54,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:06:54,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:54,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1754233098, now seen corresponding path program 1 times [2025-03-08 22:06:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104980150] [2025-03-08 22:06:54,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:54,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:06:54,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:06:54,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:54,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104980150] [2025-03-08 22:06:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104980150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:54,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185442373] [2025-03-08 22:06:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:54,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:54,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:54,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 507 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:54,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:54,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:54,683 INFO L124 PetriNetUnfolderBase]: 56/542 cut-off events. [2025-03-08 22:06:54,684 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:06:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 542 events. 56/542 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 589 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 559. Up to 61 conditions per place. [2025-03-08 22:06:54,687 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 24 selfloop transitions, 2 changer transitions 0/506 dead transitions. [2025-03-08 22:06:54,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 506 transitions, 1076 flow [2025-03-08 22:06:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:54,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:54,691 INFO L175 Difference]: Start difference. First operand has 494 places, 507 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:54,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 506 transitions, 1076 flow [2025-03-08 22:06:54,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 506 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:54,698 INFO L231 Difference]: Finished difference. Result has 493 places, 506 transitions, 1024 flow [2025-03-08 22:06:54,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=493, PETRI_TRANSITIONS=506} [2025-03-08 22:06:54,700 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-08 22:06:54,700 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 506 transitions, 1024 flow [2025-03-08 22:06:54,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:54,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:54,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:06:54,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 933137562, now seen corresponding path program 1 times [2025-03-08 22:06:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31611828] [2025-03-08 22:06:54,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:54,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:06:54,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:06:54,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:54,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31611828] [2025-03-08 22:06:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31611828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:54,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:54,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538691710] [2025-03-08 22:06:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:54,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:54,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:54,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:54,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 506 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:54,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:54,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:54,925 INFO L124 PetriNetUnfolderBase]: 107/750 cut-off events. [2025-03-08 22:06:54,925 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:06:54,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 750 events. 107/750 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1624 event pairs, 0 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 814. Up to 69 conditions per place. [2025-03-08 22:06:54,934 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 38 selfloop transitions, 4 changer transitions 0/524 dead transitions. [2025-03-08 22:06:54,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 524 transitions, 1151 flow [2025-03-08 22:06:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1579 transitions. [2025-03-08 22:06:54,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7650193798449613 [2025-03-08 22:06:54,938 INFO L175 Difference]: Start difference. First operand has 493 places, 506 transitions, 1024 flow. Second operand 3 states and 1579 transitions. [2025-03-08 22:06:54,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 524 transitions, 1151 flow [2025-03-08 22:06:54,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 524 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:54,946 INFO L231 Difference]: Finished difference. Result has 493 places, 508 transitions, 1042 flow [2025-03-08 22:06:54,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=493, PETRI_TRANSITIONS=508} [2025-03-08 22:06:54,947 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-08 22:06:54,947 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 508 transitions, 1042 flow [2025-03-08 22:06:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:54,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:54,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:06:54,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -85464889, now seen corresponding path program 1 times [2025-03-08 22:06:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042455531] [2025-03-08 22:06:54,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:54,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:06:54,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:06:54,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:54,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042455531] [2025-03-08 22:06:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042455531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551839744] [2025-03-08 22:06:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:55,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:55,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 508 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:55,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:55,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:55,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:55,173 INFO L124 PetriNetUnfolderBase]: 107/701 cut-off events. [2025-03-08 22:06:55,173 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-08 22:06:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 701 events. 107/701 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1401 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 523. Up to 115 conditions per place. [2025-03-08 22:06:55,178 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 26 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2025-03-08 22:06:55,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 507 transitions, 1096 flow [2025-03-08 22:06:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:55,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:55,183 INFO L175 Difference]: Start difference. First operand has 493 places, 508 transitions, 1042 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:55,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 507 transitions, 1096 flow [2025-03-08 22:06:55,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 507 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:55,189 INFO L231 Difference]: Finished difference. Result has 493 places, 507 transitions, 1040 flow [2025-03-08 22:06:55,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=493, PETRI_TRANSITIONS=507} [2025-03-08 22:06:55,191 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -155 predicate places. [2025-03-08 22:06:55,191 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 507 transitions, 1040 flow [2025-03-08 22:06:55,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:55,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:55,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:06:55,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 833883284, now seen corresponding path program 1 times [2025-03-08 22:06:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493711550] [2025-03-08 22:06:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:55,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:06:55,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:06:55,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:55,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493711550] [2025-03-08 22:06:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493711550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152374261] [2025-03-08 22:06:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:55,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:55,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:55,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:55,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:55,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 507 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:55,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:55,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:55,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:55,358 INFO L124 PetriNetUnfolderBase]: 107/700 cut-off events. [2025-03-08 22:06:55,358 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:06:55,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 700 events. 107/700 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1403 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 781. Up to 113 conditions per place. [2025-03-08 22:06:55,367 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 25 selfloop transitions, 1 changer transitions 0/506 dead transitions. [2025-03-08 22:06:55,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 506 transitions, 1090 flow [2025-03-08 22:06:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-08 22:06:55,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-08 22:06:55,371 INFO L175 Difference]: Start difference. First operand has 493 places, 507 transitions, 1040 flow. Second operand 3 states and 1560 transitions. [2025-03-08 22:06:55,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 506 transitions, 1090 flow [2025-03-08 22:06:55,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 506 transitions, 1086 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:55,378 INFO L231 Difference]: Finished difference. Result has 492 places, 506 transitions, 1036 flow [2025-03-08 22:06:55,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=492, PETRI_TRANSITIONS=506} [2025-03-08 22:06:55,381 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-03-08 22:06:55,381 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 506 transitions, 1036 flow [2025-03-08 22:06:55,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:55,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:55,382 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] [2025-03-08 22:06:55,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:06:55,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash 494101836, now seen corresponding path program 1 times [2025-03-08 22:06:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874155498] [2025-03-08 22:06:55,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:55,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:06:55,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:06:55,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:55,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:55,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874155498] [2025-03-08 22:06:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874155498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:55,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:55,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:55,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717419853] [2025-03-08 22:06:55,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:55,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:55,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:56,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 688 [2025-03-08 22:06:56,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 506 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:56,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 688 [2025-03-08 22:06:56,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:56,493 INFO L124 PetriNetUnfolderBase]: 107/696 cut-off events. [2025-03-08 22:06:56,493 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:06:56,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 696 events. 107/696 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1379 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 826. Up to 144 conditions per place. [2025-03-08 22:06:56,499 INFO L140 encePairwiseOnDemand]: 664/688 looper letters, 55 selfloop transitions, 20 changer transitions 0/502 dead transitions. [2025-03-08 22:06:56,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 502 transitions, 1178 flow [2025-03-08 22:06:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2836 transitions. [2025-03-08 22:06:56,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.687015503875969 [2025-03-08 22:06:56,504 INFO L175 Difference]: Start difference. First operand has 492 places, 506 transitions, 1036 flow. Second operand 6 states and 2836 transitions. [2025-03-08 22:06:56,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 502 transitions, 1178 flow [2025-03-08 22:06:56,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 502 transitions, 1177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:56,510 INFO L231 Difference]: Finished difference. Result has 492 places, 502 transitions, 1067 flow [2025-03-08 22:06:56,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1067, PETRI_PLACES=492, PETRI_TRANSITIONS=502} [2025-03-08 22:06:56,513 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -156 predicate places. [2025-03-08 22:06:56,513 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 502 transitions, 1067 flow [2025-03-08 22:06:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 461.5) internal successors, (2769), 6 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:56,515 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] [2025-03-08 22:06:56,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:06:56,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:56,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1644350553, now seen corresponding path program 1 times [2025-03-08 22:06:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240907963] [2025-03-08 22:06:56,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:56,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 22:06:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 22:06:56,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:56,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:56,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240907963] [2025-03-08 22:06:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240907963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431054888] [2025-03-08 22:06:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:56,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:56,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:56,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:56,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:56,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 502 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:56,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:56,705 INFO L124 PetriNetUnfolderBase]: 107/695 cut-off events. [2025-03-08 22:06:56,705 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:06:56,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 695 events. 107/695 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1372 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 804. Up to 115 conditions per place. [2025-03-08 22:06:56,711 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 26 selfloop transitions, 2 changer transitions 0/501 dead transitions. [2025-03-08 22:06:56,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 501 transitions, 1121 flow [2025-03-08 22:06:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:56,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:56,715 INFO L175 Difference]: Start difference. First operand has 492 places, 502 transitions, 1067 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:56,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 501 transitions, 1121 flow [2025-03-08 22:06:56,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 501 transitions, 1081 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:56,721 INFO L231 Difference]: Finished difference. Result has 488 places, 501 transitions, 1029 flow [2025-03-08 22:06:56,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=488, PETRI_TRANSITIONS=501} [2025-03-08 22:06:56,723 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -160 predicate places. [2025-03-08 22:06:56,723 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 501 transitions, 1029 flow [2025-03-08 22:06:56,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:56,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:06:56,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:56,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1703975240, now seen corresponding path program 1 times [2025-03-08 22:06:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681929499] [2025-03-08 22:06:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:56,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 22:06:56,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 22:06:56,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:56,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681929499] [2025-03-08 22:06:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681929499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:56,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835222850] [2025-03-08 22:06:56,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:56,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:56,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:56,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:56,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:56,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 501 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:56,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:56,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:56,891 INFO L124 PetriNetUnfolderBase]: 107/694 cut-off events. [2025-03-08 22:06:56,891 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:06:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 694 events. 107/694 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1361 event pairs, 3 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 779. Up to 116 conditions per place. [2025-03-08 22:06:56,897 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/500 dead transitions. [2025-03-08 22:06:56,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 500 transitions, 1085 flow [2025-03-08 22:06:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:56,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:56,901 INFO L175 Difference]: Start difference. First operand has 488 places, 501 transitions, 1029 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:56,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 500 transitions, 1085 flow [2025-03-08 22:06:56,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 500 transitions, 1081 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:56,907 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1027 flow [2025-03-08 22:06:56,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-03-08 22:06:56,908 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-08 22:06:56,908 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1027 flow [2025-03-08 22:06:56,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:56,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:56,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:06:56,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:56,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1827849042, now seen corresponding path program 1 times [2025-03-08 22:06:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:56,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264859296] [2025-03-08 22:06:56,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:56,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:06:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:06:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:56,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264859296] [2025-03-08 22:06:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264859296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:56,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:56,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420483311] [2025-03-08 22:06:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:56,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:56,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:56,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:56,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:56,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:56,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:56,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:56,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:57,115 INFO L124 PetriNetUnfolderBase]: 161/897 cut-off events. [2025-03-08 22:06:57,116 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-08 22:06:57,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 897 events. 161/897 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2203 event pairs, 3 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1042. Up to 105 conditions per place. [2025-03-08 22:06:57,125 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 43 selfloop transitions, 2 changer transitions 0/518 dead transitions. [2025-03-08 22:06:57,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 518 transitions, 1169 flow [2025-03-08 22:06:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1576 transitions. [2025-03-08 22:06:57,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7635658914728682 [2025-03-08 22:06:57,128 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1027 flow. Second operand 3 states and 1576 transitions. [2025-03-08 22:06:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 518 transitions, 1169 flow [2025-03-08 22:06:57,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 518 transitions, 1165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:57,134 INFO L231 Difference]: Finished difference. Result has 487 places, 500 transitions, 1031 flow [2025-03-08 22:06:57,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=500} [2025-03-08 22:06:57,136 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-08 22:06:57,136 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 500 transitions, 1031 flow [2025-03-08 22:06:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:57,137 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] [2025-03-08 22:06:57,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:06:57,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1593365339, now seen corresponding path program 1 times [2025-03-08 22:06:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123947885] [2025-03-08 22:06:57,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:57,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:06:57,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:06:57,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:57,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123947885] [2025-03-08 22:06:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123947885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447255509] [2025-03-08 22:06:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:57,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:57,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:57,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:57,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:57,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 500 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:57,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:57,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:57,314 INFO L124 PetriNetUnfolderBase]: 155/788 cut-off events. [2025-03-08 22:06:57,315 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-08 22:06:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 788 events. 155/788 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1708 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 957. Up to 171 conditions per place. [2025-03-08 22:06:57,325 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-03-08 22:06:57,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 499 transitions, 1087 flow [2025-03-08 22:06:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:57,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:57,328 INFO L175 Difference]: Start difference. First operand has 487 places, 500 transitions, 1031 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:57,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 499 transitions, 1087 flow [2025-03-08 22:06:57,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 499 transitions, 1085 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:57,334 INFO L231 Difference]: Finished difference. Result has 487 places, 499 transitions, 1031 flow [2025-03-08 22:06:57,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=487, PETRI_TRANSITIONS=499} [2025-03-08 22:06:57,335 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -161 predicate places. [2025-03-08 22:06:57,335 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 499 transitions, 1031 flow [2025-03-08 22:06:57,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:57,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:57,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:06:57,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 942960737, now seen corresponding path program 1 times [2025-03-08 22:06:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064173386] [2025-03-08 22:06:57,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 22:06:57,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 22:06:57,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:57,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:57,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064173386] [2025-03-08 22:06:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064173386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:57,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283022625] [2025-03-08 22:06:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:57,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:57,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:57,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 499 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:57,524 INFO L124 PetriNetUnfolderBase]: 155/787 cut-off events. [2025-03-08 22:06:57,524 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 22:06:57,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 787 events. 155/787 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1698 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 951. Up to 172 conditions per place. [2025-03-08 22:06:57,533 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/498 dead transitions. [2025-03-08 22:06:57,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 498 transitions, 1089 flow [2025-03-08 22:06:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:57,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:57,536 INFO L175 Difference]: Start difference. First operand has 487 places, 499 transitions, 1031 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 498 transitions, 1089 flow [2025-03-08 22:06:57,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 498 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:57,544 INFO L231 Difference]: Finished difference. Result has 486 places, 498 transitions, 1029 flow [2025-03-08 22:06:57,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=486, PETRI_TRANSITIONS=498} [2025-03-08 22:06:57,546 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -162 predicate places. [2025-03-08 22:06:57,546 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 498 transitions, 1029 flow [2025-03-08 22:06:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:57,547 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] [2025-03-08 22:06:57,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:06:57,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:57,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 857870555, now seen corresponding path program 1 times [2025-03-08 22:06:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152837222] [2025-03-08 22:06:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:57,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 22:06:57,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 22:06:57,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152837222] [2025-03-08 22:06:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152837222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:57,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:57,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:57,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603845462] [2025-03-08 22:06:57,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:57,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:57,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:57,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:57,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:57,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 498 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:57,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:57,723 INFO L124 PetriNetUnfolderBase]: 155/786 cut-off events. [2025-03-08 22:06:57,723 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-08 22:06:57,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 786 events. 155/786 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1692 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 948. Up to 169 conditions per place. [2025-03-08 22:06:57,733 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 26 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2025-03-08 22:06:57,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 497 transitions, 1081 flow [2025-03-08 22:06:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-08 22:06:57,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-08 22:06:57,736 INFO L175 Difference]: Start difference. First operand has 486 places, 498 transitions, 1029 flow. Second operand 3 states and 1560 transitions. [2025-03-08 22:06:57,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 497 transitions, 1081 flow [2025-03-08 22:06:57,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 497 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:57,743 INFO L231 Difference]: Finished difference. Result has 485 places, 497 transitions, 1025 flow [2025-03-08 22:06:57,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=485, PETRI_TRANSITIONS=497} [2025-03-08 22:06:57,744 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-03-08 22:06:57,744 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 497 transitions, 1025 flow [2025-03-08 22:06:57,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:57,745 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] [2025-03-08 22:06:57,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:06:57,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:57,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -715790086, now seen corresponding path program 1 times [2025-03-08 22:06:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364580457] [2025-03-08 22:06:57,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:57,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 22:06:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:06:57,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:57,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:57,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364580457] [2025-03-08 22:06:57,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364580457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:57,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:57,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313453888] [2025-03-08 22:06:57,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:57,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:57,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:57,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:57,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:57,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 497 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:57,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:57,964 INFO L124 PetriNetUnfolderBase]: 155/785 cut-off events. [2025-03-08 22:06:57,964 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 22:06:57,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 785 events. 155/785 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1679 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 947. Up to 171 conditions per place. [2025-03-08 22:06:57,973 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 27 selfloop transitions, 2 changer transitions 0/496 dead transitions. [2025-03-08 22:06:57,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 496 transitions, 1081 flow [2025-03-08 22:06:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:57,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:57,977 INFO L175 Difference]: Start difference. First operand has 485 places, 497 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:57,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 496 transitions, 1081 flow [2025-03-08 22:06:57,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 496 transitions, 1080 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:57,984 INFO L231 Difference]: Finished difference. Result has 485 places, 496 transitions, 1026 flow [2025-03-08 22:06:57,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=485, PETRI_TRANSITIONS=496} [2025-03-08 22:06:57,985 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -163 predicate places. [2025-03-08 22:06:57,985 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 496 transitions, 1026 flow [2025-03-08 22:06:57,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:57,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:57,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:06:57,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1894117411, now seen corresponding path program 1 times [2025-03-08 22:06:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720921064] [2025-03-08 22:06:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:57,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 22:06:58,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 22:06:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720921064] [2025-03-08 22:06:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720921064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:58,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654382957] [2025-03-08 22:06:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:58,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:58,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:58,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:58,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 496 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:58,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:58,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:58,164 INFO L124 PetriNetUnfolderBase]: 155/784 cut-off events. [2025-03-08 22:06:58,165 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 22:06:58,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 784 events. 155/784 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1677 event pairs, 10 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 949. Up to 172 conditions per place. [2025-03-08 22:06:58,172 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-03-08 22:06:58,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 495 transitions, 1084 flow [2025-03-08 22:06:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:58,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:58,175 INFO L175 Difference]: Start difference. First operand has 485 places, 496 transitions, 1026 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:58,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 495 transitions, 1084 flow [2025-03-08 22:06:58,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 495 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:58,181 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1024 flow [2025-03-08 22:06:58,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-03-08 22:06:58,182 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-08 22:06:58,182 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1024 flow [2025-03-08 22:06:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:58,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:06:58,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1297048587, now seen corresponding path program 1 times [2025-03-08 22:06:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496527779] [2025-03-08 22:06:58,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:58,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 22:06:58,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 22:06:58,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:58,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:58,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:58,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496527779] [2025-03-08 22:06:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496527779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461098912] [2025-03-08 22:06:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:58,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:58,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:58,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:58,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:58,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:58,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:58,442 INFO L124 PetriNetUnfolderBase]: 295/1159 cut-off events. [2025-03-08 22:06:58,443 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-08 22:06:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 1159 events. 295/1159 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3780 event pairs, 10 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1518. Up to 166 conditions per place. [2025-03-08 22:06:58,455 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 47 selfloop transitions, 2 changer transitions 0/516 dead transitions. [2025-03-08 22:06:58,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 516 transitions, 1186 flow [2025-03-08 22:06:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1578 transitions. [2025-03-08 22:06:58,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7645348837209303 [2025-03-08 22:06:58,458 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1024 flow. Second operand 3 states and 1578 transitions. [2025-03-08 22:06:58,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 516 transitions, 1186 flow [2025-03-08 22:06:58,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 516 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:58,464 INFO L231 Difference]: Finished difference. Result has 484 places, 495 transitions, 1028 flow [2025-03-08 22:06:58,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=495} [2025-03-08 22:06:58,465 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-08 22:06:58,465 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 495 transitions, 1028 flow [2025-03-08 22:06:58,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:58,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:58,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:06:58,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:58,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1975743703, now seen corresponding path program 1 times [2025-03-08 22:06:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:58,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002808865] [2025-03-08 22:06:58,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:58,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:06:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:06:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002808865] [2025-03-08 22:06:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002808865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103470417] [2025-03-08 22:06:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:58,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:58,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 495 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:58,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:58,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:58,710 INFO L124 PetriNetUnfolderBase]: 291/1100 cut-off events. [2025-03-08 22:06:58,710 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-08 22:06:58,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 1100 events. 291/1100 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3417 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1495. Up to 323 conditions per place. [2025-03-08 22:06:58,723 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/494 dead transitions. [2025-03-08 22:06:58,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 494 transitions, 1086 flow [2025-03-08 22:06:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:58,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:58,726 INFO L175 Difference]: Start difference. First operand has 484 places, 495 transitions, 1028 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:58,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 494 transitions, 1086 flow [2025-03-08 22:06:58,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 494 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:58,732 INFO L231 Difference]: Finished difference. Result has 484 places, 494 transitions, 1028 flow [2025-03-08 22:06:58,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=484, PETRI_TRANSITIONS=494} [2025-03-08 22:06:58,733 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -164 predicate places. [2025-03-08 22:06:58,733 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 494 transitions, 1028 flow [2025-03-08 22:06:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:58,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:06:58,734 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1346067010, now seen corresponding path program 1 times [2025-03-08 22:06:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:58,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145762116] [2025-03-08 22:06:58,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:58,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:58,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:06:58,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:06:58,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:58,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145762116] [2025-03-08 22:06:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145762116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401145292] [2025-03-08 22:06:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:58,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:58,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:58,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:58,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 494 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:58,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:58,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:58,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:58,983 INFO L124 PetriNetUnfolderBase]: 291/1099 cut-off events. [2025-03-08 22:06:58,983 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-08 22:06:58,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1099 events. 291/1099 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3397 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1485. Up to 324 conditions per place. [2025-03-08 22:06:58,998 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/493 dead transitions. [2025-03-08 22:06:58,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 493 transitions, 1088 flow [2025-03-08 22:06:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:59,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:59,001 INFO L175 Difference]: Start difference. First operand has 484 places, 494 transitions, 1028 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:59,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 493 transitions, 1088 flow [2025-03-08 22:06:59,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 493 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:59,007 INFO L231 Difference]: Finished difference. Result has 483 places, 493 transitions, 1026 flow [2025-03-08 22:06:59,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=483, PETRI_TRANSITIONS=493} [2025-03-08 22:06:59,010 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -165 predicate places. [2025-03-08 22:06:59,010 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 493 transitions, 1026 flow [2025-03-08 22:06:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:59,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:59,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:06:59,011 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1217885759, now seen corresponding path program 1 times [2025-03-08 22:06:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316582718] [2025-03-08 22:06:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:59,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 22:06:59,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 22:06:59,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:59,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:59,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316582718] [2025-03-08 22:06:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316582718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977698566] [2025-03-08 22:06:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:59,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:59,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:59,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:59,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 493 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:59,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:59,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:59,261 INFO L124 PetriNetUnfolderBase]: 291/1098 cut-off events. [2025-03-08 22:06:59,261 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-08 22:06:59,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1098 events. 291/1098 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3402 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1482. Up to 321 conditions per place. [2025-03-08 22:06:59,271 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 27 selfloop transitions, 1 changer transitions 0/492 dead transitions. [2025-03-08 22:06:59,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 492 transitions, 1080 flow [2025-03-08 22:06:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-08 22:06:59,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-08 22:06:59,275 INFO L175 Difference]: Start difference. First operand has 483 places, 493 transitions, 1026 flow. Second operand 3 states and 1560 transitions. [2025-03-08 22:06:59,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 492 transitions, 1080 flow [2025-03-08 22:06:59,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 492 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:59,280 INFO L231 Difference]: Finished difference. Result has 482 places, 492 transitions, 1022 flow [2025-03-08 22:06:59,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=482, PETRI_TRANSITIONS=492} [2025-03-08 22:06:59,281 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-03-08 22:06:59,281 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 492 transitions, 1022 flow [2025-03-08 22:06:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:59,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:06:59,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1668398442, now seen corresponding path program 1 times [2025-03-08 22:06:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389945105] [2025-03-08 22:06:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:59,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 22:06:59,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 22:06:59,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:59,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389945105] [2025-03-08 22:06:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389945105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704845237] [2025-03-08 22:06:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:59,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:59,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:06:59,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 492 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:59,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:06:59,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:59,521 INFO L124 PetriNetUnfolderBase]: 291/1097 cut-off events. [2025-03-08 22:06:59,521 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-08 22:06:59,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1097 events. 291/1097 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3419 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1481. Up to 323 conditions per place. [2025-03-08 22:06:59,533 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 28 selfloop transitions, 2 changer transitions 0/491 dead transitions. [2025-03-08 22:06:59,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 491 transitions, 1080 flow [2025-03-08 22:06:59,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:06:59,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:06:59,536 INFO L175 Difference]: Start difference. First operand has 482 places, 492 transitions, 1022 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:06:59,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 491 transitions, 1080 flow [2025-03-08 22:06:59,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 491 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:59,541 INFO L231 Difference]: Finished difference. Result has 482 places, 491 transitions, 1023 flow [2025-03-08 22:06:59,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=482, PETRI_TRANSITIONS=491} [2025-03-08 22:06:59,542 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -166 predicate places. [2025-03-08 22:06:59,542 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 491 transitions, 1023 flow [2025-03-08 22:06:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:59,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:06:59,546 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 904012962, now seen corresponding path program 1 times [2025-03-08 22:06:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462908097] [2025-03-08 22:06:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:59,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 22:06:59,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 22:06:59,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:59,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:59,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462908097] [2025-03-08 22:06:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462908097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:59,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594416458] [2025-03-08 22:06:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:59,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:59,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:59,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:59,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:59,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:06:59,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 491 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:59,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:06:59,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:59,843 INFO L124 PetriNetUnfolderBase]: 291/1096 cut-off events. [2025-03-08 22:06:59,843 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-03-08 22:06:59,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1096 events. 291/1096 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3409 event pairs, 30 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1483. Up to 324 conditions per place. [2025-03-08 22:06:59,853 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/490 dead transitions. [2025-03-08 22:06:59,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 490 transitions, 1083 flow [2025-03-08 22:06:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:06:59,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:06:59,856 INFO L175 Difference]: Start difference. First operand has 482 places, 491 transitions, 1023 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:06:59,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 490 transitions, 1083 flow [2025-03-08 22:06:59,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 490 transitions, 1079 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:59,861 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1021 flow [2025-03-08 22:06:59,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-03-08 22:06:59,862 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-08 22:06:59,862 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1021 flow [2025-03-08 22:06:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:59,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:59,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:06:59,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:06:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2122578544, now seen corresponding path program 1 times [2025-03-08 22:06:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726419843] [2025-03-08 22:06:59,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:59,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 22:06:59,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 22:06:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:59,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726419843] [2025-03-08 22:06:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726419843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:59,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338146907] [2025-03-08 22:06:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:59,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:59,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:59,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:59,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:06:59,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:06:59,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:59,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:06:59,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:00,230 INFO L124 PetriNetUnfolderBase]: 547/1955 cut-off events. [2025-03-08 22:07:00,230 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-08 22:07:00,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1955 events. 547/1955 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9147 event pairs, 34 based on Foata normal form. 0/1623 useless extension candidates. Maximal degree in co-relation 2700. Up to 298 conditions per place. [2025-03-08 22:07:00,248 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 48 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-03-08 22:07:00,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 511 transitions, 1188 flow [2025-03-08 22:07:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1577 transitions. [2025-03-08 22:07:00,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640503875968992 [2025-03-08 22:07:00,250 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1021 flow. Second operand 3 states and 1577 transitions. [2025-03-08 22:07:00,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 511 transitions, 1188 flow [2025-03-08 22:07:00,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 511 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:00,255 INFO L231 Difference]: Finished difference. Result has 481 places, 490 transitions, 1025 flow [2025-03-08 22:07:00,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=490} [2025-03-08 22:07:00,256 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-08 22:07:00,256 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 490 transitions, 1025 flow [2025-03-08 22:07:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:00,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:00,256 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] [2025-03-08 22:07:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:07:00,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1388668643, now seen corresponding path program 1 times [2025-03-08 22:07:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862178240] [2025-03-08 22:07:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 22:07:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 22:07:00,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:00,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862178240] [2025-03-08 22:07:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862178240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:00,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236341266] [2025-03-08 22:07:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:00,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:00,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:00,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:00,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:07:00,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 490 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:00,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:00,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:07:00,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:00,569 INFO L124 PetriNetUnfolderBase]: 527/1602 cut-off events. [2025-03-08 22:07:00,569 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-08 22:07:00,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1602 events. 527/1602 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6412 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2431. Up to 591 conditions per place. [2025-03-08 22:07:00,585 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/489 dead transitions. [2025-03-08 22:07:00,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 489 transitions, 1085 flow [2025-03-08 22:07:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:07:00,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:07:00,588 INFO L175 Difference]: Start difference. First operand has 481 places, 490 transitions, 1025 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:07:00,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 489 transitions, 1085 flow [2025-03-08 22:07:00,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 489 transitions, 1083 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:00,592 INFO L231 Difference]: Finished difference. Result has 481 places, 489 transitions, 1025 flow [2025-03-08 22:07:00,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=481, PETRI_TRANSITIONS=489} [2025-03-08 22:07:00,594 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -167 predicate places. [2025-03-08 22:07:00,594 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 489 transitions, 1025 flow [2025-03-08 22:07:00,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:00,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:00,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:00,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:07:00,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:00,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1184927458, now seen corresponding path program 1 times [2025-03-08 22:07:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:00,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876566518] [2025-03-08 22:07:00,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:00,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 22:07:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 22:07:00,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:00,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876566518] [2025-03-08 22:07:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876566518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:00,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155537283] [2025-03-08 22:07:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:00,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:00,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:00,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:00,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 508 out of 688 [2025-03-08 22:07:00,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 489 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:00,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:00,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 508 of 688 [2025-03-08 22:07:00,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:00,915 INFO L124 PetriNetUnfolderBase]: 527/1601 cut-off events. [2025-03-08 22:07:00,915 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-08 22:07:00,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1601 events. 527/1601 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6431 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2405. Up to 592 conditions per place. [2025-03-08 22:07:00,939 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 30 selfloop transitions, 2 changer transitions 0/488 dead transitions. [2025-03-08 22:07:00,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 488 transitions, 1087 flow [2025-03-08 22:07:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1551 transitions. [2025-03-08 22:07:00,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751453488372093 [2025-03-08 22:07:00,942 INFO L175 Difference]: Start difference. First operand has 481 places, 489 transitions, 1025 flow. Second operand 3 states and 1551 transitions. [2025-03-08 22:07:00,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 488 transitions, 1087 flow [2025-03-08 22:07:00,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 488 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:00,978 INFO L231 Difference]: Finished difference. Result has 480 places, 488 transitions, 1023 flow [2025-03-08 22:07:00,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=480, PETRI_TRANSITIONS=488} [2025-03-08 22:07:00,979 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -168 predicate places. [2025-03-08 22:07:00,979 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 488 transitions, 1023 flow [2025-03-08 22:07:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:00,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:00,979 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] [2025-03-08 22:07:00,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:07:00,980 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:00,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash 809925472, now seen corresponding path program 1 times [2025-03-08 22:07:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805517467] [2025-03-08 22:07:00,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 22:07:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 22:07:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805517467] [2025-03-08 22:07:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805517467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:01,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249541992] [2025-03-08 22:07:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:01,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:01,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:01,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:01,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:07:01,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 488 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:01,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:01,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:07:01,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:01,278 INFO L124 PetriNetUnfolderBase]: 527/1600 cut-off events. [2025-03-08 22:07:01,278 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-08 22:07:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1600 events. 527/1600 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6422 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 589 conditions per place. [2025-03-08 22:07:01,300 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 28 selfloop transitions, 1 changer transitions 0/487 dead transitions. [2025-03-08 22:07:01,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 487 transitions, 1079 flow [2025-03-08 22:07:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1560 transitions. [2025-03-08 22:07:01,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-03-08 22:07:01,303 INFO L175 Difference]: Start difference. First operand has 480 places, 488 transitions, 1023 flow. Second operand 3 states and 1560 transitions. [2025-03-08 22:07:01,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 487 transitions, 1079 flow [2025-03-08 22:07:01,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 487 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:01,309 INFO L231 Difference]: Finished difference. Result has 479 places, 487 transitions, 1019 flow [2025-03-08 22:07:01,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1019, PETRI_PLACES=479, PETRI_TRANSITIONS=487} [2025-03-08 22:07:01,310 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-03-08 22:07:01,310 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 487 transitions, 1019 flow [2025-03-08 22:07:01,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:01,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:01,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:01,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:07:01,310 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:01,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 655856674, now seen corresponding path program 1 times [2025-03-08 22:07:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948725821] [2025-03-08 22:07:01,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:01,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:01,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 22:07:01,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 22:07:01,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:01,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948725821] [2025-03-08 22:07:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948725821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442857680] [2025-03-08 22:07:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:01,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:01,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:01,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:01,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:07:01,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 487 transitions, 1019 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:01,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:01,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:07:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:01,750 INFO L124 PetriNetUnfolderBase]: 527/1599 cut-off events. [2025-03-08 22:07:01,750 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-08 22:07:01,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1599 events. 527/1599 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6415 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-03-08 22:07:01,778 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/486 dead transitions. [2025-03-08 22:07:01,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 486 transitions, 1079 flow [2025-03-08 22:07:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:07:01,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:07:01,780 INFO L175 Difference]: Start difference. First operand has 479 places, 487 transitions, 1019 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:07:01,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 486 transitions, 1079 flow [2025-03-08 22:07:01,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 486 transitions, 1078 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:01,787 INFO L231 Difference]: Finished difference. Result has 479 places, 486 transitions, 1020 flow [2025-03-08 22:07:01,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=479, PETRI_TRANSITIONS=486} [2025-03-08 22:07:01,788 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -169 predicate places. [2025-03-08 22:07:01,788 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 486 transitions, 1020 flow [2025-03-08 22:07:01,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:01,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:01,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:01,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:07:01,789 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash 144815393, now seen corresponding path program 1 times [2025-03-08 22:07:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646625855] [2025-03-08 22:07:01,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:01,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 22:07:01,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 22:07:01,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:01,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646625855] [2025-03-08 22:07:01,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646625855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:01,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:01,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451210288] [2025-03-08 22:07:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:01,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:01,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:01,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:01,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:01,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:07:01,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 486 transitions, 1020 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:01,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:01,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:07:01,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:02,148 INFO L124 PetriNetUnfolderBase]: 527/1598 cut-off events. [2025-03-08 22:07:02,148 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-08 22:07:02,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 1598 events. 527/1598 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6430 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2402. Up to 591 conditions per place. [2025-03-08 22:07:02,170 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/485 dead transitions. [2025-03-08 22:07:02,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 485 transitions, 1080 flow [2025-03-08 22:07:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:07:02,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:07:02,173 INFO L175 Difference]: Start difference. First operand has 479 places, 486 transitions, 1020 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:07:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 485 transitions, 1080 flow [2025-03-08 22:07:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 485 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:02,178 INFO L231 Difference]: Finished difference. Result has 478 places, 485 transitions, 1018 flow [2025-03-08 22:07:02,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=478, PETRI_TRANSITIONS=485} [2025-03-08 22:07:02,179 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -170 predicate places. [2025-03-08 22:07:02,179 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 485 transitions, 1018 flow [2025-03-08 22:07:02,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:02,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:02,180 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] [2025-03-08 22:07:02,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:07:02,180 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:02,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -148089741, now seen corresponding path program 1 times [2025-03-08 22:07:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193843817] [2025-03-08 22:07:02,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-08 22:07:02,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-08 22:07:02,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:02,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:02,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193843817] [2025-03-08 22:07:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193843817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853082652] [2025-03-08 22:07:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:02,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:02,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:02,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 688 [2025-03-08 22:07:02,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 485 transitions, 1018 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:02,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:02,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 688 [2025-03-08 22:07:02,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:02,487 INFO L124 PetriNetUnfolderBase]: 527/1597 cut-off events. [2025-03-08 22:07:02,487 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-08 22:07:02,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1597 events. 527/1597 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6438 event pairs, 82 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 2401. Up to 591 conditions per place. [2025-03-08 22:07:02,508 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 29 selfloop transitions, 2 changer transitions 0/484 dead transitions. [2025-03-08 22:07:02,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 484 transitions, 1078 flow [2025-03-08 22:07:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2025-03-08 22:07:02,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752422480620155 [2025-03-08 22:07:02,510 INFO L175 Difference]: Start difference. First operand has 478 places, 485 transitions, 1018 flow. Second operand 3 states and 1553 transitions. [2025-03-08 22:07:02,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 484 transitions, 1078 flow [2025-03-08 22:07:02,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 484 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:02,515 INFO L231 Difference]: Finished difference. Result has 477 places, 484 transitions, 1016 flow [2025-03-08 22:07:02,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=477, PETRI_TRANSITIONS=484} [2025-03-08 22:07:02,516 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -171 predicate places. [2025-03-08 22:07:02,516 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 484 transitions, 1016 flow [2025-03-08 22:07:02,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:02,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:02,517 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] [2025-03-08 22:07:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:07:02,517 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err74ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2019797150, now seen corresponding path program 1 times [2025-03-08 22:07:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673455271] [2025-03-08 22:07:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:02,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-08 22:07:02,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-08 22:07:02,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:02,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673455271] [2025-03-08 22:07:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673455271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712828633] [2025-03-08 22:07:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:02,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:02,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:02,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 688 [2025-03-08 22:07:02,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 484 transitions, 1016 flow. Second operand has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:02,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:02,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 688 [2025-03-08 22:07:02,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:03,578 INFO L124 PetriNetUnfolderBase]: 2651/6526 cut-off events. [2025-03-08 22:07:03,579 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2025-03-08 22:07:03,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10925 conditions, 6526 events. 2651/6526 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 48395 event pairs, 378 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 10852. Up to 2446 conditions per place. [2025-03-08 22:07:03,651 INFO L140 encePairwiseOnDemand]: 675/688 looper letters, 45 selfloop transitions, 10 changer transitions 0/495 dead transitions. [2025-03-08 22:07:03,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 495 transitions, 1167 flow [2025-03-08 22:07:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1546 transitions. [2025-03-08 22:07:03,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.749031007751938 [2025-03-08 22:07:03,654 INFO L175 Difference]: Start difference. First operand has 477 places, 484 transitions, 1016 flow. Second operand 3 states and 1546 transitions. [2025-03-08 22:07:03,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 495 transitions, 1167 flow [2025-03-08 22:07:03,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:03,659 INFO L231 Difference]: Finished difference. Result has 472 places, 479 transitions, 1034 flow [2025-03-08 22:07:03,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=472, PETRI_TRANSITIONS=479} [2025-03-08 22:07:03,660 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-08 22:07:03,660 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 479 transitions, 1034 flow [2025-03-08 22:07:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:03,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:07:03,661 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -569764680, now seen corresponding path program 1 times [2025-03-08 22:07:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462813757] [2025-03-08 22:07:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:03,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-08 22:07:03,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-08 22:07:03,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:03,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462813757] [2025-03-08 22:07:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462813757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888186370] [2025-03-08 22:07:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:03,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-08 22:07:03,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 479 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:03,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:03,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-08 22:07:03,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:04,606 INFO L124 PetriNetUnfolderBase]: 2649/5021 cut-off events. [2025-03-08 22:07:04,607 INFO L125 PetriNetUnfolderBase]: For 4812/4858 co-relation queries the response was YES. [2025-03-08 22:07:04,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 5021 events. 2649/5021 cut-off events. For 4812/4858 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 27409 event pairs, 130 based on Foata normal form. 0/4407 useless extension candidates. Maximal degree in co-relation 10193. Up to 2268 conditions per place. [2025-03-08 22:07:04,678 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 48 selfloop transitions, 4 changer transitions 0/499 dead transitions. [2025-03-08 22:07:04,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 499 transitions, 1231 flow [2025-03-08 22:07:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1573 transitions. [2025-03-08 22:07:04,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7621124031007752 [2025-03-08 22:07:04,680 INFO L175 Difference]: Start difference. First operand has 472 places, 479 transitions, 1034 flow. Second operand 3 states and 1573 transitions. [2025-03-08 22:07:04,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 499 transitions, 1231 flow [2025-03-08 22:07:04,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 499 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:04,688 INFO L231 Difference]: Finished difference. Result has 472 places, 478 transitions, 1036 flow [2025-03-08 22:07:04,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=472, PETRI_TRANSITIONS=478} [2025-03-08 22:07:04,689 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-08 22:07:04,689 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 478 transitions, 1036 flow [2025-03-08 22:07:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:04,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:04,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:04,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:07:04,690 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:04,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1427532087, now seen corresponding path program 1 times [2025-03-08 22:07:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117327966] [2025-03-08 22:07:04,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:04,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 22:07:04,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 22:07:04,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:04,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117327966] [2025-03-08 22:07:04,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117327966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:04,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:04,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779754513] [2025-03-08 22:07:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:04,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:04,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:04,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:04,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-08 22:07:04,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 478 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:04,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:04,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-08 22:07:04,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:06,140 INFO L124 PetriNetUnfolderBase]: 3557/7793 cut-off events. [2025-03-08 22:07:06,140 INFO L125 PetriNetUnfolderBase]: For 5261/5387 co-relation queries the response was YES. [2025-03-08 22:07:06,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 7793 events. 3557/7793 cut-off events. For 5261/5387 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 54746 event pairs, 418 based on Foata normal form. 0/6667 useless extension candidates. Maximal degree in co-relation 14915. Up to 3192 conditions per place. [2025-03-08 22:07:06,244 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 47 selfloop transitions, 4 changer transitions 0/497 dead transitions. [2025-03-08 22:07:06,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 497 transitions, 1228 flow [2025-03-08 22:07:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1572 transitions. [2025-03-08 22:07:06,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616279069767442 [2025-03-08 22:07:06,246 INFO L175 Difference]: Start difference. First operand has 472 places, 478 transitions, 1036 flow. Second operand 3 states and 1572 transitions. [2025-03-08 22:07:06,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 497 transitions, 1228 flow [2025-03-08 22:07:06,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 497 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:06,252 INFO L231 Difference]: Finished difference. Result has 472 places, 477 transitions, 1044 flow [2025-03-08 22:07:06,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=472, PETRI_TRANSITIONS=477} [2025-03-08 22:07:06,253 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-08 22:07:06,253 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 477 transitions, 1044 flow [2025-03-08 22:07:06,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:06,253 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] [2025-03-08 22:07:06,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:07:06,254 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread4Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:06,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1497783778, now seen corresponding path program 1 times [2025-03-08 22:07:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313640480] [2025-03-08 22:07:06,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:06,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 22:07:06,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 22:07:06,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313640480] [2025-03-08 22:07:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313640480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953039970] [2025-03-08 22:07:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:06,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:06,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:06,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 510 out of 688 [2025-03-08 22:07:06,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 477 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:06,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 510 of 688 [2025-03-08 22:07:06,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:07,694 INFO L124 PetriNetUnfolderBase]: 3823/9663 cut-off events. [2025-03-08 22:07:07,694 INFO L125 PetriNetUnfolderBase]: For 8565/8581 co-relation queries the response was YES. [2025-03-08 22:07:07,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18552 conditions, 9663 events. 3823/9663 cut-off events. For 8565/8581 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 84372 event pairs, 210 based on Foata normal form. 0/8234 useless extension candidates. Maximal degree in co-relation 18477. Up to 3888 conditions per place. [2025-03-08 22:07:07,777 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 46 selfloop transitions, 4 changer transitions 0/495 dead transitions. [2025-03-08 22:07:07,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 495 transitions, 1237 flow [2025-03-08 22:07:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1571 transitions. [2025-03-08 22:07:07,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7611434108527132 [2025-03-08 22:07:07,780 INFO L175 Difference]: Start difference. First operand has 472 places, 477 transitions, 1044 flow. Second operand 3 states and 1571 transitions. [2025-03-08 22:07:07,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 495 transitions, 1237 flow [2025-03-08 22:07:07,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 495 transitions, 1230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:07,786 INFO L231 Difference]: Finished difference. Result has 472 places, 476 transitions, 1052 flow [2025-03-08 22:07:07,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=472, PETRI_TRANSITIONS=476} [2025-03-08 22:07:07,787 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-08 22:07:07,787 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 476 transitions, 1052 flow [2025-03-08 22:07:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:07,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:07:07,787 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err74ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 332 more)] === [2025-03-08 22:07:07,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1205296570, now seen corresponding path program 1 times [2025-03-08 22:07:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144481705] [2025-03-08 22:07:07,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-08 22:07:07,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-08 22:07:07,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144481705] [2025-03-08 22:07:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144481705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132468570] [2025-03-08 22:07:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:07,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:07,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:07,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 688 [2025-03-08 22:07:07,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 476 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:07,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 688 [2025-03-08 22:07:07,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,406 INFO L124 PetriNetUnfolderBase]: 1053/3301 cut-off events. [2025-03-08 22:07:08,406 INFO L125 PetriNetUnfolderBase]: For 3308/3332 co-relation queries the response was YES. [2025-03-08 22:07:08,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 3301 events. 1053/3301 cut-off events. For 3308/3332 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21711 event pairs, 210 based on Foata normal form. 256/3051 useless extension candidates. Maximal degree in co-relation 6677. Up to 1517 conditions per place. [2025-03-08 22:07:08,428 INFO L140 encePairwiseOnDemand]: 686/688 looper letters, 0 selfloop transitions, 0 changer transitions 475/475 dead transitions. [2025-03-08 22:07:08,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 475 transitions, 1106 flow [2025-03-08 22:07:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1559 transitions. [2025-03-08 22:07:08,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7553294573643411 [2025-03-08 22:07:08,431 INFO L175 Difference]: Start difference. First operand has 472 places, 476 transitions, 1052 flow. Second operand 3 states and 1559 transitions. [2025-03-08 22:07:08,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 475 transitions, 1106 flow [2025-03-08 22:07:08,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 475 transitions, 1102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:08,437 INFO L231 Difference]: Finished difference. Result has 472 places, 0 transitions, 0 flow [2025-03-08 22:07:08,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=472, PETRI_TRANSITIONS=0} [2025-03-08 22:07:08,437 INFO L279 CegarLoopForPetriNet]: 648 programPoint places, -176 predicate places. [2025-03-08 22:07:08,437 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 0 transitions, 0 flow [2025-03-08 22:07:08,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (335 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (334 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (333 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (332 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (331 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (330 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (329 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (328 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (327 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (326 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (325 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (324 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (323 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (322 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (321 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (320 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (319 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (318 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (317 of 336 remaining) [2025-03-08 22:07:08,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (316 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (315 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (314 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (313 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (312 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (311 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (310 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (309 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (308 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (307 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (306 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (305 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (304 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (303 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (302 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (301 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (300 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (299 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (298 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (297 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (296 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (295 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (294 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (293 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (292 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (291 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (290 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (289 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (288 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (287 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (286 of 336 remaining) [2025-03-08 22:07:08,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (285 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (284 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (283 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (282 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (281 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (280 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (279 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (278 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (277 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (276 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (275 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (274 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (273 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (272 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (271 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (270 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (269 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (268 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (267 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (266 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (265 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (264 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (263 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (262 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (261 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (260 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (259 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (258 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (257 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (256 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (255 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (254 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (253 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (252 of 336 remaining) [2025-03-08 22:07:08,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (251 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (250 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (249 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (248 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (247 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (246 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (245 of 336 remaining) [2025-03-08 22:07:08,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (244 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (243 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (242 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (241 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (240 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (239 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (238 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (237 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (236 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (235 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (234 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (233 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (232 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (231 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (230 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (229 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (228 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (227 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (226 of 336 remaining) [2025-03-08 22:07:08,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (225 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (224 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (223 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (222 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (221 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (220 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (219 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (218 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (217 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (216 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (215 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (214 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (213 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (212 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (211 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (210 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (209 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (208 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (207 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (206 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (205 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (204 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (203 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (202 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (201 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (200 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (199 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (198 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (197 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (196 of 336 remaining) [2025-03-08 22:07:08,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (195 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (194 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (193 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (192 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (191 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (190 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (189 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (188 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (187 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (186 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (185 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (184 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (183 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (182 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (181 of 336 remaining) [2025-03-08 22:07:08,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (180 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (179 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (178 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (177 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (176 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (175 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (174 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (173 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (172 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (171 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (170 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (169 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (168 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (167 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (166 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (165 of 336 remaining) [2025-03-08 22:07:08,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (164 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (163 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (162 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (161 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (160 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (159 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (158 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (157 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (156 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (155 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (154 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (153 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (152 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (151 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (150 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err74ASSERT_VIOLATIONDATA_RACE (149 of 336 remaining) [2025-03-08 22:07:08,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (148 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (147 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (146 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (145 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (144 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (143 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (142 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (141 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (140 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (139 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (138 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (137 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err73ASSERT_VIOLATIONDATA_RACE (135 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (134 of 336 remaining) [2025-03-08 22:07:08,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (133 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (132 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (131 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (130 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (129 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (128 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (127 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (125 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err72ASSERT_VIOLATIONDATA_RACE (124 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (123 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (122 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (121 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (120 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (119 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (118 of 336 remaining) [2025-03-08 22:07:08,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (117 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (116 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (115 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err71ASSERT_VIOLATIONDATA_RACE (113 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (112 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (111 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (110 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (109 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (108 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (107 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (106 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (105 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (104 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (103 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (102 of 336 remaining) [2025-03-08 22:07:08,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (101 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (100 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err70ASSERT_VIOLATIONDATA_RACE (99 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (98 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (97 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (96 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (95 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (94 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (93 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (92 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (91 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (90 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (89 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (88 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (87 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (86 of 336 remaining) [2025-03-08 22:07:08,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err69ASSERT_VIOLATIONDATA_RACE (85 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err68ASSERT_VIOLATIONDATA_RACE (84 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err67ASSERT_VIOLATIONDATA_RACE (83 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err66ASSERT_VIOLATIONDATA_RACE (82 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (81 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (80 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (79 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (78 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (77 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (76 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (75 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (74 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (73 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (72 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (71 of 336 remaining) [2025-03-08 22:07:08,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (70 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (69 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (68 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (67 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (66 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (63 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (62 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (60 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (59 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (58 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (57 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (56 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (55 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (54 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (53 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (52 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (51 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (50 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (49 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (48 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (47 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (46 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (45 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (44 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (43 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (42 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (41 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (40 of 336 remaining) [2025-03-08 22:07:08,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (39 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (36 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (35 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (34 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (33 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (32 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (31 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (30 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (29 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (28 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (27 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (26 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (25 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err24ASSERT_VIOLATIONDATA_RACE (24 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (23 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (22 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (21 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (20 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (19 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (18 of 336 remaining) [2025-03-08 22:07:08,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (17 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (16 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (15 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err23ASSERT_VIOLATIONDATA_RACE (13 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (12 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (11 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (10 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (9 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (8 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (7 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (6 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (5 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (4 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (3 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (2 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (1 of 336 remaining) [2025-03-08 22:07:08,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 336 remaining) [2025-03-08 22:07:08,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:07:08,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:08,463 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:07:08,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:07:08,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:07:08 BasicIcfg [2025-03-08 22:07:08,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:07:08,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:07:08,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:07:08,472 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:07:08,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:53" (3/4) ... [2025-03-08 22:07:08,474 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:07:08,479 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:07:08,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:07:08,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:07:08,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-08 22:07:08,486 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-08 22:07:08,486 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:07:08,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 22:07:08,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:07:08,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:07:08,561 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:07:08,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:07:08,562 INFO L158 Benchmark]: Toolchain (without parser) took 17421.78ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 112.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 302.8MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,562 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:08,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.20ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 90.4MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:08,562 INFO L158 Benchmark]: Boogie Preprocessor took 55.79ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,563 INFO L158 Benchmark]: IcfgBuilder took 1741.10ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 65.4MB in the end (delta: 20.7MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,563 INFO L158 Benchmark]: TraceAbstraction took 15225.05ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 65.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 830.0MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,563 INFO L158 Benchmark]: Witness Printer took 89.29ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:07:08,564 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.24ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.79ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.20ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 90.4MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.79ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.1MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1741.10ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 65.4MB in the end (delta: 20.7MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15225.05ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 65.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 830.0MB. Max. memory is 16.1GB. * Witness Printer took 89.29ms. Allocated memory is still 2.2GB. Free memory was 1.9GB in the beginning and 1.8GB 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: 53]: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 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: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: 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: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: 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: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 174]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 175]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 178]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 179]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 180]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 182]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 183]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 184]: 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: 217]: 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: 187]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 188]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 189]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 217]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 190]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 192]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 193]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 205]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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: 150]: 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: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: 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: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: 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: 157]: 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: 157]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 890 locations, 942 edges, 336 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: 15.0s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1995 IncrementalHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 148 mSDtfsCounter, 1995 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1358occurred in iteration=0, InterpolantAutomatonStates: 102, 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.5s InterpolantComputationTime, 5785 NumberOfCodeBlocks, 5785 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5752 ConstructedInterpolants, 0 QuantifiedInterpolants, 5931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 182 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:07:08,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE