./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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-more-buffer-mult3.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 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:31,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:31,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:31,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:31,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:31,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:31,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:31,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:31,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:31,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:31,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:31,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:31,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:31,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:31,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:31,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:31,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:31,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:31,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:31,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:31,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:31,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:31,220 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 -> 7888761977ccc49b1a75199021e374591654c6a4364e63bfc6c86e1c7bb7d64b [2025-03-04 06:55:31,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:31,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:31,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:31,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:31,459 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:31,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-04 06:55:32,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4123b93/7ad33673e4424e43aa503a8a29015fa8/FLAGb5b024b69 [2025-03-04 06:55:32,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:32,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-04 06:55:32,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4123b93/7ad33673e4424e43aa503a8a29015fa8/FLAGb5b024b69 [2025-03-04 06:55:32,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec4123b93/7ad33673e4424e43aa503a8a29015fa8 [2025-03-04 06:55:32,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:32,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:32,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:32,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:32,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:32,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a34a5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32, skipping insertion in model container [2025-03-04 06:55:32,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:33,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:33,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:33,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:33,182 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:33,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33 WrapperNode [2025-03-04 06:55:33,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:33,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:33,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:33,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:33,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,231 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 560 [2025-03-04 06:55:33,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:33,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:33,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:33,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:33,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:33,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:33,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:33,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:33,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (1/1) ... [2025-03-04 06:55:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:33,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:33,308 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-04 06:55:33,310 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-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:55:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:33,331 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:33,440 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:33,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:34,080 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:34,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:34,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:34,393 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:34,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:34 BoogieIcfgContainer [2025-03-04 06:55:34,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:34,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:34,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:34,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:34,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:32" (1/3) ... [2025-03-04 06:55:34,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8d072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:34, skipping insertion in model container [2025-03-04 06:55:34,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:33" (2/3) ... [2025-03-04 06:55:34,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a8d072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:34, skipping insertion in model container [2025-03-04 06:55:34,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:34" (3/3) ... [2025-03-04 06:55:34,401 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-03-04 06:55:34,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:34,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 371 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-03-04 06:55:34,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:34,539 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:55:34,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 383 places, 383 transitions, 794 flow [2025-03-04 06:55:34,689 INFO L124 PetriNetUnfolderBase]: 13/379 cut-off events. [2025-03-04 06:55:34,690 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:55:34,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 379 events. 13/379 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 584 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 331. Up to 2 conditions per place. [2025-03-04 06:55:34,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 383 places, 383 transitions, 794 flow [2025-03-04 06:55:34,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 363 places, 362 transitions, 748 flow [2025-03-04 06:55:34,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:34,729 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;@2de59c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:34,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2025-03-04 06:55:34,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:34,740 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:55:34,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:34,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:34,741 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] [2025-03-04 06:55:34,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1256750956, now seen corresponding path program 1 times [2025-03-04 06:55:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175330929] [2025-03-04 06:55:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:34,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:55:34,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:55:34,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:34,915 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-04 06:55:34,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175330929] [2025-03-04 06:55:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175330929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:34,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681636001] [2025-03-04 06:55:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:34,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:34,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:34,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:34,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:34,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 362 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:34,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:35,394 INFO L124 PetriNetUnfolderBase]: 745/1663 cut-off events. [2025-03-04 06:55:35,395 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-04 06:55:35,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1663 events. 745/1663 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8729 event pairs, 485 based on Foata normal form. 5/1511 useless extension candidates. Maximal degree in co-relation 2496. Up to 1008 conditions per place. [2025-03-04 06:55:35,406 INFO L140 encePairwiseOnDemand]: 305/383 looper letters, 26 selfloop transitions, 2 changer transitions 5/286 dead transitions. [2025-03-04 06:55:35,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 652 flow [2025-03-04 06:55:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-03-04 06:55:35,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8111401218450827 [2025-03-04 06:55:35,431 INFO L175 Difference]: Start difference. First operand has 363 places, 362 transitions, 748 flow. Second operand 3 states and 932 transitions. [2025-03-04 06:55:35,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 652 flow [2025-03-04 06:55:35,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 286 transitions, 636 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:55:35,442 INFO L231 Difference]: Finished difference. Result has 286 places, 281 transitions, 574 flow [2025-03-04 06:55:35,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=286, PETRI_TRANSITIONS=281} [2025-03-04 06:55:35,447 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -77 predicate places. [2025-03-04 06:55:35,449 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 281 transitions, 574 flow [2025-03-04 06:55:35,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:35,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:35,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1979493612, now seen corresponding path program 1 times [2025-03-04 06:55:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608551760] [2025-03-04 06:55:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:55:35,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:55:35,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,510 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-04 06:55:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608551760] [2025-03-04 06:55:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608551760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566016379] [2025-03-04 06:55:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:35,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 281 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:35,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:35,856 INFO L124 PetriNetUnfolderBase]: 745/1657 cut-off events. [2025-03-04 06:55:35,857 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:35,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1657 events. 745/1657 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8743 event pairs, 485 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 2701. Up to 1008 conditions per place. [2025-03-04 06:55:35,870 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 26 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-04 06:55:35,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 280 transitions, 628 flow [2025-03-04 06:55:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:35,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458659704090513 [2025-03-04 06:55:35,873 INFO L175 Difference]: Start difference. First operand has 286 places, 281 transitions, 574 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:35,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 280 transitions, 628 flow [2025-03-04 06:55:35,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 280 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:35,881 INFO L231 Difference]: Finished difference. Result has 280 places, 280 transitions, 572 flow [2025-03-04 06:55:35,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=280} [2025-03-04 06:55:35,883 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -83 predicate places. [2025-03-04 06:55:35,883 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 280 transitions, 572 flow [2025-03-04 06:55:35,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:35,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:35,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 416559114, now seen corresponding path program 1 times [2025-03-04 06:55:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175110112] [2025-03-04 06:55:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:55:35,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:55:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175110112] [2025-03-04 06:55:35,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175110112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098585882] [2025-03-04 06:55:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:35,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 280 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:35,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,276 INFO L124 PetriNetUnfolderBase]: 745/1656 cut-off events. [2025-03-04 06:55:36,276 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:36,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 1656 events. 745/1656 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8738 event pairs, 485 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 2692. Up to 1008 conditions per place. [2025-03-04 06:55:36,284 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 26 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-04 06:55:36,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 626 flow [2025-03-04 06:55:36,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:36,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458659704090513 [2025-03-04 06:55:36,287 INFO L175 Difference]: Start difference. First operand has 280 places, 280 transitions, 572 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:36,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 626 flow [2025-03-04 06:55:36,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:36,290 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 570 flow [2025-03-04 06:55:36,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-04 06:55:36,291 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -84 predicate places. [2025-03-04 06:55:36,291 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 570 flow [2025-03-04 06:55:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,292 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] [2025-03-04 06:55:36,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:36,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1818050622, now seen corresponding path program 1 times [2025-03-04 06:55:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547167314] [2025-03-04 06:55:36,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:55:36,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:55:36,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,342 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-04 06:55:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547167314] [2025-03-04 06:55:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547167314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46017241] [2025-03-04 06:55:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:36,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,580 INFO L124 PetriNetUnfolderBase]: 745/1655 cut-off events. [2025-03-04 06:55:36,580 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 1655 events. 745/1655 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8719 event pairs, 485 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 2683. Up to 1008 conditions per place. [2025-03-04 06:55:36,590 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 26 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-04 06:55:36,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 624 flow [2025-03-04 06:55:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:36,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458659704090513 [2025-03-04 06:55:36,593 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 570 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 278 transitions, 624 flow [2025-03-04 06:55:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:36,597 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 568 flow [2025-03-04 06:55:36,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-03-04 06:55:36,598 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -85 predicate places. [2025-03-04 06:55:36,598 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 568 flow [2025-03-04 06:55:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:36,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1762355584, now seen corresponding path program 1 times [2025-03-04 06:55:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007879783] [2025-03-04 06:55:36,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:55:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:55:36,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,661 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-04 06:55:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007879783] [2025-03-04 06:55:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007879783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102060180] [2025-03-04 06:55:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:36,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:36,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,863 INFO L124 PetriNetUnfolderBase]: 745/1654 cut-off events. [2025-03-04 06:55:36,864 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:55:36,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1654 events. 745/1654 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8745 event pairs, 485 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 2674. Up to 1008 conditions per place. [2025-03-04 06:55:36,871 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 26 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-04 06:55:36,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 622 flow [2025-03-04 06:55:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:36,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458659704090513 [2025-03-04 06:55:36,874 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 568 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:36,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 622 flow [2025-03-04 06:55:36,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:36,877 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 566 flow [2025-03-04 06:55:36,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2025-03-04 06:55:36,878 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2025-03-04 06:55:36,878 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 566 flow [2025-03-04 06:55:36,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:36,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1211334774, now seen corresponding path program 1 times [2025-03-04 06:55:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334244124] [2025-03-04 06:55:36,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:55:36,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:55:36,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,914 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-04 06:55:36,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334244124] [2025-03-04 06:55:36,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334244124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665562488] [2025-03-04 06:55:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:36,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:36,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,293 INFO L124 PetriNetUnfolderBase]: 982/2271 cut-off events. [2025-03-04 06:55:37,293 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-04 06:55:37,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2271 events. 982/2271 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13961 event pairs, 307 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 3616. Up to 714 conditions per place. [2025-03-04 06:55:37,309 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 40 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-04 06:55:37,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 293 transitions, 687 flow [2025-03-04 06:55:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2025-03-04 06:55:37,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7684943429068756 [2025-03-04 06:55:37,311 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 566 flow. Second operand 3 states and 883 transitions. [2025-03-04 06:55:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 293 transitions, 687 flow [2025-03-04 06:55:37,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 293 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:37,316 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 570 flow [2025-03-04 06:55:37,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2025-03-04 06:55:37,317 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2025-03-04 06:55:37,317 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 570 flow [2025-03-04 06:55:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:37,318 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] [2025-03-04 06:55:37,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:37,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 191593781, now seen corresponding path program 1 times [2025-03-04 06:55:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458466256] [2025-03-04 06:55:37,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:37,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:55:37,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:55:37,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:37,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:37,350 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-04 06:55:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458466256] [2025-03-04 06:55:37,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458466256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971114280] [2025-03-04 06:55:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:37,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:37,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:37,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:37,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-04 06:55:37,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:37,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-04 06:55:37,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,663 INFO L124 PetriNetUnfolderBase]: 982/2290 cut-off events. [2025-03-04 06:55:37,663 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-04 06:55:37,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 2290 events. 982/2290 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14474 event pairs, 665 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 2132. Up to 1327 conditions per place. [2025-03-04 06:55:37,673 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 26 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-03-04 06:55:37,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 276 transitions, 624 flow [2025-03-04 06:55:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-04 06:55:37,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-04 06:55:37,676 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 570 flow. Second operand 3 states and 859 transitions. [2025-03-04 06:55:37,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 276 transitions, 624 flow [2025-03-04 06:55:37,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:37,679 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 570 flow [2025-03-04 06:55:37,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2025-03-04 06:55:37,681 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2025-03-04 06:55:37,681 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 570 flow [2025-03-04 06:55:37,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:37,682 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] [2025-03-04 06:55:37,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:37,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:37,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash 296535544, now seen corresponding path program 1 times [2025-03-04 06:55:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733530259] [2025-03-04 06:55:37,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:55:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:55:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733530259] [2025-03-04 06:55:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733530259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536982240] [2025-03-04 06:55:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:37,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:37,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:37,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:37,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 383 [2025-03-04 06:55:37,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:37,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 383 [2025-03-04 06:55:37,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,995 INFO L124 PetriNetUnfolderBase]: 982/2289 cut-off events. [2025-03-04 06:55:37,996 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-03-04 06:55:38,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 2289 events. 982/2289 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14478 event pairs, 665 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 3788. Up to 1328 conditions per place. [2025-03-04 06:55:38,007 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 27 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-03-04 06:55:38,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 626 flow [2025-03-04 06:55:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:38,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7458659704090513 [2025-03-04 06:55:38,010 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 570 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:38,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 626 flow [2025-03-04 06:55:38,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 275 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:38,013 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 568 flow [2025-03-04 06:55:38,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2025-03-04 06:55:38,014 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2025-03-04 06:55:38,014 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 568 flow [2025-03-04 06:55:38,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:38,015 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] [2025-03-04 06:55:38,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:38,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:38,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1142449580, now seen corresponding path program 1 times [2025-03-04 06:55:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137540126] [2025-03-04 06:55:38,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:38,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:55:38,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:55:38,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:38,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:38,047 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-04 06:55:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137540126] [2025-03-04 06:55:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137540126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:38,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:38,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213041073] [2025-03-04 06:55:38,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:38,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:38,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:38,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:38,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:38,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:38,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:38,344 INFO L124 PetriNetUnfolderBase]: 1232/2782 cut-off events. [2025-03-04 06:55:38,344 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-04 06:55:38,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2782 events. 1232/2782 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18004 event pairs, 472 based on Foata normal form. 0/2523 useless extension candidates. Maximal degree in co-relation 4650. Up to 903 conditions per place. [2025-03-04 06:55:38,358 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 41 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-04 06:55:38,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 291 transitions, 694 flow [2025-03-04 06:55:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-03-04 06:55:38,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7676240208877284 [2025-03-04 06:55:38,360 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 568 flow. Second operand 3 states and 882 transitions. [2025-03-04 06:55:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 291 transitions, 694 flow [2025-03-04 06:55:38,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 291 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:38,365 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 572 flow [2025-03-04 06:55:38,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2025-03-04 06:55:38,366 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2025-03-04 06:55:38,366 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 572 flow [2025-03-04 06:55:38,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:38,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:38,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:38,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 327448733, now seen corresponding path program 1 times [2025-03-04 06:55:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:38,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936320509] [2025-03-04 06:55:38,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:55:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:55:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:38,416 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-04 06:55:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936320509] [2025-03-04 06:55:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936320509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:38,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:38,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836152102] [2025-03-04 06:55:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:38,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:38,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:38,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-04 06:55:38,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:38,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-04 06:55:38,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:38,733 INFO L124 PetriNetUnfolderBase]: 1232/2973 cut-off events. [2025-03-04 06:55:38,733 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2025-03-04 06:55:38,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 2973 events. 1232/2973 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20942 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 3076. Up to 1665 conditions per place. [2025-03-04 06:55:38,748 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 27 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-03-04 06:55:38,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 274 transitions, 628 flow [2025-03-04 06:55:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-04 06:55:38,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-04 06:55:38,750 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 572 flow. Second operand 3 states and 859 transitions. [2025-03-04 06:55:38,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 274 transitions, 628 flow [2025-03-04 06:55:38,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:38,753 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 572 flow [2025-03-04 06:55:38,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2025-03-04 06:55:38,754 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2025-03-04 06:55:38,754 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 572 flow [2025-03-04 06:55:38,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:38,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:38,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:38,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:38,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1155859629, now seen corresponding path program 1 times [2025-03-04 06:55:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114614255] [2025-03-04 06:55:38,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:38,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:55:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:55:38,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:38,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:38,790 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-04 06:55:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114614255] [2025-03-04 06:55:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114614255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:38,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254575472] [2025-03-04 06:55:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:38,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:38,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:38,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:38,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:38,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 274 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:38,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:38,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,093 INFO L124 PetriNetUnfolderBase]: 1232/2972 cut-off events. [2025-03-04 06:55:39,093 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:39,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2972 events. 1232/2972 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21010 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5005. Up to 1663 conditions per place. [2025-03-04 06:55:39,107 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 26 selfloop transitions, 1 changer transitions 0/273 dead transitions. [2025-03-04 06:55:39,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 624 flow [2025-03-04 06:55:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2025-03-04 06:55:39,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7536988685813751 [2025-03-04 06:55:39,110 INFO L175 Difference]: Start difference. First operand has 276 places, 274 transitions, 572 flow. Second operand 3 states and 866 transitions. [2025-03-04 06:55:39,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 624 flow [2025-03-04 06:55:39,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:39,113 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 568 flow [2025-03-04 06:55:39,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2025-03-04 06:55:39,114 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -88 predicate places. [2025-03-04 06:55:39,114 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 568 flow [2025-03-04 06:55:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,114 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] [2025-03-04 06:55:39,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:39,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1148759846, now seen corresponding path program 1 times [2025-03-04 06:55:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964234768] [2025-03-04 06:55:39,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:39,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:39,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:39,176 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-04 06:55:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964234768] [2025-03-04 06:55:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964234768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404418265] [2025-03-04 06:55:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:39,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:39,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-04 06:55:39,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:39,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-04 06:55:39,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,526 INFO L124 PetriNetUnfolderBase]: 1232/2971 cut-off events. [2025-03-04 06:55:39,526 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:39,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2971 events. 1232/2971 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20954 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5005. Up to 1665 conditions per place. [2025-03-04 06:55:39,539 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 27 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-03-04 06:55:39,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 624 flow [2025-03-04 06:55:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-04 06:55:39,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-04 06:55:39,541 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 568 flow. Second operand 3 states and 859 transitions. [2025-03-04 06:55:39,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 624 flow [2025-03-04 06:55:39,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:39,544 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 569 flow [2025-03-04 06:55:39,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2025-03-04 06:55:39,545 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -88 predicate places. [2025-03-04 06:55:39,545 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 569 flow [2025-03-04 06:55:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:39,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:39,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 736713931, now seen corresponding path program 1 times [2025-03-04 06:55:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284609702] [2025-03-04 06:55:39,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:39,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:39,992 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-04 06:55:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284609702] [2025-03-04 06:55:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284609702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:39,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88333744] [2025-03-04 06:55:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:39,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:39,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:39,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:40,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 383 [2025-03-04 06:55:40,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 569 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:40,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 383 [2025-03-04 06:55:40,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:40,411 INFO L124 PetriNetUnfolderBase]: 1232/2969 cut-off events. [2025-03-04 06:55:40,411 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:40,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 2969 events. 1232/2969 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20927 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5027. Up to 1678 conditions per place. [2025-03-04 06:55:40,425 INFO L140 encePairwiseOnDemand]: 371/383 looper letters, 40 selfloop transitions, 10 changer transitions 0/270 dead transitions. [2025-03-04 06:55:40,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 665 flow [2025-03-04 06:55:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1586 transitions. [2025-03-04 06:55:40,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6901653611836379 [2025-03-04 06:55:40,428 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 569 flow. Second operand 6 states and 1586 transitions. [2025-03-04 06:55:40,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 665 flow [2025-03-04 06:55:40,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 270 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:40,432 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 581 flow [2025-03-04 06:55:40,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2025-03-04 06:55:40,433 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2025-03-04 06:55:40,433 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 581 flow [2025-03-04 06:55:40,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:40,434 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] [2025-03-04 06:55:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:40,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 363186433, now seen corresponding path program 1 times [2025-03-04 06:55:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321167682] [2025-03-04 06:55:40,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:40,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:55:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:55:40,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:40,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:40,470 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-04 06:55:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321167682] [2025-03-04 06:55:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321167682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:40,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104225438] [2025-03-04 06:55:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:40,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:40,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:40,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:40,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:40,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:40,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:40,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:40,768 INFO L124 PetriNetUnfolderBase]: 1232/2968 cut-off events. [2025-03-04 06:55:40,768 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5107 conditions, 2968 events. 1232/2968 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20944 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5072. Up to 1663 conditions per place. [2025-03-04 06:55:40,779 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 26 selfloop transitions, 1 changer transitions 0/269 dead transitions. [2025-03-04 06:55:40,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 269 transitions, 633 flow [2025-03-04 06:55:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2025-03-04 06:55:40,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7536988685813751 [2025-03-04 06:55:40,781 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 581 flow. Second operand 3 states and 866 transitions. [2025-03-04 06:55:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 269 transitions, 633 flow [2025-03-04 06:55:40,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 613 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:40,784 INFO L231 Difference]: Finished difference. Result has 272 places, 269 transitions, 561 flow [2025-03-04 06:55:40,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=272, PETRI_TRANSITIONS=269} [2025-03-04 06:55:40,785 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2025-03-04 06:55:40,785 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 269 transitions, 561 flow [2025-03-04 06:55:40,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:40,786 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] [2025-03-04 06:55:40,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:40,786 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -456510595, now seen corresponding path program 1 times [2025-03-04 06:55:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:40,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995408668] [2025-03-04 06:55:40,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:40,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 06:55:40,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 06:55:40,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:40,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:40,823 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-04 06:55:40,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:40,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995408668] [2025-03-04 06:55:40,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995408668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:40,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:40,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689965842] [2025-03-04 06:55:40,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:40,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:40,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:40,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-04 06:55:40,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 269 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-04 06:55:40,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:41,134 INFO L124 PetriNetUnfolderBase]: 1232/2967 cut-off events. [2025-03-04 06:55:41,135 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:41,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 2967 events. 1232/2967 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20925 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5002. Up to 1665 conditions per place. [2025-03-04 06:55:41,144 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 27 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-04 06:55:41,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 617 flow [2025-03-04 06:55:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-04 06:55:41,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-04 06:55:41,146 INFO L175 Difference]: Start difference. First operand has 272 places, 269 transitions, 561 flow. Second operand 3 states and 859 transitions. [2025-03-04 06:55:41,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 617 flow [2025-03-04 06:55:41,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 268 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:41,149 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 562 flow [2025-03-04 06:55:41,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2025-03-04 06:55:41,150 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2025-03-04 06:55:41,150 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 562 flow [2025-03-04 06:55:41,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:41,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:41,151 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] [2025-03-04 06:55:41,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:41,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:41,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1210396545, now seen corresponding path program 1 times [2025-03-04 06:55:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413680220] [2025-03-04 06:55:41,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:41,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:55:41,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:55:41,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:41,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:41,185 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-04 06:55:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413680220] [2025-03-04 06:55:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413680220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415787816] [2025-03-04 06:55:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:41,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:41,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:41,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:41,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:41,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:41,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:41,467 INFO L124 PetriNetUnfolderBase]: 1232/2966 cut-off events. [2025-03-04 06:55:41,468 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2025-03-04 06:55:41,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2966 events. 1232/2966 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21009 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5001. Up to 1663 conditions per place. [2025-03-04 06:55:41,482 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 26 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-03-04 06:55:41,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 267 transitions, 614 flow [2025-03-04 06:55:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2025-03-04 06:55:41,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7536988685813751 [2025-03-04 06:55:41,485 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 562 flow. Second operand 3 states and 866 transitions. [2025-03-04 06:55:41,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 267 transitions, 614 flow [2025-03-04 06:55:41,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:41,488 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 558 flow [2025-03-04 06:55:41,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2025-03-04 06:55:41,489 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -92 predicate places. [2025-03-04 06:55:41,489 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 558 flow [2025-03-04 06:55:41,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:41,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:41,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:55:41,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:41,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:41,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1299788466, now seen corresponding path program 1 times [2025-03-04 06:55:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020089747] [2025-03-04 06:55:41,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:41,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:55:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:55:41,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:41,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:41,536 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-04 06:55:41,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:41,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020089747] [2025-03-04 06:55:41,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020089747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:41,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:41,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:41,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399882684] [2025-03-04 06:55:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:41,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:41,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:41,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 383 [2025-03-04 06:55:41,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:41,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:41,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 383 [2025-03-04 06:55:41,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:41,975 INFO L124 PetriNetUnfolderBase]: 1241/2990 cut-off events. [2025-03-04 06:55:41,975 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2025-03-04 06:55:41,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2990 events. 1241/2990 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20463 event pairs, 675 based on Foata normal form. 0/2699 useless extension candidates. Maximal degree in co-relation 5042. Up to 1673 conditions per place. [2025-03-04 06:55:41,991 INFO L140 encePairwiseOnDemand]: 377/383 looper letters, 30 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-03-04 06:55:41,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 274 transitions, 646 flow [2025-03-04 06:55:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-04 06:55:41,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7606614447345518 [2025-03-04 06:55:41,994 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 558 flow. Second operand 3 states and 874 transitions. [2025-03-04 06:55:41,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 274 transitions, 646 flow [2025-03-04 06:55:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 274 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:41,997 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 586 flow [2025-03-04 06:55:41,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2025-03-04 06:55:41,998 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2025-03-04 06:55:41,998 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 586 flow [2025-03-04 06:55:41,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:41,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:41,998 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-04 06:55:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:41,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1340958667, now seen corresponding path program 1 times [2025-03-04 06:55:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165468867] [2025-03-04 06:55:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:42,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:55:42,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:55:42,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:42,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:42,054 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-04 06:55:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165468867] [2025-03-04 06:55:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165468867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891963695] [2025-03-04 06:55:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:42,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:42,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:42,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:42,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 383 [2025-03-04 06:55:42,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:42,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:42,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 383 [2025-03-04 06:55:42,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:42,388 INFO L124 PetriNetUnfolderBase]: 1241/2986 cut-off events. [2025-03-04 06:55:42,388 INFO L125 PetriNetUnfolderBase]: For 727/727 co-relation queries the response was YES. [2025-03-04 06:55:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 2986 events. 1241/2986 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20518 event pairs, 756 based on Foata normal form. 4/2696 useless extension candidates. Maximal degree in co-relation 5433. Up to 1676 conditions per place. [2025-03-04 06:55:42,393 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 0 selfloop transitions, 0 changer transitions 269/269 dead transitions. [2025-03-04 06:55:42,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 642 flow [2025-03-04 06:55:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-03-04 06:55:42,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7545691906005222 [2025-03-04 06:55:42,395 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 586 flow. Second operand 3 states and 867 transitions. [2025-03-04 06:55:42,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 642 flow [2025-03-04 06:55:42,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 269 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:42,397 INFO L231 Difference]: Finished difference. Result has 273 places, 0 transitions, 0 flow [2025-03-04 06:55:42,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=273, PETRI_TRANSITIONS=0} [2025-03-04 06:55:42,398 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -90 predicate places. [2025-03-04 06:55:42,398 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 0 transitions, 0 flow [2025-03-04 06:55:42,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2025-03-04 06:55:42,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2025-03-04 06:55:42,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2025-03-04 06:55:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2025-03-04 06:55:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2025-03-04 06:55:42,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2025-03-04 06:55:42,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2025-03-04 06:55:42,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2025-03-04 06:55:42,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2025-03-04 06:55:42,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2025-03-04 06:55:42,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2025-03-04 06:55:42,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2025-03-04 06:55:42,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2025-03-04 06:55:42,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2025-03-04 06:55:42,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2025-03-04 06:55:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:42,414 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:42,420 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:42,420 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:42,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:42 BasicIcfg [2025-03-04 06:55:42,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:42,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:42,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:42,427 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:42,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:34" (3/4) ... [2025-03-04 06:55:42,430 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:42,432 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:42,433 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:42,433 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:42,433 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:55:42,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-04 06:55:42,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:42,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:55:42,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:42,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:42,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:42,517 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:42,518 INFO L158 Benchmark]: Toolchain (without parser) took 9612.01ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 133.7MB in the beginning and 798.1MB in the end (delta: -664.5MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2025-03-04 06:55:42,518 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:42,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.40ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 119.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:42,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 116.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:42,519 INFO L158 Benchmark]: Boogie Preprocessor took 50.11ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 113.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:42,519 INFO L158 Benchmark]: IcfgBuilder took 1111.06ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 67.9MB in the end (delta: 45.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2025-03-04 06:55:42,520 INFO L158 Benchmark]: TraceAbstraction took 8030.58ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 67.0MB in the beginning and 806.5MB in the end (delta: -739.5MB). Peak memory consumption was 614.7MB. Max. memory is 16.1GB. [2025-03-04 06:55:42,520 INFO L158 Benchmark]: Witness Printer took 90.71ms. Allocated memory is still 964.7MB. Free memory was 806.5MB in the beginning and 798.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:55:42,521 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.26ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.40ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 119.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 116.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.11ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 113.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1111.06ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 67.9MB in the end (delta: 45.8MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8030.58ms. Allocated memory was 167.8MB in the beginning and 964.7MB in the end (delta: 796.9MB). Free memory was 67.0MB in the beginning and 806.5MB in the end (delta: -739.5MB). Peak memory consumption was 614.7MB. Max. memory is 16.1GB. * Witness Printer took 90.71ms. Allocated memory is still 964.7MB. Free memory was 806.5MB in the beginning and 798.1MB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 130]: 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: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: 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: 163]: 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: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: 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: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 479 locations, 163 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: 7.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 37 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=748occurred in iteration=0, InterpolantAutomatonStates: 57, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:42,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE