./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:07:01,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:01,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:01,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:01,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:01,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:01,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:01,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:01,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:01,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:01,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:01,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:01,598 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:01,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:01,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:01,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:01,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:01,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:01,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:01,600 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2025-03-08 22:07:01,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:01,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:01,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:01,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:01,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:01,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-03-08 22:07:03,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943b97500/0230c78b277043288d49eebea5bdea0d/FLAG529efe470 [2025-03-08 22:07:03,236 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:03,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-03-08 22:07:03,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943b97500/0230c78b277043288d49eebea5bdea0d/FLAG529efe470 [2025-03-08 22:07:03,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943b97500/0230c78b277043288d49eebea5bdea0d [2025-03-08 22:07:03,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:03,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:03,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:03,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:03,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:03,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03, skipping insertion in model container [2025-03-08 22:07:03,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:03,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:03,786 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:03,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:03,835 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:03,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03 WrapperNode [2025-03-08 22:07:03,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:03,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:03,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:03,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:03,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,878 INFO L138 Inliner]: procedures = 24, calls = 47, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 598 [2025-03-08 22:07:03,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:03,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:03,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:03,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:03,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:03,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:03,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:03,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:03,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (1/1) ... [2025-03-08 22:07:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:03,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:07:03,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:07:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:03,968 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:07:04,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:04,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:04,610 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:04,610 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:04,973 WARN L170 LargeBlockEncoding]: Complex 2:6 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-08 22:07:04,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:04,985 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:04,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:04 BoogieIcfgContainer [2025-03-08 22:07:04,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:04,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:04,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:04,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:04,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:03" (1/3) ... [2025-03-08 22:07:04,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f878e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:04, skipping insertion in model container [2025-03-08 22:07:04,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:03" (2/3) ... [2025-03-08 22:07:04,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f878e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:04, skipping insertion in model container [2025-03-08 22:07:04,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:04" (3/3) ... [2025-03-08 22:07:04,993 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2025-03-08 22:07:05,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:05,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring.wvr.c that has 4 procedures, 437 locations, 1 initial locations, 6 loop locations, and 90 error locations. [2025-03-08 22:07:05,005 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:05,097 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:07:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 459 transitions, 939 flow [2025-03-08 22:07:05,290 INFO L124 PetriNetUnfolderBase]: 23/456 cut-off events. [2025-03-08 22:07:05,293 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:05,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 456 events. 23/456 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 804 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 406. Up to 2 conditions per place. [2025-03-08 22:07:05,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 459 transitions, 939 flow [2025-03-08 22:07:05,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 439 transitions, 896 flow [2025-03-08 22:07:05,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:05,325 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;@be46943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:05,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2025-03-08 22:07:05,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:05,334 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-08 22:07:05,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:05,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:05,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:05,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:05,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1452198637, now seen corresponding path program 1 times [2025-03-08 22:07:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640160828] [2025-03-08 22:07:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:05,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:07:05,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:07:05,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:05,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640160828] [2025-03-08 22:07:05,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640160828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:05,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:05,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21760042] [2025-03-08 22:07:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:05,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:05,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:05,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:05,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 459 [2025-03-08 22:07:05,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:05,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:05,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 459 [2025-03-08 22:07:05,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:05,784 INFO L124 PetriNetUnfolderBase]: 148/837 cut-off events. [2025-03-08 22:07:05,784 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-08 22:07:05,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 837 events. 148/837 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3463 event pairs, 92 based on Foata normal form. 7/744 useless extension candidates. Maximal degree in co-relation 727. Up to 219 conditions per place. [2025-03-08 22:07:05,793 INFO L140 encePairwiseOnDemand]: 378/459 looper letters, 18 selfloop transitions, 2 changer transitions 7/360 dead transitions. [2025-03-08 22:07:05,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 778 flow [2025-03-08 22:07:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1170 transitions. [2025-03-08 22:07:05,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2025-03-08 22:07:05,813 INFO L175 Difference]: Start difference. First operand has 427 places, 439 transitions, 896 flow. Second operand 3 states and 1170 transitions. [2025-03-08 22:07:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 778 flow [2025-03-08 22:07:05,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 766 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:07:05,829 INFO L231 Difference]: Finished difference. Result has 360 places, 353 transitions, 716 flow [2025-03-08 22:07:05,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=360, PETRI_TRANSITIONS=353} [2025-03-08 22:07:05,835 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -67 predicate places. [2025-03-08 22:07:05,836 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 353 transitions, 716 flow [2025-03-08 22:07:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:05,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:05,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:07:05,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1719823921, now seen corresponding path program 1 times [2025-03-08 22:07:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604727461] [2025-03-08 22:07:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:05,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:07:05,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:07:05,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:05,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:05,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604727461] [2025-03-08 22:07:05,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604727461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:05,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:05,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:05,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998817007] [2025-03-08 22:07:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:05,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:05,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:05,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:05,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:05,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:06,118 INFO L124 PetriNetUnfolderBase]: 135/808 cut-off events. [2025-03-08 22:07:06,119 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:06,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 808 events. 135/808 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3355 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 987. Up to 195 conditions per place. [2025-03-08 22:07:06,122 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-03-08 22:07:06,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 752 flow [2025-03-08 22:07:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:06,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:06,126 INFO L175 Difference]: Start difference. First operand has 360 places, 353 transitions, 716 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:06,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 352 transitions, 752 flow [2025-03-08 22:07:06,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 352 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:06,131 INFO L231 Difference]: Finished difference. Result has 352 places, 352 transitions, 714 flow [2025-03-08 22:07:06,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=352, PETRI_TRANSITIONS=352} [2025-03-08 22:07:06,133 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -75 predicate places. [2025-03-08 22:07:06,133 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 352 transitions, 714 flow [2025-03-08 22:07:06,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:06,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:06,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:07:06,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1493221309, now seen corresponding path program 1 times [2025-03-08 22:07:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101955905] [2025-03-08 22:07:06,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:06,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 22:07:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:07:06,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:06,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101955905] [2025-03-08 22:07:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101955905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895765881] [2025-03-08 22:07:06,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:06,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:06,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:06,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:06,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:06,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:06,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:06,370 INFO L124 PetriNetUnfolderBase]: 135/807 cut-off events. [2025-03-08 22:07:06,370 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:06,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 807 events. 135/807 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3353 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 978. Up to 195 conditions per place. [2025-03-08 22:07:06,376 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-03-08 22:07:06,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 750 flow [2025-03-08 22:07:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:06,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:06,379 INFO L175 Difference]: Start difference. First operand has 352 places, 352 transitions, 714 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:06,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 750 flow [2025-03-08 22:07:06,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 351 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:06,387 INFO L231 Difference]: Finished difference. Result has 351 places, 351 transitions, 712 flow [2025-03-08 22:07:06,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=351, PETRI_TRANSITIONS=351} [2025-03-08 22:07:06,389 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -76 predicate places. [2025-03-08 22:07:06,389 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 351 transitions, 712 flow [2025-03-08 22:07:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:06,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:06,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:07:06,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:06,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash 369530780, now seen corresponding path program 1 times [2025-03-08 22:07:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786095367] [2025-03-08 22:07:06,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:07:06,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:07:06,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:06,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786095367] [2025-03-08 22:07:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786095367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252168079] [2025-03-08 22:07:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:06,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:06,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 351 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:06,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:06,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:06,579 INFO L124 PetriNetUnfolderBase]: 135/806 cut-off events. [2025-03-08 22:07:06,579 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:06,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 806 events. 135/806 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3342 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 969. Up to 195 conditions per place. [2025-03-08 22:07:06,583 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2025-03-08 22:07:06,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 350 transitions, 748 flow [2025-03-08 22:07:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:06,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:06,586 INFO L175 Difference]: Start difference. First operand has 351 places, 351 transitions, 712 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:06,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 350 transitions, 748 flow [2025-03-08 22:07:06,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 350 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:06,590 INFO L231 Difference]: Finished difference. Result has 350 places, 350 transitions, 710 flow [2025-03-08 22:07:06,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=350, PETRI_TRANSITIONS=350} [2025-03-08 22:07:06,591 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -77 predicate places. [2025-03-08 22:07:06,591 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 350 transitions, 710 flow [2025-03-08 22:07:06,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:06,592 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] [2025-03-08 22:07:06,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:07:06,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:06,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -30998519, now seen corresponding path program 1 times [2025-03-08 22:07:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074432811] [2025-03-08 22:07:06,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:07:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:07:06,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:06,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074432811] [2025-03-08 22:07:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074432811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111263051] [2025-03-08 22:07:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:06,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:06,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:06,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:06,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 350 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:06,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:06,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:06,776 INFO L124 PetriNetUnfolderBase]: 135/805 cut-off events. [2025-03-08 22:07:06,776 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:06,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 805 events. 135/805 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3350 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 957. Up to 192 conditions per place. [2025-03-08 22:07:06,779 INFO L140 encePairwiseOnDemand]: 457/459 looper letters, 15 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2025-03-08 22:07:06,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 349 transitions, 740 flow [2025-03-08 22:07:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-03-08 22:07:06,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010167029774873 [2025-03-08 22:07:06,782 INFO L175 Difference]: Start difference. First operand has 350 places, 350 transitions, 710 flow. Second operand 3 states and 1103 transitions. [2025-03-08 22:07:06,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 349 transitions, 740 flow [2025-03-08 22:07:06,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 349 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:06,787 INFO L231 Difference]: Finished difference. Result has 349 places, 349 transitions, 706 flow [2025-03-08 22:07:06,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=349, PETRI_TRANSITIONS=349} [2025-03-08 22:07:06,788 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -78 predicate places. [2025-03-08 22:07:06,788 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 349 transitions, 706 flow [2025-03-08 22:07:06,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:06,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:06,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:06,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:07:06,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:06,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 312681583, now seen corresponding path program 1 times [2025-03-08 22:07:06,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:06,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677861868] [2025-03-08 22:07:06,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 22:07:06,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 22:07:06,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677861868] [2025-03-08 22:07:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677861868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:07,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448255985] [2025-03-08 22:07:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:07,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 459 [2025-03-08 22:07:07,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 349 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 325.5) internal successors, (1953), 6 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:07,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 459 [2025-03-08 22:07:07,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:07,640 INFO L124 PetriNetUnfolderBase]: 135/802 cut-off events. [2025-03-08 22:07:07,641 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:07,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 802 events. 135/802 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3337 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 990. Up to 215 conditions per place. [2025-03-08 22:07:07,645 INFO L140 encePairwiseOnDemand]: 441/459 looper letters, 37 selfloop transitions, 15 changer transitions 0/346 dead transitions. [2025-03-08 22:07:07,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 346 transitions, 804 flow [2025-03-08 22:07:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1999 transitions. [2025-03-08 22:07:07,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7258533042846769 [2025-03-08 22:07:07,649 INFO L175 Difference]: Start difference. First operand has 349 places, 349 transitions, 706 flow. Second operand 6 states and 1999 transitions. [2025-03-08 22:07:07,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 346 transitions, 804 flow [2025-03-08 22:07:07,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 346 transitions, 803 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:07,654 INFO L231 Difference]: Finished difference. Result has 350 places, 346 transitions, 729 flow [2025-03-08 22:07:07,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=350, PETRI_TRANSITIONS=346} [2025-03-08 22:07:07,656 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -77 predicate places. [2025-03-08 22:07:07,656 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 346 transitions, 729 flow [2025-03-08 22:07:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.5) internal successors, (1953), 6 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:07,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:07:07,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -569130759, now seen corresponding path program 1 times [2025-03-08 22:07:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139733790] [2025-03-08 22:07:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:07,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 22:07:07,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 22:07:07,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:07,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:07,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:07,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139733790] [2025-03-08 22:07:07,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139733790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:07,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:07,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:07,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784047721] [2025-03-08 22:07:07,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:07,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:07,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:07,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:07,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:07,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 346 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:07,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:07,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:07,848 INFO L124 PetriNetUnfolderBase]: 135/801 cut-off events. [2025-03-08 22:07:07,848 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 801 events. 135/801 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3319 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 984. Up to 194 conditions per place. [2025-03-08 22:07:07,852 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 16 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-03-08 22:07:07,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 345 transitions, 763 flow [2025-03-08 22:07:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:07,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:07,854 INFO L175 Difference]: Start difference. First operand has 350 places, 346 transitions, 729 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:07,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 345 transitions, 763 flow [2025-03-08 22:07:07,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 733 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:07,859 INFO L231 Difference]: Finished difference. Result has 346 places, 345 transitions, 701 flow [2025-03-08 22:07:07,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=346, PETRI_TRANSITIONS=345} [2025-03-08 22:07:07,862 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -81 predicate places. [2025-03-08 22:07:07,862 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 345 transitions, 701 flow [2025-03-08 22:07:07,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:07,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:07,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:07:07,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:07,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1045965997, now seen corresponding path program 1 times [2025-03-08 22:07:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137263517] [2025-03-08 22:07:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:07,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 22:07:07,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 22:07:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:07,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137263517] [2025-03-08 22:07:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137263517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:07,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571745746] [2025-03-08 22:07:07,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:07,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:07,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:07,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:07,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 345 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:07,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:07,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,008 INFO L124 PetriNetUnfolderBase]: 135/800 cut-off events. [2025-03-08 22:07:08,008 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 800 events. 135/800 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3319 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 953. Up to 192 conditions per place. [2025-03-08 22:07:08,012 INFO L140 encePairwiseOnDemand]: 457/459 looper letters, 15 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-03-08 22:07:08,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 731 flow [2025-03-08 22:07:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-03-08 22:07:08,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010167029774873 [2025-03-08 22:07:08,014 INFO L175 Difference]: Start difference. First operand has 346 places, 345 transitions, 701 flow. Second operand 3 states and 1103 transitions. [2025-03-08 22:07:08,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 731 flow [2025-03-08 22:07:08,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 344 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,018 INFO L231 Difference]: Finished difference. Result has 345 places, 344 transitions, 697 flow [2025-03-08 22:07:08,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=345, PETRI_TRANSITIONS=344} [2025-03-08 22:07:08,019 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -82 predicate places. [2025-03-08 22:07:08,019 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 344 transitions, 697 flow [2025-03-08 22:07:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:08,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:07:08,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -141375091, now seen corresponding path program 1 times [2025-03-08 22:07:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694254708] [2025-03-08 22:07:08,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:07:08,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:07:08,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694254708] [2025-03-08 22:07:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694254708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606998209] [2025-03-08 22:07:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:08,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 344 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:08,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,170 INFO L124 PetriNetUnfolderBase]: 135/799 cut-off events. [2025-03-08 22:07:08,170 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 799 events. 135/799 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3311 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 953. Up to 194 conditions per place. [2025-03-08 22:07:08,174 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 16 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-03-08 22:07:08,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 343 transitions, 731 flow [2025-03-08 22:07:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:08,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:08,176 INFO L175 Difference]: Start difference. First operand has 345 places, 344 transitions, 697 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:08,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 343 transitions, 731 flow [2025-03-08 22:07:08,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 343 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:08,180 INFO L231 Difference]: Finished difference. Result has 345 places, 343 transitions, 698 flow [2025-03-08 22:07:08,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=345, PETRI_TRANSITIONS=343} [2025-03-08 22:07:08,181 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -82 predicate places. [2025-03-08 22:07:08,182 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 343 transitions, 698 flow [2025-03-08 22:07:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:08,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:07:08,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -104240965, now seen corresponding path program 1 times [2025-03-08 22:07:08,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863392905] [2025-03-08 22:07:08,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 22:07:08,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 22:07:08,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863392905] [2025-03-08 22:07:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863392905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234936932] [2025-03-08 22:07:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:08,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 343 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:08,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,319 INFO L124 PetriNetUnfolderBase]: 135/798 cut-off events. [2025-03-08 22:07:08,320 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 798 events. 135/798 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3310 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 952. Up to 192 conditions per place. [2025-03-08 22:07:08,323 INFO L140 encePairwiseOnDemand]: 457/459 looper letters, 15 selfloop transitions, 1 changer transitions 0/342 dead transitions. [2025-03-08 22:07:08,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 342 transitions, 728 flow [2025-03-08 22:07:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-03-08 22:07:08,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010167029774873 [2025-03-08 22:07:08,325 INFO L175 Difference]: Start difference. First operand has 345 places, 343 transitions, 698 flow. Second operand 3 states and 1103 transitions. [2025-03-08 22:07:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 342 transitions, 728 flow [2025-03-08 22:07:08,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,329 INFO L231 Difference]: Finished difference. Result has 344 places, 342 transitions, 694 flow [2025-03-08 22:07:08,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=344, PETRI_TRANSITIONS=342} [2025-03-08 22:07:08,330 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -83 predicate places. [2025-03-08 22:07:08,330 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 342 transitions, 694 flow [2025-03-08 22:07:08,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:08,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:07:08,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1238559221, now seen corresponding path program 1 times [2025-03-08 22:07:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777248640] [2025-03-08 22:07:08,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 22:07:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 22:07:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777248640] [2025-03-08 22:07:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777248640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076154544] [2025-03-08 22:07:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:08,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 342 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:08,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,475 INFO L124 PetriNetUnfolderBase]: 135/797 cut-off events. [2025-03-08 22:07:08,475 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 797 events. 135/797 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3306 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 952. Up to 194 conditions per place. [2025-03-08 22:07:08,478 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 16 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-03-08 22:07:08,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 341 transitions, 728 flow [2025-03-08 22:07:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:08,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:08,481 INFO L175 Difference]: Start difference. First operand has 344 places, 342 transitions, 694 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:08,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 341 transitions, 728 flow [2025-03-08 22:07:08,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:08,484 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 695 flow [2025-03-08 22:07:08,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2025-03-08 22:07:08,485 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -83 predicate places. [2025-03-08 22:07:08,485 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 695 flow [2025-03-08 22:07:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,486 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] [2025-03-08 22:07:08,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:07:08,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1107952995, now seen corresponding path program 1 times [2025-03-08 22:07:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687804899] [2025-03-08 22:07:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 22:07:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 22:07:08,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687804899] [2025-03-08 22:07:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687804899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937480111] [2025-03-08 22:07:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:08,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:08,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,636 INFO L124 PetriNetUnfolderBase]: 135/796 cut-off events. [2025-03-08 22:07:08,636 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 796 events. 135/796 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3304 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 954. Up to 195 conditions per place. [2025-03-08 22:07:08,640 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-08 22:07:08,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 731 flow [2025-03-08 22:07:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:08,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:08,643 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 695 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 731 flow [2025-03-08 22:07:08,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,646 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 693 flow [2025-03-08 22:07:08,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2025-03-08 22:07:08,647 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -84 predicate places. [2025-03-08 22:07:08,647 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 693 flow [2025-03-08 22:07:08,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,648 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] [2025-03-08 22:07:08,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:07:08,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash 763848976, now seen corresponding path program 1 times [2025-03-08 22:07:08,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959980063] [2025-03-08 22:07:08,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:07:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:07:08,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959980063] [2025-03-08 22:07:08,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959980063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511331919] [2025-03-08 22:07:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:08,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:08,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,816 INFO L124 PetriNetUnfolderBase]: 135/795 cut-off events. [2025-03-08 22:07:08,817 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 795 events. 135/795 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3302 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 953. Up to 195 conditions per place. [2025-03-08 22:07:08,821 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-08 22:07:08,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 729 flow [2025-03-08 22:07:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:08,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:08,823 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 693 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:08,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 729 flow [2025-03-08 22:07:08,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 339 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,826 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 691 flow [2025-03-08 22:07:08,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2025-03-08 22:07:08,827 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -85 predicate places. [2025-03-08 22:07:08,827 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 691 flow [2025-03-08 22:07:08,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,828 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] [2025-03-08 22:07:08,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:07:08,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 217843986, now seen corresponding path program 1 times [2025-03-08 22:07:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047132376] [2025-03-08 22:07:08,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:07:08,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:07:08,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:08,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047132376] [2025-03-08 22:07:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047132376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402591665] [2025-03-08 22:07:08,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:08,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:08,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,974 INFO L124 PetriNetUnfolderBase]: 135/794 cut-off events. [2025-03-08 22:07:08,974 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:07:08,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 794 events. 135/794 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3300 event pairs, 74 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 952. Up to 195 conditions per place. [2025-03-08 22:07:08,977 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2025-03-08 22:07:08,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 338 transitions, 727 flow [2025-03-08 22:07:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-03-08 22:07:08,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.794480755265069 [2025-03-08 22:07:08,979 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 691 flow. Second operand 3 states and 1094 transitions. [2025-03-08 22:07:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 338 transitions, 727 flow [2025-03-08 22:07:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 338 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,983 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 689 flow [2025-03-08 22:07:08,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2025-03-08 22:07:08,984 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:08,984 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 689 flow [2025-03-08 22:07:08,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:08,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,984 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] [2025-03-08 22:07:08,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:07:08,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:08,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1322140367, now seen corresponding path program 1 times [2025-03-08 22:07:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314629358] [2025-03-08 22:07:08,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 22:07:09,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 22:07:09,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314629358] [2025-03-08 22:07:09,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314629358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397747228] [2025-03-08 22:07:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:09,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:09,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:09,186 INFO L124 PetriNetUnfolderBase]: 131/813 cut-off events. [2025-03-08 22:07:09,187 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:07:09,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 813 events. 131/813 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3395 event pairs, 56 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 963. Up to 140 conditions per place. [2025-03-08 22:07:09,191 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 22 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-03-08 22:07:09,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 345 transitions, 753 flow [2025-03-08 22:07:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2025-03-08 22:07:09,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8068264342774146 [2025-03-08 22:07:09,194 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 689 flow. Second operand 3 states and 1111 transitions. [2025-03-08 22:07:09,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 345 transitions, 753 flow [2025-03-08 22:07:09,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 345 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:09,202 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 693 flow [2025-03-08 22:07:09,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2025-03-08 22:07:09,204 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:09,204 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 693 flow [2025-03-08 22:07:09,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:09,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:07:09,206 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 497232960, now seen corresponding path program 1 times [2025-03-08 22:07:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787141990] [2025-03-08 22:07:09,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:09,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 22:07:09,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 22:07:09,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787141990] [2025-03-08 22:07:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787141990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714360007] [2025-03-08 22:07:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:09,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:09,358 INFO L124 PetriNetUnfolderBase]: 136/796 cut-off events. [2025-03-08 22:07:09,358 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-08 22:07:09,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 796 events. 136/796 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3318 event pairs, 74 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1013. Up to 198 conditions per place. [2025-03-08 22:07:09,362 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 17 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2025-03-08 22:07:09,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 729 flow [2025-03-08 22:07:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:09,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:09,365 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 693 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:09,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 729 flow [2025-03-08 22:07:09,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 337 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:09,368 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 693 flow [2025-03-08 22:07:09,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2025-03-08 22:07:09,369 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:09,369 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 693 flow [2025-03-08 22:07:09,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:09,370 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] [2025-03-08 22:07:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:07:09,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -273569923, now seen corresponding path program 1 times [2025-03-08 22:07:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122114370] [2025-03-08 22:07:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:07:09,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:07:09,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122114370] [2025-03-08 22:07:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122114370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025054261] [2025-03-08 22:07:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:09,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:09,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:09,523 INFO L124 PetriNetUnfolderBase]: 137/753 cut-off events. [2025-03-08 22:07:09,523 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-08 22:07:09,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 753 events. 137/753 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2901 event pairs, 28 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 956. Up to 119 conditions per place. [2025-03-08 22:07:09,526 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 24 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-03-08 22:07:09,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 345 transitions, 767 flow [2025-03-08 22:07:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2025-03-08 22:07:09,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8068264342774146 [2025-03-08 22:07:09,529 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 693 flow. Second operand 3 states and 1111 transitions. [2025-03-08 22:07:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 345 transitions, 767 flow [2025-03-08 22:07:09,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 345 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:09,532 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 697 flow [2025-03-08 22:07:09,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2025-03-08 22:07:09,533 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:09,533 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 697 flow [2025-03-08 22:07:09,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:09,534 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] [2025-03-08 22:07:09,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:07:09,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -373335485, now seen corresponding path program 1 times [2025-03-08 22:07:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568860221] [2025-03-08 22:07:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 22:07:09,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 22:07:09,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568860221] [2025-03-08 22:07:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568860221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423571634] [2025-03-08 22:07:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:09,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:09,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:09,686 INFO L124 PetriNetUnfolderBase]: 137/798 cut-off events. [2025-03-08 22:07:09,686 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-08 22:07:09,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 798 events. 137/798 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3347 event pairs, 74 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 1049. Up to 202 conditions per place. [2025-03-08 22:07:09,689 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 18 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-03-08 22:07:09,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 336 transitions, 735 flow [2025-03-08 22:07:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:09,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:09,692 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 697 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:09,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 336 transitions, 735 flow [2025-03-08 22:07:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 336 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:09,696 INFO L231 Difference]: Finished difference. Result has 341 places, 336 transitions, 697 flow [2025-03-08 22:07:09,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=341, PETRI_TRANSITIONS=336} [2025-03-08 22:07:09,697 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:09,697 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 336 transitions, 697 flow [2025-03-08 22:07:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:09,698 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] [2025-03-08 22:07:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:07:09,698 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1929174294, now seen corresponding path program 1 times [2025-03-08 22:07:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343801986] [2025-03-08 22:07:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 22:07:09,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 22:07:09,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343801986] [2025-03-08 22:07:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343801986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167516587] [2025-03-08 22:07:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 459 [2025-03-08 22:07:09,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 336 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 459 [2025-03-08 22:07:09,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:09,900 INFO L124 PetriNetUnfolderBase]: 196/965 cut-off events. [2025-03-08 22:07:09,900 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-08 22:07:09,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 965 events. 196/965 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4477 event pairs, 56 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1350. Up to 163 conditions per place. [2025-03-08 22:07:09,905 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 30 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-03-08 22:07:09,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 349 transitions, 800 flow [2025-03-08 22:07:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2025-03-08 22:07:09,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097312999273784 [2025-03-08 22:07:09,907 INFO L175 Difference]: Start difference. First operand has 341 places, 336 transitions, 697 flow. Second operand 3 states and 1115 transitions. [2025-03-08 22:07:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 349 transitions, 800 flow [2025-03-08 22:07:09,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 349 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:09,911 INFO L231 Difference]: Finished difference. Result has 341 places, 336 transitions, 701 flow [2025-03-08 22:07:09,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=341, PETRI_TRANSITIONS=336} [2025-03-08 22:07:09,912 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:09,912 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 336 transitions, 701 flow [2025-03-08 22:07:09,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:09,913 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] [2025-03-08 22:07:09,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:07:09,913 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:09,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1027322335, now seen corresponding path program 1 times [2025-03-08 22:07:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:09,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950520598] [2025-03-08 22:07:09,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:09,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 22:07:09,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 22:07:09,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:09,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:09,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950520598] [2025-03-08 22:07:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950520598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:09,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505804213] [2025-03-08 22:07:09,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:09,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:09,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:09,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 336 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:09,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:09,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,086 INFO L124 PetriNetUnfolderBase]: 196/967 cut-off events. [2025-03-08 22:07:10,087 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-08 22:07:10,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 967 events. 196/967 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4445 event pairs, 124 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1391. Up to 301 conditions per place. [2025-03-08 22:07:10,092 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 19 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2025-03-08 22:07:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 335 transitions, 741 flow [2025-03-08 22:07:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:10,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:10,094 INFO L175 Difference]: Start difference. First operand has 341 places, 336 transitions, 701 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 335 transitions, 741 flow [2025-03-08 22:07:10,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:10,099 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 701 flow [2025-03-08 22:07:10,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2025-03-08 22:07:10,100 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-08 22:07:10,100 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 701 flow [2025-03-08 22:07:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,100 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] [2025-03-08 22:07:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:07:10,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 978726887, now seen corresponding path program 1 times [2025-03-08 22:07:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364763363] [2025-03-08 22:07:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 22:07:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 22:07:10,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364763363] [2025-03-08 22:07:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364763363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184552295] [2025-03-08 22:07:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 459 [2025-03-08 22:07:10,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 459 [2025-03-08 22:07:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,302 INFO L124 PetriNetUnfolderBase]: 296/1203 cut-off events. [2025-03-08 22:07:10,303 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-08 22:07:10,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 1203 events. 296/1203 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6134 event pairs, 196 based on Foata normal form. 0/1082 useless extension candidates. Maximal degree in co-relation 1838. Up to 451 conditions per place. [2025-03-08 22:07:10,307 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 20 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2025-03-08 22:07:10,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 333 transitions, 739 flow [2025-03-08 22:07:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1097 transitions. [2025-03-08 22:07:10,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7966594045025418 [2025-03-08 22:07:10,310 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 701 flow. Second operand 3 states and 1097 transitions. [2025-03-08 22:07:10,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 333 transitions, 739 flow [2025-03-08 22:07:10,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 333 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:10,313 INFO L231 Difference]: Finished difference. Result has 339 places, 333 transitions, 695 flow [2025-03-08 22:07:10,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=339, PETRI_TRANSITIONS=333} [2025-03-08 22:07:10,314 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -88 predicate places. [2025-03-08 22:07:10,314 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 333 transitions, 695 flow [2025-03-08 22:07:10,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:07:10,315 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1285470197, now seen corresponding path program 1 times [2025-03-08 22:07:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878199770] [2025-03-08 22:07:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 22:07:10,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 22:07:10,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878199770] [2025-03-08 22:07:10,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878199770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833993486] [2025-03-08 22:07:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:10,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 333 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:10,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,599 INFO L124 PetriNetUnfolderBase]: 346/1271 cut-off events. [2025-03-08 22:07:10,600 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-03-08 22:07:10,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1271 events. 346/1271 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6590 event pairs, 196 based on Foata normal form. 0/1142 useless extension candidates. Maximal degree in co-relation 2017. Up to 452 conditions per place. [2025-03-08 22:07:10,608 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 29 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-08 22:07:10,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 340 transitions, 781 flow [2025-03-08 22:07:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2025-03-08 22:07:10,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7995642701525054 [2025-03-08 22:07:10,611 INFO L175 Difference]: Start difference. First operand has 339 places, 333 transitions, 695 flow. Second operand 3 states and 1101 transitions. [2025-03-08 22:07:10,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 340 transitions, 781 flow [2025-03-08 22:07:10,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:10,616 INFO L231 Difference]: Finished difference. Result has 339 places, 332 transitions, 696 flow [2025-03-08 22:07:10,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=339, PETRI_TRANSITIONS=332} [2025-03-08 22:07:10,616 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -88 predicate places. [2025-03-08 22:07:10,616 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 332 transitions, 696 flow [2025-03-08 22:07:10,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:10,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:07:10,617 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:10,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1893641686, now seen corresponding path program 1 times [2025-03-08 22:07:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518749342] [2025-03-08 22:07:10,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 22:07:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 22:07:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518749342] [2025-03-08 22:07:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518749342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508508633] [2025-03-08 22:07:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:10,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 332 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:10,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,881 INFO L124 PetriNetUnfolderBase]: 296/1127 cut-off events. [2025-03-08 22:07:10,882 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2025-03-08 22:07:10,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 1127 events. 296/1127 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5362 event pairs, 160 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 1775. Up to 374 conditions per place. [2025-03-08 22:07:10,886 INFO L140 encePairwiseOnDemand]: 454/459 looper letters, 22 selfloop transitions, 2 changer transitions 7/338 dead transitions. [2025-03-08 22:07:10,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 338 transitions, 776 flow [2025-03-08 22:07:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-03-08 22:07:10,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7988380537400145 [2025-03-08 22:07:10,889 INFO L175 Difference]: Start difference. First operand has 339 places, 332 transitions, 696 flow. Second operand 3 states and 1100 transitions. [2025-03-08 22:07:10,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 338 transitions, 776 flow [2025-03-08 22:07:10,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 338 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:10,892 INFO L231 Difference]: Finished difference. Result has 337 places, 323 transitions, 675 flow [2025-03-08 22:07:10,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=337, PETRI_TRANSITIONS=323} [2025-03-08 22:07:10,893 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -90 predicate places. [2025-03-08 22:07:10,894 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 323 transitions, 675 flow [2025-03-08 22:07:10,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:10,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:07:10,894 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-03-08 22:07:10,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1617450324, now seen corresponding path program 1 times [2025-03-08 22:07:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008944685] [2025-03-08 22:07:10,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 22:07:10,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 22:07:10,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:10,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008944685] [2025-03-08 22:07:10,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008944685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650148313] [2025-03-08 22:07:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 459 [2025-03-08 22:07:10,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 323 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:10,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 459 [2025-03-08 22:07:10,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:11,081 INFO L124 PetriNetUnfolderBase]: 254/942 cut-off events. [2025-03-08 22:07:11,082 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-08 22:07:11,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 942 events. 254/942 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3952 event pairs, 132 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1504. Up to 306 conditions per place. [2025-03-08 22:07:11,084 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 0 selfloop transitions, 0 changer transitions 330/330 dead transitions. [2025-03-08 22:07:11,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 330 transitions, 751 flow [2025-03-08 22:07:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-03-08 22:07:11,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959331880900509 [2025-03-08 22:07:11,087 INFO L175 Difference]: Start difference. First operand has 337 places, 323 transitions, 675 flow. Second operand 3 states and 1096 transitions. [2025-03-08 22:07:11,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 330 transitions, 751 flow [2025-03-08 22:07:11,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 330 transitions, 747 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:11,091 INFO L231 Difference]: Finished difference. Result has 329 places, 0 transitions, 0 flow [2025-03-08 22:07:11,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=329, PETRI_TRANSITIONS=0} [2025-03-08 22:07:11,092 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, -98 predicate places. [2025-03-08 22:07:11,092 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 0 transitions, 0 flow [2025-03-08 22:07:11,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2025-03-08 22:07:11,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2025-03-08 22:07:11,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2025-03-08 22:07:11,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2025-03-08 22:07:11,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2025-03-08 22:07:11,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2025-03-08 22:07:11,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2025-03-08 22:07:11,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2025-03-08 22:07:11,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2025-03-08 22:07:11,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:07:11,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:11,109 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:07:11,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:07:11,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:07:11 BasicIcfg [2025-03-08 22:07:11,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:07:11,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:07:11,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:07:11,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:07:11,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:04" (3/4) ... [2025-03-08 22:07:11,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:07:11,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:07:11,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:07:11,117 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:07:11,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-08 22:07:11,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:07:11,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:07:11,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:07:11,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:07:11,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:07:11,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:07:11,194 INFO L158 Benchmark]: Toolchain (without parser) took 7599.58ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 112.2MB in the beginning and 316.3MB in the end (delta: -204.1MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2025-03-08 22:07:11,194 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:11,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.77ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:07:11,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.45ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:11,194 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:07:11,194 INFO L158 Benchmark]: IcfgBuilder took 1072.87ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 90.9MB in the end (delta: 317.3kB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-03-08 22:07:11,195 INFO L158 Benchmark]: TraceAbstraction took 6125.74ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 90.1MB in the beginning and 320.6MB in the end (delta: -230.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. [2025-03-08 22:07:11,195 INFO L158 Benchmark]: Witness Printer took 79.66ms. Allocated memory is still 469.8MB. Free memory was 320.6MB in the beginning and 316.3MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:07:11,196 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.77ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.45ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 94.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1072.87ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 90.9MB in the end (delta: 317.3kB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6125.74ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 90.1MB in the beginning and 320.6MB in the end (delta: -230.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. * Witness Printer took 79.66ms. Allocated memory is still 469.8MB. Free memory was 320.6MB in the beginning and 316.3MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: 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: 161]: 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: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 553 locations, 587 edges, 159 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.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 98 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:07:11,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE