./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:07,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:08,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:08,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:08,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:08,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:08,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:08,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:08,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:08,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:08,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:08,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:08,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:08,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:08,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:08,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:08,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:08,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:08,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:08,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:08,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:08,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:08,052 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-03-14 01:45:08,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:08,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:08,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:08,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:08,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:08,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-14 01:45:09,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709310d69/9a0cd010ba6b42b586f34650df6c36af/FLAG282e1af77 [2025-03-14 01:45:09,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:09,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-03-14 01:45:09,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709310d69/9a0cd010ba6b42b586f34650df6c36af/FLAG282e1af77 [2025-03-14 01:45:10,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/709310d69/9a0cd010ba6b42b586f34650df6c36af [2025-03-14 01:45:10,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:10,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:10,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:10,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:10,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:10,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10, skipping insertion in model container [2025-03-14 01:45:10,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:10,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:10,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:10,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:10,269 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:10,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10 WrapperNode [2025-03-14 01:45:10,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:10,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:10,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:10,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:10,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,318 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 694 [2025-03-14 01:45:10,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:10,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:10,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:10,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:10,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:10,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:10,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:10,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:10,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (1/1) ... [2025-03-14 01:45:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:10,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:10,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:45:10,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:10,422 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:10,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:10,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:11,308 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:11,308 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:11,309 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:11,824 WARN L177 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-14 01:45:11,837 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:11,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:11 BoogieIcfgContainer [2025-03-14 01:45:11,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:11,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:11,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:11,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:11,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:10" (1/3) ... [2025-03-14 01:45:11,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc935b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:11, skipping insertion in model container [2025-03-14 01:45:11,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:10" (2/3) ... [2025-03-14 01:45:11,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc935b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:11, skipping insertion in model container [2025-03-14 01:45:11,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:11" (3/3) ... [2025-03-14 01:45:11,846 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-03-14 01:45:11,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:11,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 453 locations, 1 initial locations, 6 loop locations, and 113 error locations. [2025-03-14 01:45:11,860 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:12,044 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:45:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 472 transitions, 965 flow [2025-03-14 01:45:12,224 INFO L124 PetriNetUnfolderBase]: 20/469 cut-off events. [2025-03-14 01:45:12,228 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:12,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 469 events. 20/469 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 788 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 414. Up to 2 conditions per place. [2025-03-14 01:45:12,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 472 transitions, 965 flow [2025-03-14 01:45:12,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 443 places, 452 transitions, 922 flow [2025-03-14 01:45:12,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:12,269 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;@7a65a9dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:12,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 204 error locations. [2025-03-14 01:45:12,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:12,276 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-14 01:45:12,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:12,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:12,277 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] [2025-03-14 01:45:12,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:12,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 319360476, now seen corresponding path program 1 times [2025-03-14 01:45:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706497750] [2025-03-14 01:45:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:12,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:12,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:45:12,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:45:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706497750] [2025-03-14 01:45:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706497750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190529954] [2025-03-14 01:45:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:12,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:12,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:12,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:12,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 452 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:12,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:12,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:12,767 INFO L124 PetriNetUnfolderBase]: 201/897 cut-off events. [2025-03-14 01:45:12,767 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-03-14 01:45:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 897 events. 201/897 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3680 event pairs, 86 based on Foata normal form. 110/884 useless extension candidates. Maximal degree in co-relation 873. Up to 278 conditions per place. [2025-03-14 01:45:12,774 INFO L140 encePairwiseOnDemand]: 369/472 looper letters, 19 selfloop transitions, 2 changer transitions 6/351 dead transitions. [2025-03-14 01:45:12,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 351 transitions, 762 flow [2025-03-14 01:45:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2025-03-14 01:45:12,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213276836158192 [2025-03-14 01:45:12,791 INFO L175 Difference]: Start difference. First operand has 443 places, 452 transitions, 922 flow. Second operand 3 states and 1163 transitions. [2025-03-14 01:45:12,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 351 transitions, 762 flow [2025-03-14 01:45:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 351 transitions, 750 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:45:12,804 INFO L231 Difference]: Finished difference. Result has 350 places, 345 transitions, 700 flow [2025-03-14 01:45:12,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=350, PETRI_TRANSITIONS=345} [2025-03-14 01:45:12,809 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -93 predicate places. [2025-03-14 01:45:12,810 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 345 transitions, 700 flow [2025-03-14 01:45:12,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:12,811 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] [2025-03-14 01:45:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:12,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:12,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -171963321, now seen corresponding path program 1 times [2025-03-14 01:45:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681312405] [2025-03-14 01:45:12,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:12,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:45:12,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:45:12,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:12,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681312405] [2025-03-14 01:45:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681312405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:12,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47027393] [2025-03-14 01:45:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:12,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:12,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:12,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:12,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:12,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:12,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 345 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:12,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:12,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:12,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,132 INFO L124 PetriNetUnfolderBase]: 201/890 cut-off events. [2025-03-14 01:45:13,133 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:45:13,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 890 events. 201/890 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3662 event pairs, 86 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1156. Up to 278 conditions per place. [2025-03-14 01:45:13,136 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 19 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-03-14 01:45:13,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 344 transitions, 740 flow [2025-03-14 01:45:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:13,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:13,143 INFO L175 Difference]: Start difference. First operand has 350 places, 345 transitions, 700 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:13,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 344 transitions, 740 flow [2025-03-14 01:45:13,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 344 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:13,151 INFO L231 Difference]: Finished difference. Result has 343 places, 344 transitions, 698 flow [2025-03-14 01:45:13,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=343, PETRI_TRANSITIONS=344} [2025-03-14 01:45:13,152 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -100 predicate places. [2025-03-14 01:45:13,152 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 344 transitions, 698 flow [2025-03-14 01:45:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:13,153 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] [2025-03-14 01:45:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:13,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:13,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1859199565, now seen corresponding path program 1 times [2025-03-14 01:45:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-14 01:45:13,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:45:13,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:45:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-14 01:45:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285066310] [2025-03-14 01:45:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:13,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:13,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:13,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:13,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,445 INFO L124 PetriNetUnfolderBase]: 201/889 cut-off events. [2025-03-14 01:45:13,445 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:45:13,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 889 events. 201/889 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3661 event pairs, 86 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1147. Up to 278 conditions per place. [2025-03-14 01:45:13,451 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 19 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-03-14 01:45:13,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 343 transitions, 738 flow [2025-03-14 01:45:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:13,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:13,455 INFO L175 Difference]: Start difference. First operand has 343 places, 344 transitions, 698 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:13,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 343 transitions, 738 flow [2025-03-14 01:45:13,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 343 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:13,461 INFO L231 Difference]: Finished difference. Result has 342 places, 343 transitions, 696 flow [2025-03-14 01:45:13,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=342, PETRI_TRANSITIONS=343} [2025-03-14 01:45:13,463 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-14 01:45:13,463 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 343 transitions, 696 flow [2025-03-14 01:45:13,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:13,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:13,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:13,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2058929888, now seen corresponding path program 1 times [2025-03-14 01:45:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:13,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65997744] [2025-03-14 01:45:13,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:13,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:45:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:45:13,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:13,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65997744] [2025-03-14 01:45:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65997744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803532877] [2025-03-14 01:45:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:13,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:13,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:13,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 343 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:13,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:13,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,732 INFO L124 PetriNetUnfolderBase]: 224/863 cut-off events. [2025-03-14 01:45:13,732 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-14 01:45:13,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 863 events. 224/863 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3245 event pairs, 25 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1148. Up to 241 conditions per place. [2025-03-14 01:45:13,736 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 27 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2025-03-14 01:45:13,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 353 transitions, 779 flow [2025-03-14 01:45:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2025-03-14 01:45:13,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7648305084745762 [2025-03-14 01:45:13,738 INFO L175 Difference]: Start difference. First operand has 342 places, 343 transitions, 696 flow. Second operand 3 states and 1083 transitions. [2025-03-14 01:45:13,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 353 transitions, 779 flow [2025-03-14 01:45:13,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 353 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:13,743 INFO L231 Difference]: Finished difference. Result has 342 places, 343 transitions, 700 flow [2025-03-14 01:45:13,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=342, PETRI_TRANSITIONS=343} [2025-03-14 01:45:13,744 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-14 01:45:13,744 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 343 transitions, 700 flow [2025-03-14 01:45:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:13,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] [2025-03-14 01:45:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:13,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1313021036, now seen corresponding path program 1 times [2025-03-14 01:45:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799095939] [2025-03-14 01:45:13,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:45:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:45:13,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:13,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799095939] [2025-03-14 01:45:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799095939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67674797] [2025-03-14 01:45:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:13,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:13,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:13,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:13,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:13,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 343 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:13,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:13,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:13,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:13,984 INFO L124 PetriNetUnfolderBase]: 224/974 cut-off events. [2025-03-14 01:45:13,984 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-14 01:45:13,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 974 events. 224/974 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4264 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 582. Up to 314 conditions per place. [2025-03-14 01:45:13,989 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 19 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-03-14 01:45:13,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 342 transitions, 740 flow [2025-03-14 01:45:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:13,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:13,993 INFO L175 Difference]: Start difference. First operand has 342 places, 343 transitions, 700 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:13,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 342 transitions, 740 flow [2025-03-14 01:45:13,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 342 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:13,998 INFO L231 Difference]: Finished difference. Result has 342 places, 342 transitions, 700 flow [2025-03-14 01:45:13,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=342, PETRI_TRANSITIONS=342} [2025-03-14 01:45:14,000 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -101 predicate places. [2025-03-14 01:45:14,001 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 342 transitions, 700 flow [2025-03-14 01:45:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:14,003 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] [2025-03-14 01:45:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:14,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1940888311, now seen corresponding path program 1 times [2025-03-14 01:45:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051527621] [2025-03-14 01:45:14,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:45:14,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:45:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051527621] [2025-03-14 01:45:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051527621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79914206] [2025-03-14 01:45:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:14,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:14,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:14,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 342 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:14,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:14,193 INFO L124 PetriNetUnfolderBase]: 224/973 cut-off events. [2025-03-14 01:45:14,193 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:45:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 973 events. 224/973 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4243 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1275. Up to 312 conditions per place. [2025-03-14 01:45:14,198 INFO L140 encePairwiseOnDemand]: 470/472 looper letters, 18 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2025-03-14 01:45:14,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 341 transitions, 736 flow [2025-03-14 01:45:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2025-03-14 01:45:14,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7570621468926554 [2025-03-14 01:45:14,200 INFO L175 Difference]: Start difference. First operand has 342 places, 342 transitions, 700 flow. Second operand 3 states and 1072 transitions. [2025-03-14 01:45:14,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 341 transitions, 736 flow [2025-03-14 01:45:14,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 341 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:14,205 INFO L231 Difference]: Finished difference. Result has 341 places, 341 transitions, 696 flow [2025-03-14 01:45:14,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=341, PETRI_TRANSITIONS=341} [2025-03-14 01:45:14,206 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-14 01:45:14,206 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 341 transitions, 696 flow [2025-03-14 01:45:14,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:14,207 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] [2025-03-14 01:45:14,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:14,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:14,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 318024182, now seen corresponding path program 1 times [2025-03-14 01:45:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707455809] [2025-03-14 01:45:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:14,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:45:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:45:14,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707455809] [2025-03-14 01:45:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707455809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:14,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502296982] [2025-03-14 01:45:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:14,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:14,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:14,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:14,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:14,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 341 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:14,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:14,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:14,435 INFO L124 PetriNetUnfolderBase]: 224/972 cut-off events. [2025-03-14 01:45:14,435 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:45:14,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 972 events. 224/972 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4237 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1275. Up to 314 conditions per place. [2025-03-14 01:45:14,440 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 19 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-14 01:45:14,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 340 transitions, 736 flow [2025-03-14 01:45:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:14,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:14,442 INFO L175 Difference]: Start difference. First operand has 341 places, 341 transitions, 696 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 340 transitions, 736 flow [2025-03-14 01:45:14,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 340 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:14,449 INFO L231 Difference]: Finished difference. Result has 341 places, 340 transitions, 697 flow [2025-03-14 01:45:14,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=341, PETRI_TRANSITIONS=340} [2025-03-14 01:45:14,451 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-14 01:45:14,451 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 340 transitions, 697 flow [2025-03-14 01:45:14,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:14,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:14,453 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] [2025-03-14 01:45:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:14,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash -178488531, now seen corresponding path program 1 times [2025-03-14 01:45:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5560603] [2025-03-14 01:45:14,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:14,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:45:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:45:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5560603] [2025-03-14 01:45:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5560603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:14,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:14,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178668611] [2025-03-14 01:45:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:14,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:14,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:14,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:15,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 472 [2025-03-14 01:45:15,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 340 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:15,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 472 [2025-03-14 01:45:15,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:15,311 INFO L124 PetriNetUnfolderBase]: 224/969 cut-off events. [2025-03-14 01:45:15,312 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:45:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 969 events. 224/969 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4223 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1309. Up to 335 conditions per place. [2025-03-14 01:45:15,318 INFO L140 encePairwiseOnDemand]: 454/472 looper letters, 40 selfloop transitions, 15 changer transitions 0/337 dead transitions. [2025-03-14 01:45:15,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 337 transitions, 801 flow [2025-03-14 01:45:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1935 transitions. [2025-03-14 01:45:15,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6832627118644068 [2025-03-14 01:45:15,322 INFO L175 Difference]: Start difference. First operand has 341 places, 340 transitions, 697 flow. Second operand 6 states and 1935 transitions. [2025-03-14 01:45:15,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 337 transitions, 801 flow [2025-03-14 01:45:15,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 337 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:15,327 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 717 flow [2025-03-14 01:45:15,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2025-03-14 01:45:15,328 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -102 predicate places. [2025-03-14 01:45:15,328 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 717 flow [2025-03-14 01:45:15,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:15,330 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] [2025-03-14 01:45:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:15,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash -422740831, now seen corresponding path program 1 times [2025-03-14 01:45:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934691914] [2025-03-14 01:45:15,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:45:15,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:45:15,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:15,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:15,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934691914] [2025-03-14 01:45:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934691914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:15,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317666436] [2025-03-14 01:45:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:15,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:15,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:15,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:15,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:15,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:15,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:15,553 INFO L124 PetriNetUnfolderBase]: 224/968 cut-off events. [2025-03-14 01:45:15,554 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:45:15,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 968 events. 224/968 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4258 event pairs, 101 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 1300. Up to 315 conditions per place. [2025-03-14 01:45:15,559 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 20 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-03-14 01:45:15,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 336 transitions, 759 flow [2025-03-14 01:45:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:15,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:15,566 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 717 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 336 transitions, 759 flow [2025-03-14 01:45:15,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 336 transitions, 729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:15,572 INFO L231 Difference]: Finished difference. Result has 337 places, 336 transitions, 689 flow [2025-03-14 01:45:15,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=337, PETRI_TRANSITIONS=336} [2025-03-14 01:45:15,575 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-14 01:45:15,576 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 336 transitions, 689 flow [2025-03-14 01:45:15,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:15,577 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] [2025-03-14 01:45:15,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:15,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1750439689, now seen corresponding path program 1 times [2025-03-14 01:45:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265647283] [2025-03-14 01:45:15,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:15,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:45:15,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:45:15,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265647283] [2025-03-14 01:45:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265647283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:15,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810851862] [2025-03-14 01:45:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:15,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:15,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:15,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 336 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:15,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:15,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:15,806 INFO L124 PetriNetUnfolderBase]: 286/1083 cut-off events. [2025-03-14 01:45:15,806 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-03-14 01:45:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1083 events. 286/1083 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5064 event pairs, 70 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1482. Up to 209 conditions per place. [2025-03-14 01:45:15,812 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 30 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-03-14 01:45:15,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 348 transitions, 784 flow [2025-03-14 01:45:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2025-03-14 01:45:15,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7655367231638418 [2025-03-14 01:45:15,815 INFO L175 Difference]: Start difference. First operand has 337 places, 336 transitions, 689 flow. Second operand 3 states and 1084 transitions. [2025-03-14 01:45:15,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 348 transitions, 784 flow [2025-03-14 01:45:15,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 348 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:15,819 INFO L231 Difference]: Finished difference. Result has 337 places, 336 transitions, 693 flow [2025-03-14 01:45:15,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=337, PETRI_TRANSITIONS=336} [2025-03-14 01:45:15,820 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-14 01:45:15,820 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 336 transitions, 693 flow [2025-03-14 01:45:15,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:15,821 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] [2025-03-14 01:45:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:15,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:15,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2095636603, now seen corresponding path program 1 times [2025-03-14 01:45:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:15,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-14 01:45:15,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:15,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:15,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:45:15,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:45:15,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:15,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:15,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-14 01:45:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-14 01:45:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574348308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:15,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282342602] [2025-03-14 01:45:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:15,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:15,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:15,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:15,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 336 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:15,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:15,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:15,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,017 INFO L124 PetriNetUnfolderBase]: 286/1066 cut-off events. [2025-03-14 01:45:16,017 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-14 01:45:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1066 events. 286/1066 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4934 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1534. Up to 402 conditions per place. [2025-03-14 01:45:16,023 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 20 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-03-14 01:45:16,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 735 flow [2025-03-14 01:45:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:16,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:16,025 INFO L175 Difference]: Start difference. First operand has 337 places, 336 transitions, 693 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:16,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 735 flow [2025-03-14 01:45:16,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:16,030 INFO L231 Difference]: Finished difference. Result has 337 places, 335 transitions, 693 flow [2025-03-14 01:45:16,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=337, PETRI_TRANSITIONS=335} [2025-03-14 01:45:16,031 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -106 predicate places. [2025-03-14 01:45:16,031 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 335 transitions, 693 flow [2025-03-14 01:45:16,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:16,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash -894650596, now seen corresponding path program 1 times [2025-03-14 01:45:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808869403] [2025-03-14 01:45:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-14 01:45:16,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-14 01:45:16,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808869403] [2025-03-14 01:45:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808869403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095035096] [2025-03-14 01:45:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:16,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:16,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:16,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:16,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:16,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 335 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,243 INFO L124 PetriNetUnfolderBase]: 286/1065 cut-off events. [2025-03-14 01:45:16,243 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-14 01:45:16,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1065 events. 286/1065 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4933 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1513. Up to 403 conditions per place. [2025-03-14 01:45:16,248 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 21 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-03-14 01:45:16,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 334 transitions, 737 flow [2025-03-14 01:45:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:16,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:16,251 INFO L175 Difference]: Start difference. First operand has 337 places, 335 transitions, 693 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:16,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 334 transitions, 737 flow [2025-03-14 01:45:16,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 334 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:16,255 INFO L231 Difference]: Finished difference. Result has 336 places, 334 transitions, 691 flow [2025-03-14 01:45:16,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=336, PETRI_TRANSITIONS=334} [2025-03-14 01:45:16,256 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -107 predicate places. [2025-03-14 01:45:16,256 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 334 transitions, 691 flow [2025-03-14 01:45:16,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,257 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] [2025-03-14 01:45:16,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:16,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1398412580, now seen corresponding path program 1 times [2025-03-14 01:45:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942805423] [2025-03-14 01:45:16,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-14 01:45:16,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-14 01:45:16,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:16,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942805423] [2025-03-14 01:45:16,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942805423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:16,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:16,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812933756] [2025-03-14 01:45:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:16,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:16,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:16,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:16,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 334 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:16,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,477 INFO L124 PetriNetUnfolderBase]: 286/1064 cut-off events. [2025-03-14 01:45:16,477 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-14 01:45:16,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1064 events. 286/1064 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4936 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1510. Up to 400 conditions per place. [2025-03-14 01:45:16,484 INFO L140 encePairwiseOnDemand]: 470/472 looper letters, 19 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2025-03-14 01:45:16,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 333 transitions, 729 flow [2025-03-14 01:45:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2025-03-14 01:45:16,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7570621468926554 [2025-03-14 01:45:16,487 INFO L175 Difference]: Start difference. First operand has 336 places, 334 transitions, 691 flow. Second operand 3 states and 1072 transitions. [2025-03-14 01:45:16,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 333 transitions, 729 flow [2025-03-14 01:45:16,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 333 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:16,493 INFO L231 Difference]: Finished difference. Result has 335 places, 333 transitions, 687 flow [2025-03-14 01:45:16,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=335, PETRI_TRANSITIONS=333} [2025-03-14 01:45:16,493 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-03-14 01:45:16,493 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 333 transitions, 687 flow [2025-03-14 01:45:16,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:16,494 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2077485067, now seen corresponding path program 1 times [2025-03-14 01:45:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223691362] [2025-03-14 01:45:16,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:45:16,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:45:16,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223691362] [2025-03-14 01:45:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223691362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113965579] [2025-03-14 01:45:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:16,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:16,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:16,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:16,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 333 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:16,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,744 INFO L124 PetriNetUnfolderBase]: 286/1063 cut-off events. [2025-03-14 01:45:16,744 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-14 01:45:16,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1063 events. 286/1063 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4932 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1509. Up to 402 conditions per place. [2025-03-14 01:45:16,749 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 20 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2025-03-14 01:45:16,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 332 transitions, 729 flow [2025-03-14 01:45:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:16,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:16,752 INFO L175 Difference]: Start difference. First operand has 335 places, 333 transitions, 687 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:16,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 332 transitions, 729 flow [2025-03-14 01:45:16,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 332 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:16,757 INFO L231 Difference]: Finished difference. Result has 335 places, 332 transitions, 688 flow [2025-03-14 01:45:16,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=335, PETRI_TRANSITIONS=332} [2025-03-14 01:45:16,759 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -108 predicate places. [2025-03-14 01:45:16,760 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 332 transitions, 688 flow [2025-03-14 01:45:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:16,761 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] [2025-03-14 01:45:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:16,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:16,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1700927501, now seen corresponding path program 1 times [2025-03-14 01:45:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-03-14 01:45:16,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:16,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-14 01:45:16,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:45:16,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:16,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568286473] [2025-03-14 01:45:16,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568286473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:16,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697323397] [2025-03-14 01:45:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:16,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:16,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:16,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:16,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 332 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:16,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:16,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:16,991 INFO L124 PetriNetUnfolderBase]: 286/1062 cut-off events. [2025-03-14 01:45:16,991 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-14 01:45:16,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1062 events. 286/1062 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4949 event pairs, 138 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1511. Up to 403 conditions per place. [2025-03-14 01:45:16,995 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 21 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-03-14 01:45:16,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 732 flow [2025-03-14 01:45:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:16,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:16,998 INFO L175 Difference]: Start difference. First operand has 335 places, 332 transitions, 688 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:16,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 732 flow [2025-03-14 01:45:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 331 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:17,002 INFO L231 Difference]: Finished difference. Result has 334 places, 331 transitions, 686 flow [2025-03-14 01:45:17,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=334, PETRI_TRANSITIONS=331} [2025-03-14 01:45:17,003 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-14 01:45:17,003 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 331 transitions, 686 flow [2025-03-14 01:45:17,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,004 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] [2025-03-14 01:45:17,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:17,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:17,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash 983804309, now seen corresponding path program 1 times [2025-03-14 01:45:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-14 01:45:17,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:45:17,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:45:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450757382] [2025-03-14 01:45:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450757382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618266659] [2025-03-14 01:45:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:17,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 331 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:17,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:17,218 INFO L124 PetriNetUnfolderBase]: 289/1093 cut-off events. [2025-03-14 01:45:17,218 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-14 01:45:17,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 1093 events. 289/1093 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5094 event pairs, 32 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1562. Up to 319 conditions per place. [2025-03-14 01:45:17,223 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 31 selfloop transitions, 3 changer transitions 0/344 dead transitions. [2025-03-14 01:45:17,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 344 transitions, 792 flow [2025-03-14 01:45:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2025-03-14 01:45:17,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7655367231638418 [2025-03-14 01:45:17,226 INFO L175 Difference]: Start difference. First operand has 334 places, 331 transitions, 686 flow. Second operand 3 states and 1084 transitions. [2025-03-14 01:45:17,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 344 transitions, 792 flow [2025-03-14 01:45:17,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 344 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:17,230 INFO L231 Difference]: Finished difference. Result has 334 places, 332 transitions, 697 flow [2025-03-14 01:45:17,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=334, PETRI_TRANSITIONS=332} [2025-03-14 01:45:17,231 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-14 01:45:17,231 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 332 transitions, 697 flow [2025-03-14 01:45:17,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,232 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] [2025-03-14 01:45:17,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:17,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1982602078, now seen corresponding path program 1 times [2025-03-14 01:45:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68278561] [2025-03-14 01:45:17,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:45:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:45:17,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68278561] [2025-03-14 01:45:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68278561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839409157] [2025-03-14 01:45:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:17,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 332 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:17,442 INFO L124 PetriNetUnfolderBase]: 289/1108 cut-off events. [2025-03-14 01:45:17,442 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-14 01:45:17,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 1108 events. 289/1108 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5310 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1775. Up to 418 conditions per place. [2025-03-14 01:45:17,448 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2025-03-14 01:45:17,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 331 transitions, 743 flow [2025-03-14 01:45:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:17,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:17,451 INFO L175 Difference]: Start difference. First operand has 334 places, 332 transitions, 697 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:17,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 331 transitions, 743 flow [2025-03-14 01:45:17,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 331 transitions, 740 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:17,455 INFO L231 Difference]: Finished difference. Result has 334 places, 331 transitions, 696 flow [2025-03-14 01:45:17,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=334, PETRI_TRANSITIONS=331} [2025-03-14 01:45:17,456 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -109 predicate places. [2025-03-14 01:45:17,456 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 331 transitions, 696 flow [2025-03-14 01:45:17,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,457 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] [2025-03-14 01:45:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:17,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 985375484, now seen corresponding path program 1 times [2025-03-14 01:45:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651036644] [2025-03-14 01:45:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-14 01:45:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-14 01:45:17,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:17,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651036644] [2025-03-14 01:45:17,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651036644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822092391] [2025-03-14 01:45:17,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 472 [2025-03-14 01:45:17,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 331 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 472 [2025-03-14 01:45:17,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:17,706 INFO L124 PetriNetUnfolderBase]: 289/1107 cut-off events. [2025-03-14 01:45:17,706 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:45:17,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1107 events. 289/1107 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5309 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1711. Up to 419 conditions per place. [2025-03-14 01:45:17,710 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 23 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-14 01:45:17,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 330 transitions, 744 flow [2025-03-14 01:45:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1063 transitions. [2025-03-14 01:45:17,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7507062146892656 [2025-03-14 01:45:17,713 INFO L175 Difference]: Start difference. First operand has 334 places, 331 transitions, 696 flow. Second operand 3 states and 1063 transitions. [2025-03-14 01:45:17,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 330 transitions, 744 flow [2025-03-14 01:45:17,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 330 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:17,717 INFO L231 Difference]: Finished difference. Result has 333 places, 330 transitions, 694 flow [2025-03-14 01:45:17,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=333, PETRI_TRANSITIONS=330} [2025-03-14 01:45:17,717 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -110 predicate places. [2025-03-14 01:45:17,718 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 330 transitions, 694 flow [2025-03-14 01:45:17,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,718 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] [2025-03-14 01:45:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:45:17,718 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1627026170, now seen corresponding path program 1 times [2025-03-14 01:45:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520782606] [2025-03-14 01:45:17,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-14 01:45:17,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-14 01:45:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520782606] [2025-03-14 01:45:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520782606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636995113] [2025-03-14 01:45:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:17,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 330 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:17,923 INFO L124 PetriNetUnfolderBase]: 289/1106 cut-off events. [2025-03-14 01:45:17,923 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-14 01:45:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1106 events. 289/1106 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5327 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1708. Up to 416 conditions per place. [2025-03-14 01:45:17,928 INFO L140 encePairwiseOnDemand]: 470/472 looper letters, 21 selfloop transitions, 1 changer transitions 0/329 dead transitions. [2025-03-14 01:45:17,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 329 transitions, 736 flow [2025-03-14 01:45:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2025-03-14 01:45:17,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7570621468926554 [2025-03-14 01:45:17,930 INFO L175 Difference]: Start difference. First operand has 333 places, 330 transitions, 694 flow. Second operand 3 states and 1072 transitions. [2025-03-14 01:45:17,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 329 transitions, 736 flow [2025-03-14 01:45:17,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 329 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:17,935 INFO L231 Difference]: Finished difference. Result has 332 places, 329 transitions, 690 flow [2025-03-14 01:45:17,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=332, PETRI_TRANSITIONS=329} [2025-03-14 01:45:17,935 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-03-14 01:45:17,935 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 329 transitions, 690 flow [2025-03-14 01:45:17,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:17,936 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] [2025-03-14 01:45:17,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:45:17,936 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -537752606, now seen corresponding path program 1 times [2025-03-14 01:45:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758491922] [2025-03-14 01:45:17,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-14 01:45:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-14 01:45:17,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758491922] [2025-03-14 01:45:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758491922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448056265] [2025-03-14 01:45:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:17,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:17,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:17,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:17,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:17,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 329 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:17,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:17,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,212 INFO L124 PetriNetUnfolderBase]: 289/1105 cut-off events. [2025-03-14 01:45:18,213 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:45:18,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1105 events. 289/1105 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5324 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1707. Up to 418 conditions per place. [2025-03-14 01:45:18,219 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-03-14 01:45:18,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 736 flow [2025-03-14 01:45:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:18,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:18,222 INFO L175 Difference]: Start difference. First operand has 332 places, 329 transitions, 690 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:18,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 736 flow [2025-03-14 01:45:18,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 328 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:18,226 INFO L231 Difference]: Finished difference. Result has 332 places, 328 transitions, 691 flow [2025-03-14 01:45:18,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=332, PETRI_TRANSITIONS=328} [2025-03-14 01:45:18,227 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -111 predicate places. [2025-03-14 01:45:18,227 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 328 transitions, 691 flow [2025-03-14 01:45:18,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:18,228 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] [2025-03-14 01:45:18,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:45:18,228 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:18,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1393371174, now seen corresponding path program 1 times [2025-03-14 01:45:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:18,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-03-14 01:45:18,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:18,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-14 01:45:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-14 01:45:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:18,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331774527] [2025-03-14 01:45:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331774527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:18,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128720531] [2025-03-14 01:45:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:18,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:18,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:18,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:18,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:18,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 328 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:18,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:18,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,448 INFO L124 PetriNetUnfolderBase]: 289/1104 cut-off events. [2025-03-14 01:45:18,448 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:45:18,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 1104 events. 289/1104 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5318 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1708. Up to 418 conditions per place. [2025-03-14 01:45:18,453 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-03-14 01:45:18,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 327 transitions, 737 flow [2025-03-14 01:45:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:18,456 INFO L175 Difference]: Start difference. First operand has 332 places, 328 transitions, 691 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 327 transitions, 737 flow [2025-03-14 01:45:18,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 327 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:18,459 INFO L231 Difference]: Finished difference. Result has 331 places, 327 transitions, 689 flow [2025-03-14 01:45:18,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=331, PETRI_TRANSITIONS=327} [2025-03-14 01:45:18,460 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -112 predicate places. [2025-03-14 01:45:18,460 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 327 transitions, 689 flow [2025-03-14 01:45:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:18,461 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] [2025-03-14 01:45:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:45:18,461 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 210187586, now seen corresponding path program 1 times [2025-03-14 01:45:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489184877] [2025-03-14 01:45:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:18,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:45:18,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:45:18,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489184877] [2025-03-14 01:45:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489184877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:18,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110928664] [2025-03-14 01:45:18,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:18,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:45:18,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 327 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:18,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:45:18,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,677 INFO L124 PetriNetUnfolderBase]: 289/1103 cut-off events. [2025-03-14 01:45:18,677 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:45:18,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1103 events. 289/1103 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5321 event pairs, 146 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 1707. Up to 418 conditions per place. [2025-03-14 01:45:18,682 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2025-03-14 01:45:18,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 326 transitions, 735 flow [2025-03-14 01:45:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2025-03-14 01:45:18,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521186440677966 [2025-03-14 01:45:18,684 INFO L175 Difference]: Start difference. First operand has 331 places, 327 transitions, 689 flow. Second operand 3 states and 1065 transitions. [2025-03-14 01:45:18,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 326 transitions, 735 flow [2025-03-14 01:45:18,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 326 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:18,688 INFO L231 Difference]: Finished difference. Result has 330 places, 326 transitions, 687 flow [2025-03-14 01:45:18,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=330, PETRI_TRANSITIONS=326} [2025-03-14 01:45:18,688 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -113 predicate places. [2025-03-14 01:45:18,688 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 326 transitions, 687 flow [2025-03-14 01:45:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:18,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:18,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:45:18,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err43ASSERT_VIOLATIONDATA_RACE, thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE (and 200 more)] === [2025-03-14 01:45:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1402475723, now seen corresponding path program 1 times [2025-03-14 01:45:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599658226] [2025-03-14 01:45:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:18,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-14 01:45:18,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-14 01:45:18,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:18,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:18,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599658226] [2025-03-14 01:45:18,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599658226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486720850] [2025-03-14 01:45:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:18,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:18,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:18,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:18,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 472 [2025-03-14 01:45:18,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 326 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:18,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 472 [2025-03-14 01:45:18,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:18,907 INFO L124 PetriNetUnfolderBase]: 289/1095 cut-off events. [2025-03-14 01:45:18,907 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-14 01:45:18,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 1095 events. 289/1095 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5260 event pairs, 146 based on Foata normal form. 8/975 useless extension candidates. Maximal degree in co-relation 1703. Up to 416 conditions per place. [2025-03-14 01:45:18,911 INFO L140 encePairwiseOnDemand]: 470/472 looper letters, 0 selfloop transitions, 0 changer transitions 325/325 dead transitions. [2025-03-14 01:45:18,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 325 transitions, 727 flow [2025-03-14 01:45:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-03-14 01:45:18,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7563559322033898 [2025-03-14 01:45:18,914 INFO L175 Difference]: Start difference. First operand has 330 places, 326 transitions, 687 flow. Second operand 3 states and 1071 transitions. [2025-03-14 01:45:18,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 325 transitions, 727 flow [2025-03-14 01:45:18,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 325 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:18,918 INFO L231 Difference]: Finished difference. Result has 329 places, 0 transitions, 0 flow [2025-03-14 01:45:18,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=329, PETRI_TRANSITIONS=0} [2025-03-14 01:45:18,919 INFO L279 CegarLoopForPetriNet]: 443 programPoint places, -114 predicate places. [2025-03-14 01:45:18,919 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 0 transitions, 0 flow [2025-03-14 01:45:18,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (203 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (202 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (201 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (200 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (199 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (198 of 204 remaining) [2025-03-14 01:45:18,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (197 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (196 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (194 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (193 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (192 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (191 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (190 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (189 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (188 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (187 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (186 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (185 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (184 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 204 remaining) [2025-03-14 01:45:18,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (182 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (181 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (180 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (179 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (178 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (177 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (176 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (175 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (174 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (173 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (172 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (171 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (170 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (169 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (168 of 204 remaining) [2025-03-14 01:45:18,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (167 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (166 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (165 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (162 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (160 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (158 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (157 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (156 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (155 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (154 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (153 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (152 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (151 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (149 of 204 remaining) [2025-03-14 01:45:18,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (148 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (147 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (146 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (145 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (144 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (143 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (142 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (141 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (140 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (139 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (138 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (137 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (136 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (135 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (134 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (133 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (132 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (130 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (125 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (123 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (122 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (121 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (120 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (119 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (118 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (117 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (116 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (115 of 204 remaining) [2025-03-14 01:45:18,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (114 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (113 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (112 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (111 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (110 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (109 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (108 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (107 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (106 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 204 remaining) [2025-03-14 01:45:18,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (103 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (102 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (101 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (100 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (99 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (98 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (97 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (96 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (95 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (94 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (93 of 204 remaining) [2025-03-14 01:45:18,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (92 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (91 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (87 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (86 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (85 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (84 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (83 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (82 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (81 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (80 of 204 remaining) [2025-03-14 01:45:18,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (79 of 204 remaining) [2025-03-14 01:45:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (78 of 204 remaining) [2025-03-14 01:45:18,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (77 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (76 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (75 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (74 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (73 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (72 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (71 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (70 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (69 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (68 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (67 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (66 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (65 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (64 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (63 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (62 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (60 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (59 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (58 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (56 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (55 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (54 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (52 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (50 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (43 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (42 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 204 remaining) [2025-03-14 01:45:18,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (40 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (39 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (38 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (37 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (36 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (35 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (34 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (33 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (32 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (31 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (29 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (28 of 204 remaining) [2025-03-14 01:45:18,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (26 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (21 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (20 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (19 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 204 remaining) [2025-03-14 01:45:18,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 204 remaining) [2025-03-14 01:45:18,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 204 remaining) [2025-03-14 01:45:18,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:45:18,937 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] [2025-03-14 01:45:18,941 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:45:18,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:45:18,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:45:18 BasicIcfg [2025-03-14 01:45:18,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:45:18,949 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:45:18,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:45:18,949 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:45:18,950 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:11" (3/4) ... [2025-03-14 01:45:18,951 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:45:18,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:45:18,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:45:18,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:45:18,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-14 01:45:18,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:45:18,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:45:18,959 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:45:19,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:45:19,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:45:19,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:45:19,035 INFO L158 Benchmark]: Toolchain (without parser) took 8981.85ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 122.7MB in the beginning and 248.9MB in the end (delta: -126.3MB). Peak memory consumption was 279.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:19,035 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:19,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.97ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:45:19,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.08ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:19,037 INFO L158 Benchmark]: Boogie Preprocessor took 47.37ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 100.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:19,037 INFO L158 Benchmark]: IcfgBuilder took 1470.57ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 74.0MB in the end (delta: 26.9MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2025-03-14 01:45:19,038 INFO L158 Benchmark]: TraceAbstraction took 7109.10ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 74.0MB in the beginning and 257.3MB in the end (delta: -183.3MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2025-03-14 01:45:19,038 INFO L158 Benchmark]: Witness Printer took 85.50ms. Allocated memory is still 578.8MB. Free memory was 257.3MB in the beginning and 248.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:19,039 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.48ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.97ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.08ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 104.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.37ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 100.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1470.57ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 74.0MB in the end (delta: 26.9MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7109.10ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 74.0MB in the beginning and 257.3MB in the end (delta: -183.3MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. * Witness Printer took 85.50ms. Allocated memory is still 578.8MB. Free memory was 257.3MB in the beginning and 248.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 65]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: 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: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 108]: 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: 108]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: 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: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: 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: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 579 locations, 204 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: 6.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1104 IncrementalHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 159 mSDtfsCounter, 1104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2788 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 113 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:45:19,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE