./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:32:14,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:32:14,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:32:14,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:32:14,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:32:14,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:32:14,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:32:14,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:32:14,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:32:14,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:32:14,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:32:14,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:32:14,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:32:14,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:14,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:32:14,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:32:14,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:32:14,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:32:14,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:32:14,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:32:14,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2025-02-06 09:32:14,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:32:14,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:32:14,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:32:14,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:32:14,519 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:32:14,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-02-06 09:32:15,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c55c78/9ae57bd0a26f4ed29bbc1e17ec394cfb/FLAGdb3935fcd [2025-02-06 09:32:16,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:32:16,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-02-06 09:32:16,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c55c78/9ae57bd0a26f4ed29bbc1e17ec394cfb/FLAGdb3935fcd [2025-02-06 09:32:16,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39c55c78/9ae57bd0a26f4ed29bbc1e17ec394cfb [2025-02-06 09:32:16,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:32:16,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:32:16,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:16,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:32:16,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:32:16,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bee522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16, skipping insertion in model container [2025-02-06 09:32:16,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:32:16,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:16,690 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:32:16,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:16,749 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:32:16,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16 WrapperNode [2025-02-06 09:32:16,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:16,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:16,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:32:16,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:32:16,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,802 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 451 [2025-02-06 09:32:16,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:16,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:32:16,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:32:16,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:32:16,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:32:16,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:32:16,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:32:16,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:32:16,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (1/1) ... [2025-02-06 09:32:16,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:32:16,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:32:16,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:32:16,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:32:16,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:32:16,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:32:16,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:32:16,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:32:16,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:32:16,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:32:16,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:32:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:32:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:32:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:32:16,919 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:32:17,007 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:32:17,009 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:32:17,490 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:32:17,491 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:32:17,738 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:32:17,738 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:32:17,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:17 BoogieIcfgContainer [2025-02-06 09:32:17,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:32:17,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:32:17,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:32:17,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:32:17,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:32:16" (1/3) ... [2025-02-06 09:32:17,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3771a160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:17, skipping insertion in model container [2025-02-06 09:32:17,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:16" (2/3) ... [2025-02-06 09:32:17,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3771a160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:17, skipping insertion in model container [2025-02-06 09:32:17,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:17" (3/3) ... [2025-02-06 09:32:17,746 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2025-02-06 09:32:17,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:32:17,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons3.wvr.c that has 5 procedures, 357 locations, 1 initial locations, 5 loop locations, and 68 error locations. [2025-02-06 09:32:17,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:32:17,866 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:32:17,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 369 transitions, 766 flow [2025-02-06 09:32:18,065 INFO L124 PetriNetUnfolderBase]: 13/365 cut-off events. [2025-02-06 09:32:18,066 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:32:18,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 365 events. 13/365 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 514 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 338. Up to 2 conditions per place. [2025-02-06 09:32:18,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 369 transitions, 766 flow [2025-02-06 09:32:18,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 348 transitions, 720 flow [2025-02-06 09:32:18,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:32:18,089 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;@da3f1b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:32:18,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 121 error locations. [2025-02-06 09:32:18,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:32:18,098 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-02-06 09:32:18,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:32:18,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:18,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:18,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash 194007394, now seen corresponding path program 1 times [2025-02-06 09:32:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917113788] [2025-02-06 09:32:18,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:18,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:32:18,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:32:18,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:18,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917113788] [2025-02-06 09:32:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917113788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441403431] [2025-02-06 09:32:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:18,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:18,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:18,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:18,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 369 [2025-02-06 09:32:18,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 348 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:18,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:18,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 369 [2025-02-06 09:32:18,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:18,807 INFO L124 PetriNetUnfolderBase]: 752/1727 cut-off events. [2025-02-06 09:32:18,807 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 09:32:18,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1727 events. 752/1727 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9949 event pairs, 600 based on Foata normal form. 6/1582 useless extension candidates. Maximal degree in co-relation 2698. Up to 1053 conditions per place. [2025-02-06 09:32:18,827 INFO L140 encePairwiseOnDemand]: 312/369 looper letters, 26 selfloop transitions, 2 changer transitions 6/293 dead transitions. [2025-02-06 09:32:18,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 666 flow [2025-02-06 09:32:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-02-06 09:32:18,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419150858175248 [2025-02-06 09:32:18,846 INFO L175 Difference]: Start difference. First operand has 349 places, 348 transitions, 720 flow. Second operand 3 states and 932 transitions. [2025-02-06 09:32:18,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 293 transitions, 666 flow [2025-02-06 09:32:18,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 293 transitions, 650 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 09:32:18,858 INFO L231 Difference]: Finished difference. Result has 294 places, 287 transitions, 586 flow [2025-02-06 09:32:18,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=294, PETRI_TRANSITIONS=287} [2025-02-06 09:32:18,862 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -55 predicate places. [2025-02-06 09:32:18,862 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 287 transitions, 586 flow [2025-02-06 09:32:18,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:18,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:18,863 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] [2025-02-06 09:32:18,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:32:18,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1077156856, now seen corresponding path program 1 times [2025-02-06 09:32:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697336969] [2025-02-06 09:32:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:18,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:32:18,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:32:18,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:18,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697336969] [2025-02-06 09:32:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697336969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251170594] [2025-02-06 09:32:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:18,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:18,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:18,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 369 [2025-02-06 09:32:18,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 287 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:18,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:18,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 369 [2025-02-06 09:32:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:19,294 INFO L124 PetriNetUnfolderBase]: 923/1998 cut-off events. [2025-02-06 09:32:19,294 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:32:19,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 1998 events. 923/1998 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11750 event pairs, 743 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 3385. Up to 1288 conditions per place. [2025-02-06 09:32:19,302 INFO L140 encePairwiseOnDemand]: 365/369 looper letters, 26 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-02-06 09:32:19,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 284 transitions, 634 flow [2025-02-06 09:32:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-02-06 09:32:19,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7940379403794038 [2025-02-06 09:32:19,304 INFO L175 Difference]: Start difference. First operand has 294 places, 287 transitions, 586 flow. Second operand 3 states and 879 transitions. [2025-02-06 09:32:19,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 284 transitions, 634 flow [2025-02-06 09:32:19,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:19,308 INFO L231 Difference]: Finished difference. Result has 285 places, 284 transitions, 578 flow [2025-02-06 09:32:19,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=284} [2025-02-06 09:32:19,311 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2025-02-06 09:32:19,311 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 284 transitions, 578 flow [2025-02-06 09:32:19,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:19,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:19,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:32:19,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:19,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -162182003, now seen corresponding path program 1 times [2025-02-06 09:32:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:19,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037504097] [2025-02-06 09:32:19,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:19,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:19,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:32:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:32:19,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037504097] [2025-02-06 09:32:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037504097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290052830] [2025-02-06 09:32:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:19,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:19,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:19,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:19,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-02-06 09:32:19,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:19,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-02-06 09:32:19,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:19,546 INFO L124 PetriNetUnfolderBase]: 565/1385 cut-off events. [2025-02-06 09:32:19,547 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:32:19,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1385 events. 565/1385 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7611 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2025-02-06 09:32:19,555 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-02-06 09:32:19,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 283 transitions, 628 flow [2025-02-06 09:32:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-06 09:32:19,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-02-06 09:32:19,558 INFO L175 Difference]: Start difference. First operand has 285 places, 284 transitions, 578 flow. Second operand 3 states and 882 transitions. [2025-02-06 09:32:19,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 283 transitions, 628 flow [2025-02-06 09:32:19,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 283 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:19,561 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 579 flow [2025-02-06 09:32:19,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2025-02-06 09:32:19,562 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2025-02-06 09:32:19,562 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 579 flow [2025-02-06 09:32:19,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:19,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:19,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:32:19,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:19,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1693395706, now seen corresponding path program 1 times [2025-02-06 09:32:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759070923] [2025-02-06 09:32:19,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:19,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:32:19,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:32:19,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:19,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759070923] [2025-02-06 09:32:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759070923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510510262] [2025-02-06 09:32:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:19,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:19,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:19,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-02-06 09:32:19,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:19,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-02-06 09:32:19,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:19,810 INFO L124 PetriNetUnfolderBase]: 565/1384 cut-off events. [2025-02-06 09:32:19,810 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:32:19,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1384 events. 565/1384 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7631 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2247. Up to 815 conditions per place. [2025-02-06 09:32:19,817 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-02-06 09:32:19,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 282 transitions, 629 flow [2025-02-06 09:32:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-06 09:32:19,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-02-06 09:32:19,820 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 579 flow. Second operand 3 states and 882 transitions. [2025-02-06 09:32:19,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 282 transitions, 629 flow [2025-02-06 09:32:19,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:19,823 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 577 flow [2025-02-06 09:32:19,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2025-02-06 09:32:19,825 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -65 predicate places. [2025-02-06 09:32:19,825 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 577 flow [2025-02-06 09:32:19,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:19,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:32:19,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1443234765, now seen corresponding path program 1 times [2025-02-06 09:32:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680684491] [2025-02-06 09:32:19,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:19,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:32:19,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:32:19,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:19,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:19,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680684491] [2025-02-06 09:32:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680684491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142345326] [2025-02-06 09:32:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:19,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:19,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:19,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-02-06 09:32:19,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:19,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:19,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-02-06 09:32:19,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:20,214 INFO L124 PetriNetUnfolderBase]: 565/1383 cut-off events. [2025-02-06 09:32:20,214 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:32:20,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1383 events. 565/1383 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7628 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2025-02-06 09:32:20,224 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-02-06 09:32:20,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 281 transitions, 627 flow [2025-02-06 09:32:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-06 09:32:20,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-02-06 09:32:20,229 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 577 flow. Second operand 3 states and 882 transitions. [2025-02-06 09:32:20,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 281 transitions, 627 flow [2025-02-06 09:32:20,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:20,232 INFO L231 Difference]: Finished difference. Result has 283 places, 281 transitions, 575 flow [2025-02-06 09:32:20,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=283, PETRI_TRANSITIONS=281} [2025-02-06 09:32:20,233 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -66 predicate places. [2025-02-06 09:32:20,233 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 281 transitions, 575 flow [2025-02-06 09:32:20,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:20,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:32:20,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:20,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 9167538, now seen corresponding path program 1 times [2025-02-06 09:32:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027037104] [2025-02-06 09:32:20,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:20,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:32:20,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:32:20,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:20,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027037104] [2025-02-06 09:32:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027037104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275278844] [2025-02-06 09:32:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:20,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:20,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:20,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-02-06 09:32:20,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 281 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:20,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-02-06 09:32:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:20,445 INFO L124 PetriNetUnfolderBase]: 565/1382 cut-off events. [2025-02-06 09:32:20,446 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:32:20,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1382 events. 565/1382 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7604 event pairs, 457 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 2245. Up to 815 conditions per place. [2025-02-06 09:32:20,452 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-02-06 09:32:20,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 280 transitions, 625 flow [2025-02-06 09:32:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-06 09:32:20,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-02-06 09:32:20,453 INFO L175 Difference]: Start difference. First operand has 283 places, 281 transitions, 575 flow. Second operand 3 states and 882 transitions. [2025-02-06 09:32:20,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 280 transitions, 625 flow [2025-02-06 09:32:20,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 280 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:20,456 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 573 flow [2025-02-06 09:32:20,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=280, 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=573, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2025-02-06 09:32:20,457 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:20,457 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 573 flow [2025-02-06 09:32:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:20,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:32:20,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1067576980, now seen corresponding path program 1 times [2025-02-06 09:32:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884079843] [2025-02-06 09:32:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:20,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 09:32:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 09:32:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:20,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884079843] [2025-02-06 09:32:20,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884079843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:20,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540124608] [2025-02-06 09:32:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:20,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:20,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:20,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-02-06 09:32:20,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:20,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-02-06 09:32:20,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:20,661 INFO L124 PetriNetUnfolderBase]: 687/1772 cut-off events. [2025-02-06 09:32:20,662 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-06 09:32:20,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1772 events. 687/1772 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11088 event pairs, 280 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 2828. Up to 697 conditions per place. [2025-02-06 09:32:20,670 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 35 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-02-06 09:32:20,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 679 flow [2025-02-06 09:32:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-02-06 09:32:20,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175248419150858 [2025-02-06 09:32:20,672 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 573 flow. Second operand 3 states and 905 transitions. [2025-02-06 09:32:20,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 679 flow [2025-02-06 09:32:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:20,677 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 577 flow [2025-02-06 09:32:20,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2025-02-06 09:32:20,678 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:20,678 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 577 flow [2025-02-06 09:32:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:20,679 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-02-06 09:32:20,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:32:20,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:20,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1422881706, now seen corresponding path program 1 times [2025-02-06 09:32:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156727322] [2025-02-06 09:32:20,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:20,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 09:32:20,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 09:32:20,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:20,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156727322] [2025-02-06 09:32:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156727322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439320350] [2025-02-06 09:32:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:20,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:20,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:20,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-02-06 09:32:20,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:20,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:20,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-02-06 09:32:20,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:21,029 INFO L124 PetriNetUnfolderBase]: 687/1688 cut-off events. [2025-02-06 09:32:21,030 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-02-06 09:32:21,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1688 events. 687/1688 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10199 event pairs, 566 based on Foata normal form. 0/1573 useless extension candidates. Maximal degree in co-relation 2885. Up to 994 conditions per place. [2025-02-06 09:32:21,040 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 24 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-02-06 09:32:21,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 279 transitions, 627 flow [2025-02-06 09:32:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-06 09:32:21,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-02-06 09:32:21,042 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 577 flow. Second operand 3 states and 884 transitions. [2025-02-06 09:32:21,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 279 transitions, 627 flow [2025-02-06 09:32:21,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:21,048 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 577 flow [2025-02-06 09:32:21,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=280, 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=577, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2025-02-06 09:32:21,049 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:21,050 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 577 flow [2025-02-06 09:32:21,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:21,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:21,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:32:21,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2035476075, now seen corresponding path program 1 times [2025-02-06 09:32:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036123014] [2025-02-06 09:32:21,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:21,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 09:32:21,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 09:32:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036123014] [2025-02-06 09:32:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036123014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584009217] [2025-02-06 09:32:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:21,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:21,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-02-06 09:32:21,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:21,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-02-06 09:32:21,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:21,413 INFO L124 PetriNetUnfolderBase]: 851/2155 cut-off events. [2025-02-06 09:32:21,413 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-06 09:32:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 2155 events. 851/2155 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14576 event pairs, 264 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 3586. Up to 776 conditions per place. [2025-02-06 09:32:21,424 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 37 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-02-06 09:32:21,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 692 flow [2025-02-06 09:32:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-02-06 09:32:21,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175248419150858 [2025-02-06 09:32:21,427 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 577 flow. Second operand 3 states and 905 transitions. [2025-02-06 09:32:21,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 692 flow [2025-02-06 09:32:21,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:21,432 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 581 flow [2025-02-06 09:32:21,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2025-02-06 09:32:21,433 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:21,433 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 581 flow [2025-02-06 09:32:21,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:21,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] [2025-02-06 09:32:21,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:32:21,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -761893449, now seen corresponding path program 1 times [2025-02-06 09:32:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:21,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765335254] [2025-02-06 09:32:21,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:21,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:32:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:32:21,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:21,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765335254] [2025-02-06 09:32:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765335254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:21,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614815075] [2025-02-06 09:32:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:21,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:21,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:21,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-02-06 09:32:21,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:21,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-02-06 09:32:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:21,709 INFO L124 PetriNetUnfolderBase]: 851/2198 cut-off events. [2025-02-06 09:32:21,709 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2025-02-06 09:32:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 2198 events. 851/2198 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15211 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3839. Up to 1234 conditions per place. [2025-02-06 09:32:21,718 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-02-06 09:32:21,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 633 flow [2025-02-06 09:32:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-06 09:32:21,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-02-06 09:32:21,720 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 581 flow. Second operand 3 states and 884 transitions. [2025-02-06 09:32:21,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 633 flow [2025-02-06 09:32:21,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 278 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:21,722 INFO L231 Difference]: Finished difference. Result has 282 places, 278 transitions, 581 flow [2025-02-06 09:32:21,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=280, 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=581, PETRI_PLACES=282, PETRI_TRANSITIONS=278} [2025-02-06 09:32:21,723 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:21,723 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 278 transitions, 581 flow [2025-02-06 09:32:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:21,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:32:21,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -639005874, now seen corresponding path program 1 times [2025-02-06 09:32:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474314572] [2025-02-06 09:32:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:21,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 09:32:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 09:32:21,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474314572] [2025-02-06 09:32:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474314572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037603099] [2025-02-06 09:32:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:21,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:21,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:21,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 369 [2025-02-06 09:32:21,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 278 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:21,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 369 [2025-02-06 09:32:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:21,953 INFO L124 PetriNetUnfolderBase]: 851/2197 cut-off events. [2025-02-06 09:32:21,953 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:21,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 2197 events. 851/2197 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15258 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3774. Up to 1238 conditions per place. [2025-02-06 09:32:21,964 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 26 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-02-06 09:32:21,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 277 transitions, 635 flow [2025-02-06 09:32:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2025-02-06 09:32:21,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2025-02-06 09:32:21,966 INFO L175 Difference]: Start difference. First operand has 282 places, 278 transitions, 581 flow. Second operand 3 states and 882 transitions. [2025-02-06 09:32:21,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 277 transitions, 635 flow [2025-02-06 09:32:21,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 277 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:21,970 INFO L231 Difference]: Finished difference. Result has 281 places, 277 transitions, 579 flow [2025-02-06 09:32:21,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=279, 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=579, PETRI_PLACES=281, PETRI_TRANSITIONS=277} [2025-02-06 09:32:21,970 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -68 predicate places. [2025-02-06 09:32:21,970 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 277 transitions, 579 flow [2025-02-06 09:32:21,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:21,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:21,971 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] [2025-02-06 09:32:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:32:21,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:21,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1327808497, now seen corresponding path program 1 times [2025-02-06 09:32:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531136948] [2025-02-06 09:32:21,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:21,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:32:21,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:32:21,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531136948] [2025-02-06 09:32:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531136948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:22,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574120916] [2025-02-06 09:32:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:22,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:22,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:22,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:22,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-02-06 09:32:22,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 277 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:22,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:22,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-02-06 09:32:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:22,217 INFO L124 PetriNetUnfolderBase]: 851/2196 cut-off events. [2025-02-06 09:32:22,217 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:22,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2196 events. 851/2196 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15245 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3768. Up to 1232 conditions per place. [2025-02-06 09:32:22,229 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2025-02-06 09:32:22,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 627 flow [2025-02-06 09:32:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-02-06 09:32:22,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-02-06 09:32:22,231 INFO L175 Difference]: Start difference. First operand has 281 places, 277 transitions, 579 flow. Second operand 3 states and 891 transitions. [2025-02-06 09:32:22,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 627 flow [2025-02-06 09:32:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:22,234 INFO L231 Difference]: Finished difference. Result has 280 places, 276 transitions, 575 flow [2025-02-06 09:32:22,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=280, PETRI_TRANSITIONS=276} [2025-02-06 09:32:22,236 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -69 predicate places. [2025-02-06 09:32:22,236 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 276 transitions, 575 flow [2025-02-06 09:32:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:22,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:22,237 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-02-06 09:32:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:32:22,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1046587414, now seen corresponding path program 1 times [2025-02-06 09:32:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953286498] [2025-02-06 09:32:22,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:22,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:32:22,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:32:22,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:22,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:22,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:22,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953286498] [2025-02-06 09:32:22,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953286498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40119935] [2025-02-06 09:32:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:22,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:22,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:22,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:22,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 369 [2025-02-06 09:32:22,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 276 transitions, 575 flow. Second operand has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:22,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:22,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 369 [2025-02-06 09:32:22,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:23,003 INFO L124 PetriNetUnfolderBase]: 851/2194 cut-off events. [2025-02-06 09:32:23,003 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:23,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 2194 events. 851/2194 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15210 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3788. Up to 1247 conditions per place. [2025-02-06 09:32:23,011 INFO L140 encePairwiseOnDemand]: 357/369 looper letters, 38 selfloop transitions, 10 changer transitions 0/274 dead transitions. [2025-02-06 09:32:23,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 274 transitions, 667 flow [2025-02-06 09:32:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1638 transitions. [2025-02-06 09:32:23,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7398373983739838 [2025-02-06 09:32:23,013 INFO L175 Difference]: Start difference. First operand has 280 places, 276 transitions, 575 flow. Second operand 6 states and 1638 transitions. [2025-02-06 09:32:23,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 274 transitions, 667 flow [2025-02-06 09:32:23,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:23,016 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 590 flow [2025-02-06 09:32:23,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2025-02-06 09:32:23,017 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2025-02-06 09:32:23,017 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 590 flow [2025-02-06 09:32:23,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:23,018 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-02-06 09:32:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:32:23,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:23,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1030631127, now seen corresponding path program 1 times [2025-02-06 09:32:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589021812] [2025-02-06 09:32:23,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:32:23,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:32:23,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:23,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589021812] [2025-02-06 09:32:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589021812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:23,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073570677] [2025-02-06 09:32:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:23,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:23,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:23,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:23,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-02-06 09:32:23,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:23,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-02-06 09:32:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:23,441 INFO L124 PetriNetUnfolderBase]: 851/2193 cut-off events. [2025-02-06 09:32:23,445 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:23,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 2193 events. 851/2193 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15201 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3780. Up to 1234 conditions per place. [2025-02-06 09:32:23,469 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-06 09:32:23,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 273 transitions, 642 flow [2025-02-06 09:32:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-06 09:32:23,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-02-06 09:32:23,476 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 590 flow. Second operand 3 states and 884 transitions. [2025-02-06 09:32:23,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 273 transitions, 642 flow [2025-02-06 09:32:23,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 273 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:32:23,485 INFO L231 Difference]: Finished difference. Result has 278 places, 273 transitions, 572 flow [2025-02-06 09:32:23,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=278, PETRI_TRANSITIONS=273} [2025-02-06 09:32:23,488 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -71 predicate places. [2025-02-06 09:32:23,488 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 273 transitions, 572 flow [2025-02-06 09:32:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:23,489 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] [2025-02-06 09:32:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:32:23,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1821323422, now seen corresponding path program 1 times [2025-02-06 09:32:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878144580] [2025-02-06 09:32:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:23,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 09:32:23,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 09:32:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:23,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878144580] [2025-02-06 09:32:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878144580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:23,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686834666] [2025-02-06 09:32:23,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:23,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:23,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:23,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:23,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-02-06 09:32:23,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 273 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:23,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-02-06 09:32:23,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:23,778 INFO L124 PetriNetUnfolderBase]: 851/2192 cut-off events. [2025-02-06 09:32:23,778 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:23,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2192 events. 851/2192 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15252 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3765. Up to 1232 conditions per place. [2025-02-06 09:32:23,787 INFO L140 encePairwiseOnDemand]: 367/369 looper letters, 24 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2025-02-06 09:32:23,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 272 transitions, 620 flow [2025-02-06 09:32:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-02-06 09:32:23,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2025-02-06 09:32:23,790 INFO L175 Difference]: Start difference. First operand has 278 places, 273 transitions, 572 flow. Second operand 3 states and 891 transitions. [2025-02-06 09:32:23,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 272 transitions, 620 flow [2025-02-06 09:32:23,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:23,794 INFO L231 Difference]: Finished difference. Result has 277 places, 272 transitions, 568 flow [2025-02-06 09:32:23,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=277, PETRI_TRANSITIONS=272} [2025-02-06 09:32:23,795 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2025-02-06 09:32:23,795 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 272 transitions, 568 flow [2025-02-06 09:32:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:23,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:32:23,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:23,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1832787632, now seen corresponding path program 1 times [2025-02-06 09:32:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:23,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515594706] [2025-02-06 09:32:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 09:32:23,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 09:32:23,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:23,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515594706] [2025-02-06 09:32:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515594706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092581367] [2025-02-06 09:32:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:23,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:23,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:23,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 369 [2025-02-06 09:32:23,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 272 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:23,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:23,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 369 [2025-02-06 09:32:23,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:24,166 INFO L124 PetriNetUnfolderBase]: 851/2191 cut-off events. [2025-02-06 09:32:24,166 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 09:32:24,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2191 events. 851/2191 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15249 event pairs, 719 based on Foata normal form. 0/2021 useless extension candidates. Maximal degree in co-relation 3764. Up to 1234 conditions per place. [2025-02-06 09:32:24,178 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2025-02-06 09:32:24,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 620 flow [2025-02-06 09:32:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-02-06 09:32:24,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985546522131888 [2025-02-06 09:32:24,181 INFO L175 Difference]: Start difference. First operand has 277 places, 272 transitions, 568 flow. Second operand 3 states and 884 transitions. [2025-02-06 09:32:24,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 620 flow [2025-02-06 09:32:24,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 271 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:24,184 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 569 flow [2025-02-06 09:32:24,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2025-02-06 09:32:24,185 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2025-02-06 09:32:24,185 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 569 flow [2025-02-06 09:32:24,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:24,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:24,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:32:24,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2025-02-06 09:32:24,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1934662348, now seen corresponding path program 1 times [2025-02-06 09:32:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853728378] [2025-02-06 09:32:24,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:24,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:32:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:32:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:24,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853728378] [2025-02-06 09:32:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853728378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:24,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827772577] [2025-02-06 09:32:24,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:24,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:24,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:24,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:24,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 369 [2025-02-06 09:32:24,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:24,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:24,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 369 [2025-02-06 09:32:24,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:24,547 INFO L124 PetriNetUnfolderBase]: 1357/2994 cut-off events. [2025-02-06 09:32:24,548 INFO L125 PetriNetUnfolderBase]: For 613/614 co-relation queries the response was YES. [2025-02-06 09:32:24,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 2994 events. 1357/2994 cut-off events. For 613/614 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20488 event pairs, 460 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 5304. Up to 1440 conditions per place. [2025-02-06 09:32:24,557 INFO L140 encePairwiseOnDemand]: 361/369 looper letters, 0 selfloop transitions, 0 changer transitions 292/292 dead transitions. [2025-02-06 09:32:24,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 292 transitions, 718 flow [2025-02-06 09:32:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-02-06 09:32:24,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8220415537488708 [2025-02-06 09:32:24,559 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 569 flow. Second operand 3 states and 910 transitions. [2025-02-06 09:32:24,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 292 transitions, 718 flow [2025-02-06 09:32:24,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 292 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:24,562 INFO L231 Difference]: Finished difference. Result has 276 places, 0 transitions, 0 flow [2025-02-06 09:32:24,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=276, PETRI_TRANSITIONS=0} [2025-02-06 09:32:24,563 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -73 predicate places. [2025-02-06 09:32:24,563 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 0 transitions, 0 flow [2025-02-06 09:32:24,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (120 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (119 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (118 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (117 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (116 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (115 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (114 of 121 remaining) [2025-02-06 09:32:24,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (113 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (112 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (111 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (110 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (109 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (108 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (107 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (106 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (105 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (104 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (103 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (102 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (101 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (100 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (99 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (98 of 121 remaining) [2025-02-06 09:32:24,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (97 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (96 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (94 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (91 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (90 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (89 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (88 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (87 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (86 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (77 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (76 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (75 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (74 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (73 of 121 remaining) [2025-02-06 09:32:24,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (72 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (71 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (70 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (69 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (68 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (67 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (66 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (64 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (63 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (62 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (60 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (59 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (58 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (57 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (51 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (49 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (45 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 121 remaining) [2025-02-06 09:32:24,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (38 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (37 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (36 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (35 of 121 remaining) [2025-02-06 09:32:24,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (34 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (33 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (32 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (31 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (29 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (27 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (25 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (23 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (21 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (18 of 121 remaining) [2025-02-06 09:32:24,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (16 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (15 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (14 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (13 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (11 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 121 remaining) [2025-02-06 09:32:24,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 121 remaining) [2025-02-06 09:32:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:32:24,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:24,575 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:32:24,575 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:32:24,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:32:24 BasicIcfg [2025-02-06 09:32:24,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:32:24,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:32:24,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:32:24,580 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:32:24,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:17" (3/4) ... [2025-02-06 09:32:24,581 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:32:24,583 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:32:24,583 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:32:24,583 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:32:24,583 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:32:24,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-02-06 09:32:24,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:32:24,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 09:32:24,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:32:24,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:32:24,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:32:24,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:32:24,643 INFO L158 Benchmark]: Toolchain (without parser) took 8277.31ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 109.3MB in the beginning and 450.3MB in the end (delta: -341.0MB). Peak memory consumption was 532.1MB. Max. memory is 16.1GB. [2025-02-06 09:32:24,643 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:24,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.57ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 95.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:32:24,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.90ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 91.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:24,643 INFO L158 Benchmark]: Boogie Preprocessor took 45.96ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:24,643 INFO L158 Benchmark]: IcfgBuilder took 889.44ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 68.5MB in the end (delta: 20.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-02-06 09:32:24,644 INFO L158 Benchmark]: TraceAbstraction took 6839.59ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 67.8MB in the beginning and 458.7MB in the end (delta: -391.0MB). Peak memory consumption was 483.3MB. Max. memory is 16.1GB. [2025-02-06 09:32:24,644 INFO L158 Benchmark]: Witness Printer took 62.33ms. Allocated memory is still 1.0GB. Free memory was 458.7MB in the beginning and 450.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:32:24,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.57ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 95.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.90ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 91.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.96ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 889.44ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 68.5MB in the end (delta: 20.9MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6839.59ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 67.8MB in the beginning and 458.7MB in the end (delta: -391.0MB). Peak memory consumption was 483.3MB. Max. memory is 16.1GB. * Witness Printer took 62.33ms. Allocated memory is still 1.0GB. Free memory was 458.7MB in the beginning and 450.3MB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 85]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: 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: 161]: 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: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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, 452 locations, 121 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 948 IncrementalHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 62 mSDtfsCounter, 948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=0, InterpolantAutomatonStates: 54, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 68 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:32:24,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE