./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.i -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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:15:39,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:15:39,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:15:39,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:15:39,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:15:39,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:15:39,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:15:39,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:15:39,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:15:39,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:15:39,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:15:39,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:15:39,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:15:39,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:15:39,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:15:39,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:15:39,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:15:39,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:15:39,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:15:39,809 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-03-14 01:15:40,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:15:40,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:15:40,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:15:40,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:15:40,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:15:40,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-03-14 01:15:41,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a7b3a12/b8e61dbb655a4b8cac96b9d6e96fc405/FLAG51d61c23a [2025-03-14 01:15:41,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:15:41,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-03-14 01:15:41,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a7b3a12/b8e61dbb655a4b8cac96b9d6e96fc405/FLAG51d61c23a [2025-03-14 01:15:41,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2a7b3a12/b8e61dbb655a4b8cac96b9d6e96fc405 [2025-03-14 01:15:41,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:15:41,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:15:41,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:15:41,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:15:41,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:15:41,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:15:41" (1/1) ... [2025-03-14 01:15:41,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7658554a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:41, skipping insertion in model container [2025-03-14 01:15:41,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:15:41" (1/1) ... [2025-03-14 01:15:41,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:15:41,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:15:41,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:15:41,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:15:42,026 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:15:42,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42 WrapperNode [2025-03-14 01:15:42,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:15:42,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:15:42,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:15:42,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:15:42,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,083 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 409 [2025-03-14 01:15:42,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:15:42,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:15:42,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:15:42,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:15:42,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:15:42,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:15:42,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:15:42,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:15:42,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (1/1) ... [2025-03-14 01:15:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:15:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:15:42,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:15:42,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:15:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 01:15:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 01:15:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 01:15:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 01:15:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:15:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:15:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:15:42,197 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:15:42,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:15:42,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:15:42,971 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:15:42,972 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:15:42,972 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:15:42,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:15:42,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:15:42 BoogieIcfgContainer [2025-03-14 01:15:42,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:15:43,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:15:43,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:15:43,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:15:43,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:15:41" (1/3) ... [2025-03-14 01:15:43,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411acf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:15:43, skipping insertion in model container [2025-03-14 01:15:43,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:15:42" (2/3) ... [2025-03-14 01:15:43,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411acf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:15:43, skipping insertion in model container [2025-03-14 01:15:43,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:15:42" (3/3) ... [2025-03-14 01:15:43,008 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-14 01:15:43,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:15:43,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 460 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-14 01:15:43,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:15:43,157 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:15:43,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 472 transitions, 958 flow [2025-03-14 01:15:43,363 INFO L124 PetriNetUnfolderBase]: 13/470 cut-off events. [2025-03-14 01:15:43,364 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:15:43,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 470 events. 13/470 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 740 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 309. Up to 3 conditions per place. [2025-03-14 01:15:43,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 472 transitions, 958 flow [2025-03-14 01:15:43,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 465 transitions, 939 flow [2025-03-14 01:15:43,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:15:43,402 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;@79f4c235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:15:43,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-14 01:15:43,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:15:43,417 INFO L124 PetriNetUnfolderBase]: 0/70 cut-off events. [2025-03-14 01:15:43,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:15:43,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:43,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:43,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1038377964, now seen corresponding path program 1 times [2025-03-14 01:15:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255144880] [2025-03-14 01:15:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:43,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:15:43,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:15:43,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255144880] [2025-03-14 01:15:43,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255144880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:43,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142381158] [2025-03-14 01:15:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:43,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:43,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:43,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-14 01:15:43,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 465 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:43,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:43,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-14 01:15:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:43,923 INFO L124 PetriNetUnfolderBase]: 40/986 cut-off events. [2025-03-14 01:15:43,923 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-14 01:15:43,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 986 events. 40/986 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4394 event pairs, 19 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 881. Up to 52 conditions per place. [2025-03-14 01:15:43,932 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-03-14 01:15:43,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 452 transitions, 943 flow [2025-03-14 01:15:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-14 01:15:43,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2025-03-14 01:15:43,946 INFO L175 Difference]: Start difference. First operand has 459 places, 465 transitions, 939 flow. Second operand 3 states and 1360 transitions. [2025-03-14 01:15:43,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 452 transitions, 943 flow [2025-03-14 01:15:43,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 938 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:15:43,957 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 912 flow [2025-03-14 01:15:43,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-03-14 01:15:43,962 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-14 01:15:43,962 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 912 flow [2025-03-14 01:15:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:43,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:43,963 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] [2025-03-14 01:15:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:15:43,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1995106460, now seen corresponding path program 1 times [2025-03-14 01:15:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828951389] [2025-03-14 01:15:43,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:43,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:15:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:15:43,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828951389] [2025-03-14 01:15:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828951389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810776384] [2025-03-14 01:15:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:44,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:44,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-14 01:15:44,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 912 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:44,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:44,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-14 01:15:44,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:44,231 INFO L124 PetriNetUnfolderBase]: 43/1114 cut-off events. [2025-03-14 01:15:44,231 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:15:44,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1114 events. 43/1114 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5448 event pairs, 19 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-03-14 01:15:44,238 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-14 01:15:44,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 940 flow [2025-03-14 01:15:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-14 01:15:44,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-03-14 01:15:44,248 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 912 flow. Second operand 3 states and 1357 transitions. [2025-03-14 01:15:44,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 940 flow [2025-03-14 01:15:44,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:44,257 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-03-14 01:15:44,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-03-14 01:15:44,259 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-14 01:15:44,259 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-03-14 01:15:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:44,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:44,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:15:44,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:44,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 651287665, now seen corresponding path program 1 times [2025-03-14 01:15:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762617374] [2025-03-14 01:15:44,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:44,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:15:44,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:15:44,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:44,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:44,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762617374] [2025-03-14 01:15:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762617374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:44,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616212641] [2025-03-14 01:15:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:44,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:44,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:44,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:44,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:45,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-14 01:15:45,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:45,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:45,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-14 01:15:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:46,493 INFO L124 PetriNetUnfolderBase]: 2177/9184 cut-off events. [2025-03-14 01:15:46,493 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-14 01:15:46,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13285 conditions, 9184 events. 2177/9184 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80052 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13204. Up to 4013 conditions per place. [2025-03-14 01:15:46,538 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-14 01:15:46,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 1118 flow [2025-03-14 01:15:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-14 01:15:46,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-14 01:15:46,547 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2254 transitions. [2025-03-14 01:15:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 1118 flow [2025-03-14 01:15:46,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:46,554 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 914 flow [2025-03-14 01:15:46,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-03-14 01:15:46,556 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-14 01:15:46,556 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 914 flow [2025-03-14 01:15:46,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:46,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:46,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:46,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:15:46,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:46,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1989225366, now seen corresponding path program 1 times [2025-03-14 01:15:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474936827] [2025-03-14 01:15:46,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:46,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:15:46,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:15:46,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:46,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474936827] [2025-03-14 01:15:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474936827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585282161] [2025-03-14 01:15:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:46,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:46,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:46,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:47,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-14 01:15:47,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 914 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:47,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:47,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-14 01:15:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:48,640 INFO L124 PetriNetUnfolderBase]: 2177/9183 cut-off events. [2025-03-14 01:15:48,640 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-14 01:15:48,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13287 conditions, 9183 events. 2177/9183 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80103 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13190. Up to 4013 conditions per place. [2025-03-14 01:15:48,793 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-14 01:15:48,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 449 transitions, 1122 flow [2025-03-14 01:15:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-14 01:15:48,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-14 01:15:48,797 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 914 flow. Second operand 6 states and 2254 transitions. [2025-03-14 01:15:48,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 449 transitions, 1122 flow [2025-03-14 01:15:48,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 449 transitions, 1112 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:48,802 INFO L231 Difference]: Finished difference. Result has 449 places, 449 transitions, 912 flow [2025-03-14 01:15:48,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=449} [2025-03-14 01:15:48,803 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-14 01:15:48,803 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 449 transitions, 912 flow [2025-03-14 01:15:48,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:48,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:48,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:48,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:15:48,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:48,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -674521394, now seen corresponding path program 1 times [2025-03-14 01:15:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020798904] [2025-03-14 01:15:48,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:15:48,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:15:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020798904] [2025-03-14 01:15:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020798904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:49,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:49,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151131469] [2025-03-14 01:15:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:49,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:49,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-14 01:15:49,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 449 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:49,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:49,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-14 01:15:49,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:50,509 INFO L124 PetriNetUnfolderBase]: 2177/9182 cut-off events. [2025-03-14 01:15:50,509 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-14 01:15:50,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 9182 events. 2177/9182 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 79914 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13181. Up to 4013 conditions per place. [2025-03-14 01:15:50,547 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-14 01:15:50,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 448 transitions, 1120 flow [2025-03-14 01:15:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-14 01:15:50,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-14 01:15:50,552 INFO L175 Difference]: Start difference. First operand has 449 places, 449 transitions, 912 flow. Second operand 6 states and 2254 transitions. [2025-03-14 01:15:50,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 448 transitions, 1120 flow [2025-03-14 01:15:50,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 1110 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:50,560 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 910 flow [2025-03-14 01:15:50,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-03-14 01:15:50,563 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-14 01:15:50,564 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 910 flow [2025-03-14 01:15:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:50,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:50,567 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] [2025-03-14 01:15:50,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:15:50,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 84007781, now seen corresponding path program 1 times [2025-03-14 01:15:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313212285] [2025-03-14 01:15:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:50,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-14 01:15:50,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:15:50,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:51,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-14 01:15:51,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:51,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313212285] [2025-03-14 01:15:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313212285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:51,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655213007] [2025-03-14 01:15:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:51,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:51,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:51,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-14 01:15:51,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:51,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:51,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-14 01:15:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:52,478 INFO L124 PetriNetUnfolderBase]: 502/4907 cut-off events. [2025-03-14 01:15:52,478 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:15:52,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 4907 events. 502/4907 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 39017 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5654. Up to 811 conditions per place. [2025-03-14 01:15:52,512 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-14 01:15:52,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 447 transitions, 1026 flow [2025-03-14 01:15:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-14 01:15:52,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-14 01:15:52,517 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 910 flow. Second operand 6 states and 2484 transitions. [2025-03-14 01:15:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 447 transitions, 1026 flow [2025-03-14 01:15:52,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 447 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:52,524 INFO L231 Difference]: Finished difference. Result has 447 places, 447 transitions, 908 flow [2025-03-14 01:15:52,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=447, PETRI_TRANSITIONS=447} [2025-03-14 01:15:52,526 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-14 01:15:52,526 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 447 transitions, 908 flow [2025-03-14 01:15:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:52,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:52,528 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] [2025-03-14 01:15:52,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:15:52,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1788507416, now seen corresponding path program 1 times [2025-03-14 01:15:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045366943] [2025-03-14 01:15:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:52,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-14 01:15:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-14 01:15:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:52,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:52,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045366943] [2025-03-14 01:15:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045366943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:52,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901823033] [2025-03-14 01:15:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:52,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:52,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:52,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:52,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:53,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-14 01:15:53,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:53,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:53,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-14 01:15:53,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:54,121 INFO L124 PetriNetUnfolderBase]: 502/4906 cut-off events. [2025-03-14 01:15:54,121 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:15:54,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 4906 events. 502/4906 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39174 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5615. Up to 811 conditions per place. [2025-03-14 01:15:54,141 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-14 01:15:54,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1024 flow [2025-03-14 01:15:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-14 01:15:54,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-14 01:15:54,146 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 908 flow. Second operand 6 states and 2484 transitions. [2025-03-14 01:15:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1024 flow [2025-03-14 01:15:54,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 446 transitions, 1014 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:54,152 INFO L231 Difference]: Finished difference. Result has 446 places, 446 transitions, 906 flow [2025-03-14 01:15:54,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=446} [2025-03-14 01:15:54,154 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-14 01:15:54,155 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 446 transitions, 906 flow [2025-03-14 01:15:54,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:54,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:54,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:15:54,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:54,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1108378393, now seen corresponding path program 1 times [2025-03-14 01:15:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851499979] [2025-03-14 01:15:54,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:54,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:15:54,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:15:54,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:54,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851499979] [2025-03-14 01:15:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851499979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:54,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:54,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052251500] [2025-03-14 01:15:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:54,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:54,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:54,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-14 01:15:54,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 446 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:54,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-14 01:15:54,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:54,343 INFO L124 PetriNetUnfolderBase]: 53/1041 cut-off events. [2025-03-14 01:15:54,343 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 01:15:54,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1041 events. 53/1041 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4919 event pairs, 12 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1009. Up to 56 conditions per place. [2025-03-14 01:15:54,350 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 17 selfloop transitions, 4 changer transitions 0/454 dead transitions. [2025-03-14 01:15:54,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 454 transitions, 967 flow [2025-03-14 01:15:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-14 01:15:54,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-14 01:15:54,353 INFO L175 Difference]: Start difference. First operand has 446 places, 446 transitions, 906 flow. Second operand 3 states and 1375 transitions. [2025-03-14 01:15:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 454 transitions, 967 flow [2025-03-14 01:15:54,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 454 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:15:54,361 INFO L231 Difference]: Finished difference. Result has 445 places, 449 transitions, 926 flow [2025-03-14 01:15:54,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=445, PETRI_TRANSITIONS=449} [2025-03-14 01:15:54,362 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-14 01:15:54,362 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 449 transitions, 926 flow [2025-03-14 01:15:54,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:54,363 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] [2025-03-14 01:15:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:15:54,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 874979927, now seen corresponding path program 1 times [2025-03-14 01:15:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:54,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846804093] [2025-03-14 01:15:54,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:54,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:54,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:15:54,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:15:54,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:54,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:15:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846804093] [2025-03-14 01:15:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846804093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:15:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562164892] [2025-03-14 01:15:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:54,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:54,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-14 01:15:54,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 449 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:54,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-14 01:15:54,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:54,606 INFO L124 PetriNetUnfolderBase]: 96/2101 cut-off events. [2025-03-14 01:15:54,606 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-14 01:15:54,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 2101 events. 96/2101 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13704 event pairs, 24 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-03-14 01:15:54,618 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 16 selfloop transitions, 4 changer transitions 0/456 dead transitions. [2025-03-14 01:15:54,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 456 transitions, 981 flow [2025-03-14 01:15:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-14 01:15:54,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-14 01:15:54,621 INFO L175 Difference]: Start difference. First operand has 445 places, 449 transitions, 926 flow. Second operand 3 states and 1374 transitions. [2025-03-14 01:15:54,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 456 transitions, 981 flow [2025-03-14 01:15:54,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 456 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:54,628 INFO L231 Difference]: Finished difference. Result has 447 places, 452 transitions, 948 flow [2025-03-14 01:15:54,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=447, PETRI_TRANSITIONS=452} [2025-03-14 01:15:54,629 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-14 01:15:54,629 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 452 transitions, 948 flow [2025-03-14 01:15:54,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:54,631 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] [2025-03-14 01:15:54,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:15:54,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:54,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1675236772, now seen corresponding path program 1 times [2025-03-14 01:15:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316229731] [2025-03-14 01:15:54,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:54,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:15:54,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:15:54,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:54,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:15:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316229731] [2025-03-14 01:15:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316229731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:54,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:15:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14275363] [2025-03-14 01:15:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:54,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:54,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:54,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:54,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-14 01:15:54,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 452 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:54,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-14 01:15:54,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:54,923 INFO L124 PetriNetUnfolderBase]: 82/2173 cut-off events. [2025-03-14 01:15:54,923 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-14 01:15:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2173 events. 82/2173 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12317 event pairs, 35 based on Foata normal form. 7/1964 useless extension candidates. Maximal degree in co-relation 1929. Up to 102 conditions per place. [2025-03-14 01:15:54,939 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-03-14 01:15:54,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 456 transitions, 988 flow [2025-03-14 01:15:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-14 01:15:54,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-14 01:15:54,942 INFO L175 Difference]: Start difference. First operand has 447 places, 452 transitions, 948 flow. Second operand 3 states and 1375 transitions. [2025-03-14 01:15:54,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 456 transitions, 988 flow [2025-03-14 01:15:54,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 456 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:15:54,948 INFO L231 Difference]: Finished difference. Result has 448 places, 453 transitions, 952 flow [2025-03-14 01:15:54,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=448, PETRI_TRANSITIONS=453} [2025-03-14 01:15:54,949 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-14 01:15:54,949 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 453 transitions, 952 flow [2025-03-14 01:15:54,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:54,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:54,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:15:54,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 182214944, now seen corresponding path program 1 times [2025-03-14 01:15:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112301356] [2025-03-14 01:15:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:54,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-14 01:15:54,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-14 01:15:54,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:54,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:15:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112301356] [2025-03-14 01:15:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112301356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:15:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453619412] [2025-03-14 01:15:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:55,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-14 01:15:55,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 453 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:55,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:55,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-14 01:15:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:55,420 INFO L124 PetriNetUnfolderBase]: 136/3825 cut-off events. [2025-03-14 01:15:55,420 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:15:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 3825 events. 136/3825 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26285 event pairs, 40 based on Foata normal form. 9/3434 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-03-14 01:15:55,451 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2025-03-14 01:15:55,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 991 flow [2025-03-14 01:15:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:15:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:15:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-14 01:15:55,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-14 01:15:55,453 INFO L175 Difference]: Start difference. First operand has 448 places, 453 transitions, 952 flow. Second operand 3 states and 1375 transitions. [2025-03-14 01:15:55,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 991 flow [2025-03-14 01:15:55,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 457 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:15:55,458 INFO L231 Difference]: Finished difference. Result has 450 places, 454 transitions, 962 flow [2025-03-14 01:15:55,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=450, PETRI_TRANSITIONS=454} [2025-03-14 01:15:55,459 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-14 01:15:55,459 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 454 transitions, 962 flow [2025-03-14 01:15:55,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:55,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:55,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:15:55,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2048093260, now seen corresponding path program 1 times [2025-03-14 01:15:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378433276] [2025-03-14 01:15:55,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:55,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-14 01:15:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-14 01:15:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:15:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378433276] [2025-03-14 01:15:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378433276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:15:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785700237] [2025-03-14 01:15:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:55,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:15:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:55,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:15:55,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:15:56,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-14 01:15:56,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 454 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:56,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:56,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-14 01:15:56,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:15:57,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 333#L1020true, 375#L1053-1true]) [2025-03-14 01:15:57,182 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 204#L1055true]) [2025-03-14 01:15:57,182 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:15:57,182 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-14 01:15:59,656 INFO L124 PetriNetUnfolderBase]: 3991/24250 cut-off events. [2025-03-14 01:15:59,656 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-14 01:15:59,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32098 conditions, 24250 events. 3991/24250 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 282487 event pairs, 1492 based on Foata normal form. 0/21673 useless extension candidates. Maximal degree in co-relation 31316. Up to 5596 conditions per place. [2025-03-14 01:15:59,743 INFO L140 encePairwiseOnDemand]: 439/472 looper letters, 83 selfloop transitions, 66 changer transitions 0/533 dead transitions. [2025-03-14 01:15:59,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 533 transitions, 1426 flow [2025-03-14 01:15:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:15:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:15:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2516 transitions. [2025-03-14 01:15:59,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884180790960452 [2025-03-14 01:15:59,747 INFO L175 Difference]: Start difference. First operand has 450 places, 454 transitions, 962 flow. Second operand 6 states and 2516 transitions. [2025-03-14 01:15:59,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 533 transitions, 1426 flow [2025-03-14 01:15:59,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 533 transitions, 1424 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:15:59,754 INFO L231 Difference]: Finished difference. Result has 459 places, 518 transitions, 1414 flow [2025-03-14 01:15:59,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1414, PETRI_PLACES=459, PETRI_TRANSITIONS=518} [2025-03-14 01:15:59,755 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 0 predicate places. [2025-03-14 01:15:59,755 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 518 transitions, 1414 flow [2025-03-14 01:15:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:59,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:15:59,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:15:59,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:15:59,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:15:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:15:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 356132486, now seen corresponding path program 1 times [2025-03-14 01:15:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:15:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506611410] [2025-03-14 01:15:59,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:15:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:15:59,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-14 01:15:59,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-14 01:15:59,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:15:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:15:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:15:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:15:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506611410] [2025-03-14 01:15:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506611410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:15:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:15:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:15:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152070453] [2025-03-14 01:15:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:15:59,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:15:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:15:59,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:15:59,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:15:59,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 472 [2025-03-14 01:15:59,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 518 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:15:59,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:15:59,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 472 [2025-03-14 01:15:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:00,137 INFO L124 PetriNetUnfolderBase]: 86/2843 cut-off events. [2025-03-14 01:16:00,138 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-14 01:16:00,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 2843 events. 86/2843 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17270 event pairs, 17 based on Foata normal form. 4/2583 useless extension candidates. Maximal degree in co-relation 2911. Up to 169 conditions per place. [2025-03-14 01:16:00,147 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 14 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2025-03-14 01:16:00,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 452 transitions, 1067 flow [2025-03-14 01:16:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-14 01:16:00,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-14 01:16:00,149 INFO L175 Difference]: Start difference. First operand has 459 places, 518 transitions, 1414 flow. Second operand 3 states and 1374 transitions. [2025-03-14 01:16:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 452 transitions, 1067 flow [2025-03-14 01:16:00,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 452 transitions, 977 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-03-14 01:16:00,157 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 941 flow [2025-03-14 01:16:00,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-03-14 01:16:00,158 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-14 01:16:00,158 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 941 flow [2025-03-14 01:16:00,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:00,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:00,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:00,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:16:00,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:00,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1178204073, now seen corresponding path program 1 times [2025-03-14 01:16:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629669402] [2025-03-14 01:16:00,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:00,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:16:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:16:00,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:00,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:16:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629669402] [2025-03-14 01:16:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629669402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678816210] [2025-03-14 01:16:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:00,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:00,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:00,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-14 01:16:00,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:00,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:00,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-14 01:16:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:01,440 INFO L124 PetriNetUnfolderBase]: 693/3437 cut-off events. [2025-03-14 01:16:01,441 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-03-14 01:16:01,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 3437 events. 693/3437 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23994 event pairs, 604 based on Foata normal form. 0/3174 useless extension candidates. Maximal degree in co-relation 4400. Up to 1497 conditions per place. [2025-03-14 01:16:01,449 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/458 dead transitions. [2025-03-14 01:16:01,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 458 transitions, 1225 flow [2025-03-14 01:16:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2216 transitions. [2025-03-14 01:16:01,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824858757062146 [2025-03-14 01:16:01,452 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 941 flow. Second operand 6 states and 2216 transitions. [2025-03-14 01:16:01,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 458 transitions, 1225 flow [2025-03-14 01:16:01,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 458 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:01,457 INFO L231 Difference]: Finished difference. Result has 448 places, 446 transitions, 943 flow [2025-03-14 01:16:01,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=448, PETRI_TRANSITIONS=446} [2025-03-14 01:16:01,458 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-14 01:16:01,458 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 446 transitions, 943 flow [2025-03-14 01:16:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:01,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:01,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:16:01,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1063033939, now seen corresponding path program 1 times [2025-03-14 01:16:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949427215] [2025-03-14 01:16:01,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:01,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-14 01:16:01,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-14 01:16:01,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:16:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949427215] [2025-03-14 01:16:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949427215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898400716] [2025-03-14 01:16:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:01,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:01,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:02,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-14 01:16:02,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 446 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:02,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:02,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-14 01:16:02,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:02,679 INFO L124 PetriNetUnfolderBase]: 297/2792 cut-off events. [2025-03-14 01:16:02,679 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-14 01:16:02,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 2792 events. 297/2792 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16355 event pairs, 214 based on Foata normal form. 0/2562 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-03-14 01:16:02,690 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/457 dead transitions. [2025-03-14 01:16:02,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 457 transitions, 1101 flow [2025-03-14 01:16:02,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2531 transitions. [2025-03-14 01:16:02,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937146892655368 [2025-03-14 01:16:02,693 INFO L175 Difference]: Start difference. First operand has 448 places, 446 transitions, 943 flow. Second operand 6 states and 2531 transitions. [2025-03-14 01:16:02,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 457 transitions, 1101 flow [2025-03-14 01:16:02,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:02,699 INFO L231 Difference]: Finished difference. Result has 447 places, 445 transitions, 941 flow [2025-03-14 01:16:02,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=447, PETRI_TRANSITIONS=445} [2025-03-14 01:16:02,700 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-14 01:16:02,700 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 445 transitions, 941 flow [2025-03-14 01:16:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:02,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:02,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:16:02,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2066489295, now seen corresponding path program 1 times [2025-03-14 01:16:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271863154] [2025-03-14 01:16:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:02,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-14 01:16:02,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-14 01:16:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:02,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:16:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271863154] [2025-03-14 01:16:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271863154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:03,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:03,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729971322] [2025-03-14 01:16:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:03,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:03,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:03,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:03,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:03,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-14 01:16:03,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 445 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:03,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:03,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-14 01:16:03,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:04,005 INFO L124 PetriNetUnfolderBase]: 567/3295 cut-off events. [2025-03-14 01:16:04,005 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-14 01:16:04,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 3295 events. 567/3295 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22641 event pairs, 478 based on Foata normal form. 0/3048 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-03-14 01:16:04,018 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 101 selfloop transitions, 5 changer transitions 0/456 dead transitions. [2025-03-14 01:16:04,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 456 transitions, 1183 flow [2025-03-14 01:16:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2321 transitions. [2025-03-14 01:16:04,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8195621468926554 [2025-03-14 01:16:04,021 INFO L175 Difference]: Start difference. First operand has 447 places, 445 transitions, 941 flow. Second operand 6 states and 2321 transitions. [2025-03-14 01:16:04,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 456 transitions, 1183 flow [2025-03-14 01:16:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 456 transitions, 1173 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:04,028 INFO L231 Difference]: Finished difference. Result has 446 places, 444 transitions, 939 flow [2025-03-14 01:16:04,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=446, PETRI_TRANSITIONS=444} [2025-03-14 01:16:04,028 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-14 01:16:04,028 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 444 transitions, 939 flow [2025-03-14 01:16:04,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:04,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:04,030 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] [2025-03-14 01:16:04,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:16:04,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:04,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1821259648, now seen corresponding path program 1 times [2025-03-14 01:16:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403288147] [2025-03-14 01:16:04,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:04,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-14 01:16:04,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-14 01:16:04,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:04,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:16:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403288147] [2025-03-14 01:16:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403288147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46088647] [2025-03-14 01:16:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:04,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:04,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-14 01:16:04,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 444 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:04,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:04,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-14 01:16:04,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:05,444 INFO L124 PetriNetUnfolderBase]: 657/3377 cut-off events. [2025-03-14 01:16:05,444 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-14 01:16:05,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 3377 events. 657/3377 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23392 event pairs, 568 based on Foata normal form. 0/3146 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-03-14 01:16:05,458 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/455 dead transitions. [2025-03-14 01:16:05,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 455 transitions, 1211 flow [2025-03-14 01:16:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-14 01:16:05,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-14 01:16:05,461 INFO L175 Difference]: Start difference. First operand has 446 places, 444 transitions, 939 flow. Second operand 6 states and 2246 transitions. [2025-03-14 01:16:05,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 455 transitions, 1211 flow [2025-03-14 01:16:05,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 455 transitions, 1201 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:05,468 INFO L231 Difference]: Finished difference. Result has 445 places, 443 transitions, 937 flow [2025-03-14 01:16:05,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=445, PETRI_TRANSITIONS=443} [2025-03-14 01:16:05,469 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-14 01:16:05,469 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 443 transitions, 937 flow [2025-03-14 01:16:05,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:05,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:05,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:05,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:16:05,471 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:05,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1293842287, now seen corresponding path program 1 times [2025-03-14 01:16:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483118695] [2025-03-14 01:16:05,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:05,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-14 01:16:05,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-14 01:16:05,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:05,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-14 01:16:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483118695] [2025-03-14 01:16:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483118695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:05,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:05,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719109231] [2025-03-14 01:16:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:05,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:05,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:05,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:06,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-14 01:16:06,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 443 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:06,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:06,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-14 01:16:06,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:06,808 INFO L124 PetriNetUnfolderBase]: 651/3363 cut-off events. [2025-03-14 01:16:06,809 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-14 01:16:06,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 3363 events. 651/3363 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23230 event pairs, 562 based on Foata normal form. 0/3132 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-03-14 01:16:06,820 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/454 dead transitions. [2025-03-14 01:16:06,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 454 transitions, 1209 flow [2025-03-14 01:16:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-14 01:16:06,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-14 01:16:06,824 INFO L175 Difference]: Start difference. First operand has 445 places, 443 transitions, 937 flow. Second operand 6 states and 2246 transitions. [2025-03-14 01:16:06,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 454 transitions, 1209 flow [2025-03-14 01:16:06,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 454 transitions, 1199 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:06,830 INFO L231 Difference]: Finished difference. Result has 444 places, 442 transitions, 935 flow [2025-03-14 01:16:06,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=442} [2025-03-14 01:16:06,830 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-14 01:16:06,830 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 442 transitions, 935 flow [2025-03-14 01:16:06,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:06,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:06,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:16:06,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1910331373, now seen corresponding path program 1 times [2025-03-14 01:16:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476795701] [2025-03-14 01:16:06,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:16:06,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:16:06,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:06,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-14 01:16:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:07,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476795701] [2025-03-14 01:16:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476795701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:07,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954777454] [2025-03-14 01:16:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:07,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:07,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:07,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:07,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 472 [2025-03-14 01:16:07,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 442 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:07,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:07,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 472 [2025-03-14 01:16:07,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:07,924 INFO L124 PetriNetUnfolderBase]: 672/3379 cut-off events. [2025-03-14 01:16:07,924 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-14 01:16:07,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3379 events. 672/3379 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 23483 event pairs, 583 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 4974. Up to 1453 conditions per place. [2025-03-14 01:16:07,936 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/453 dead transitions. [2025-03-14 01:16:07,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 453 transitions, 1219 flow [2025-03-14 01:16:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2221 transitions. [2025-03-14 01:16:07,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7842514124293786 [2025-03-14 01:16:07,939 INFO L175 Difference]: Start difference. First operand has 444 places, 442 transitions, 935 flow. Second operand 6 states and 2221 transitions. [2025-03-14 01:16:07,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 453 transitions, 1219 flow [2025-03-14 01:16:07,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 453 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:07,944 INFO L231 Difference]: Finished difference. Result has 443 places, 441 transitions, 933 flow [2025-03-14 01:16:07,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=441} [2025-03-14 01:16:07,945 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -16 predicate places. [2025-03-14 01:16:07,945 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 441 transitions, 933 flow [2025-03-14 01:16:07,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:07,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:07,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:07,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:16:07,946 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1499016472, now seen corresponding path program 1 times [2025-03-14 01:16:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363151146] [2025-03-14 01:16:07,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:07,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-14 01:16:07,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-14 01:16:07,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:07,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363151146] [2025-03-14 01:16:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363151146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777298733] [2025-03-14 01:16:08,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:08,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:08,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:08,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:08,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:16:08,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-14 01:16:08,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-14 01:16:08,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:08,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:08,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:16:08,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-14 01:16:08,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:16:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777298733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:08,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:16:08,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:16:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609425303] [2025-03-14 01:16:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:08,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:08,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:08,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-14 01:16:08,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 441 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:08,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:08,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-14 01:16:08,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:08,419 INFO L124 PetriNetUnfolderBase]: 64/1688 cut-off events. [2025-03-14 01:16:08,419 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:16:08,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1688 events. 64/1688 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7490 event pairs, 29 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1461. Up to 79 conditions per place. [2025-03-14 01:16:08,424 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-14 01:16:08,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 443 transitions, 973 flow [2025-03-14 01:16:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2025-03-14 01:16:08,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639830508474576 [2025-03-14 01:16:08,426 INFO L175 Difference]: Start difference. First operand has 443 places, 441 transitions, 933 flow. Second operand 3 states and 1365 transitions. [2025-03-14 01:16:08,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 443 transitions, 973 flow [2025-03-14 01:16:08,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:08,431 INFO L231 Difference]: Finished difference. Result has 439 places, 440 transitions, 925 flow [2025-03-14 01:16:08,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=439, PETRI_TRANSITIONS=440} [2025-03-14 01:16:08,434 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -20 predicate places. [2025-03-14 01:16:08,434 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 440 transitions, 925 flow [2025-03-14 01:16:08,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:08,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:08,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:08,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:16:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:08,635 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1387476388, now seen corresponding path program 1 times [2025-03-14 01:16:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020244139] [2025-03-14 01:16:08,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:08,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-14 01:16:08,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-14 01:16:08,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:08,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020244139] [2025-03-14 01:16:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020244139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169491014] [2025-03-14 01:16:08,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:08,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:08,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:16:08,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-14 01:16:08,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-14 01:16:08,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:08,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:08,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:16:08,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-14 01:16:08,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:16:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169491014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:08,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:16:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:16:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755447772] [2025-03-14 01:16:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:08,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:08,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:08,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-14 01:16:08,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 440 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:08,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:08,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-14 01:16:08,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:09,218 INFO L124 PetriNetUnfolderBase]: 136/3370 cut-off events. [2025-03-14 01:16:09,219 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-03-14 01:16:09,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3370 events. 136/3370 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22195 event pairs, 38 based on Foata normal form. 1/3116 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-03-14 01:16:09,228 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 17 selfloop transitions, 7 changer transitions 1/448 dead transitions. [2025-03-14 01:16:09,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 448 transitions, 999 flow [2025-03-14 01:16:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2025-03-14 01:16:09,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675141242937854 [2025-03-14 01:16:09,230 INFO L175 Difference]: Start difference. First operand has 439 places, 440 transitions, 925 flow. Second operand 3 states and 1370 transitions. [2025-03-14 01:16:09,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 448 transitions, 999 flow [2025-03-14 01:16:09,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 448 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:09,234 INFO L231 Difference]: Finished difference. Result has 441 places, 445 transitions, 977 flow [2025-03-14 01:16:09,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=441, PETRI_TRANSITIONS=445} [2025-03-14 01:16:09,235 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-14 01:16:09,235 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 445 transitions, 977 flow [2025-03-14 01:16:09,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:09,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:09,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:09,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:16:09,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-14 01:16:09,436 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:09,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 834769128, now seen corresponding path program 1 times [2025-03-14 01:16:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680484671] [2025-03-14 01:16:09,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:09,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-14 01:16:09,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-14 01:16:09,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:09,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680484671] [2025-03-14 01:16:09,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680484671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631020156] [2025-03-14 01:16:09,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:09,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:09,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:09,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:16:09,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-14 01:16:09,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-14 01:16:09,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:09,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:09,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:16:09,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:09,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:16:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-14 01:16:09,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:16:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631020156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:16:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-14 01:16:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542387865] [2025-03-14 01:16:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:09,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:09,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 472 [2025-03-14 01:16:09,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 445 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:09,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:09,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 472 [2025-03-14 01:16:09,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:09,923 INFO L124 PetriNetUnfolderBase]: 33/1428 cut-off events. [2025-03-14 01:16:09,923 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:16:09,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1428 events. 33/1428 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5282 event pairs, 6 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 1141. Up to 26 conditions per place. [2025-03-14 01:16:09,927 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 7 selfloop transitions, 3 changer transitions 5/438 dead transitions. [2025-03-14 01:16:09,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 954 flow [2025-03-14 01:16:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-03-14 01:16:09,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731638418079096 [2025-03-14 01:16:09,931 INFO L175 Difference]: Start difference. First operand has 441 places, 445 transitions, 977 flow. Second operand 3 states and 1378 transitions. [2025-03-14 01:16:09,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 954 flow [2025-03-14 01:16:09,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 438 transitions, 934 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 01:16:09,936 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 899 flow [2025-03-14 01:16:09,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-14 01:16:09,937 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -22 predicate places. [2025-03-14 01:16:09,937 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 899 flow [2025-03-14 01:16:09,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:09,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:09,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:09,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:16:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:10,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -229473674, now seen corresponding path program 1 times [2025-03-14 01:16:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239550752] [2025-03-14 01:16:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:10,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-14 01:16:10,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-14 01:16:10,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:10,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239550752] [2025-03-14 01:16:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239550752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901693915] [2025-03-14 01:16:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:10,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:10,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:10,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:10,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:16:10,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-14 01:16:10,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-14 01:16:10,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:10,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:10,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:16:10,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:10,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:16:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 01:16:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901693915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:16:10,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:16:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:16:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849793379] [2025-03-14 01:16:10,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:16:10,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:16:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:16:10,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:16:10,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-14 01:16:10,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 899 flow. Second operand has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:10,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:10,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-14 01:16:10,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:10,862 INFO L124 PetriNetUnfolderBase]: 44/1399 cut-off events. [2025-03-14 01:16:10,862 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:16:10,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1399 events. 44/1399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 10 based on Foata normal form. 4/1326 useless extension candidates. Maximal degree in co-relation 986. Up to 35 conditions per place. [2025-03-14 01:16:10,866 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 20 selfloop transitions, 9 changer transitions 0/446 dead transitions. [2025-03-14 01:16:10,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 446 transitions, 1003 flow [2025-03-14 01:16:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:16:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:16:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4081 transitions. [2025-03-14 01:16:10,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606873822975518 [2025-03-14 01:16:10,868 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 899 flow. Second operand 9 states and 4081 transitions. [2025-03-14 01:16:10,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 446 transitions, 1003 flow [2025-03-14 01:16:10,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 446 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-14 01:16:10,873 INFO L231 Difference]: Finished difference. Result has 441 places, 437 transitions, 940 flow [2025-03-14 01:16:10,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=441, PETRI_TRANSITIONS=437} [2025-03-14 01:16:10,874 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-14 01:16:10,874 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 437 transitions, 940 flow [2025-03-14 01:16:10,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:10,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:10,875 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:10,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:16:11,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:11,076 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1469125228, now seen corresponding path program 2 times [2025-03-14 01:16:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108766958] [2025-03-14 01:16:11,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:16:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:11,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-14 01:16:11,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 407 statements. [2025-03-14 01:16:11,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:16:11,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-14 01:16:11,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108766958] [2025-03-14 01:16:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108766958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190270295] [2025-03-14 01:16:11,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:11,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:11,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:11,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:11,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-14 01:16:11,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 437 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:11,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:11,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-14 01:16:11,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:11,958 INFO L124 PetriNetUnfolderBase]: 130/1477 cut-off events. [2025-03-14 01:16:11,958 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-14 01:16:11,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 1477 events. 130/1477 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4521 event pairs, 95 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1266. Up to 303 conditions per place. [2025-03-14 01:16:11,962 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/440 dead transitions. [2025-03-14 01:16:11,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1074 flow [2025-03-14 01:16:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-14 01:16:11,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-14 01:16:11,964 INFO L175 Difference]: Start difference. First operand has 441 places, 437 transitions, 940 flow. Second operand 6 states and 2487 transitions. [2025-03-14 01:16:11,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1074 flow [2025-03-14 01:16:11,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1068 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:11,969 INFO L231 Difference]: Finished difference. Result has 444 places, 436 transitions, 942 flow [2025-03-14 01:16:11,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=444, PETRI_TRANSITIONS=436} [2025-03-14 01:16:11,969 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-14 01:16:11,970 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 436 transitions, 942 flow [2025-03-14 01:16:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:11,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:11,971 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:11,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:16:11,971 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1950634249, now seen corresponding path program 1 times [2025-03-14 01:16:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059720292] [2025-03-14 01:16:11,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-14 01:16:12,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-14 01:16:12,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-14 01:16:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059720292] [2025-03-14 01:16:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059720292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025990436] [2025-03-14 01:16:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:12,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:12,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:12,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:12,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:16:12,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-14 01:16:12,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-14 01:16:12,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:12,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:16:12,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-14 01:16:12,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:16:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-14 01:16:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025990436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:16:13,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:16:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:16:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280149519] [2025-03-14 01:16:13,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:16:13,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:16:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:13,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:16:13,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:16:13,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-14 01:16:13,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 436 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:13,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:13,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-14 01:16:13,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:13,461 INFO L124 PetriNetUnfolderBase]: 70/2163 cut-off events. [2025-03-14 01:16:13,461 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-14 01:16:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 2163 events. 70/2163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4837 event pairs, 10 based on Foata normal form. 8/2090 useless extension candidates. Maximal degree in co-relation 1897. Up to 35 conditions per place. [2025-03-14 01:16:13,468 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 36 selfloop transitions, 21 changer transitions 0/473 dead transitions. [2025-03-14 01:16:13,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 473 transitions, 1220 flow [2025-03-14 01:16:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:16:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:16:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9511 transitions. [2025-03-14 01:16:13,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95954398708636 [2025-03-14 01:16:13,473 INFO L175 Difference]: Start difference. First operand has 444 places, 436 transitions, 942 flow. Second operand 21 states and 9511 transitions. [2025-03-14 01:16:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 473 transitions, 1220 flow [2025-03-14 01:16:13,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 473 transitions, 1210 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:13,479 INFO L231 Difference]: Finished difference. Result has 464 places, 449 transitions, 1062 flow [2025-03-14 01:16:13,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1062, PETRI_PLACES=464, PETRI_TRANSITIONS=449} [2025-03-14 01:16:13,480 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 5 predicate places. [2025-03-14 01:16:13,480 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 449 transitions, 1062 flow [2025-03-14 01:16:13,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:13,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:13,482 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:13,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:16:13,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-14 01:16:13,683 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1071825591, now seen corresponding path program 2 times [2025-03-14 01:16:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260600097] [2025-03-14 01:16:13,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:16:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:13,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 713 statements into 2 equivalence classes. [2025-03-14 01:16:13,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 713 statements. [2025-03-14 01:16:13,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:16:13,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-14 01:16:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260600097] [2025-03-14 01:16:13,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260600097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:13,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012433760] [2025-03-14 01:16:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:13,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:13,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:13,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:14,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-14 01:16:14,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 449 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:14,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-14 01:16:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:14,826 INFO L124 PetriNetUnfolderBase]: 218/2305 cut-off events. [2025-03-14 01:16:14,826 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-14 01:16:14,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2305 events. 218/2305 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6855 event pairs, 175 based on Foata normal form. 0/2229 useless extension candidates. Maximal degree in co-relation 2614. Up to 543 conditions per place. [2025-03-14 01:16:14,834 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/452 dead transitions. [2025-03-14 01:16:14,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 452 transitions, 1196 flow [2025-03-14 01:16:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-14 01:16:14,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-14 01:16:14,837 INFO L175 Difference]: Start difference. First operand has 464 places, 449 transitions, 1062 flow. Second operand 6 states and 2487 transitions. [2025-03-14 01:16:14,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 452 transitions, 1196 flow [2025-03-14 01:16:14,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 452 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:16:14,843 INFO L231 Difference]: Finished difference. Result has 462 places, 448 transitions, 1046 flow [2025-03-14 01:16:14,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=462, PETRI_TRANSITIONS=448} [2025-03-14 01:16:14,844 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-14 01:16:14,844 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 448 transitions, 1046 flow [2025-03-14 01:16:14,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:14,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:14,845 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:14,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:16:14,845 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:14,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1315803186, now seen corresponding path program 1 times [2025-03-14 01:16:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:14,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742815590] [2025-03-14 01:16:14,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:14,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-03-14 01:16:14,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-03-14 01:16:14,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:14,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-14 01:16:15,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:15,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742815590] [2025-03-14 01:16:15,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742815590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:15,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:15,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:16:15,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488855462] [2025-03-14 01:16:15,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:15,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:16:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:15,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:16:15,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:16:15,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-14 01:16:15,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 448 transitions, 1046 flow. Second operand has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:15,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:15,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-14 01:16:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:15,495 INFO L124 PetriNetUnfolderBase]: 60/2597 cut-off events. [2025-03-14 01:16:15,495 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-14 01:16:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 2597 events. 60/2597 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 8023 event pairs, 17 based on Foata normal form. 4/2481 useless extension candidates. Maximal degree in co-relation 1943. Up to 59 conditions per place. [2025-03-14 01:16:15,504 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 14 selfloop transitions, 4 changer transitions 0/453 dead transitions. [2025-03-14 01:16:15,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 453 transitions, 1094 flow [2025-03-14 01:16:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:16:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:16:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1819 transitions. [2025-03-14 01:16:15,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634533898305084 [2025-03-14 01:16:15,506 INFO L175 Difference]: Start difference. First operand has 462 places, 448 transitions, 1046 flow. Second operand 4 states and 1819 transitions. [2025-03-14 01:16:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 453 transitions, 1094 flow [2025-03-14 01:16:15,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 453 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:15,511 INFO L231 Difference]: Finished difference. Result has 462 places, 451 transitions, 1064 flow [2025-03-14 01:16:15,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=451} [2025-03-14 01:16:15,512 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-14 01:16:15,512 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 451 transitions, 1064 flow [2025-03-14 01:16:15,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:15,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:15,513 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:15,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:16:15,513 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:15,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:15,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2001715536, now seen corresponding path program 1 times [2025-03-14 01:16:15,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:15,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373763744] [2025-03-14 01:16:15,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:15,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-14 01:16:15,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-14 01:16:15,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:15,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-14 01:16:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373763744] [2025-03-14 01:16:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373763744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635100181] [2025-03-14 01:16:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:15,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:15,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:16:16,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-14 01:16:16,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-14 01:16:16,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:16,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:16,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:16:16,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2613 trivial. 0 not checked. [2025-03-14 01:16:16,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:16:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635100181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:16:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:16:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434246729] [2025-03-14 01:16:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:16,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-14 01:16:16,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 451 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:16,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:16,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-14 01:16:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:16,651 INFO L124 PetriNetUnfolderBase]: 53/2586 cut-off events. [2025-03-14 01:16:16,651 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-14 01:16:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 2586 events. 53/2586 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7889 event pairs, 12 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 2354. Up to 44 conditions per place. [2025-03-14 01:16:16,658 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 12 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-14 01:16:16,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 451 transitions, 1093 flow [2025-03-14 01:16:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-14 01:16:16,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-14 01:16:16,659 INFO L175 Difference]: Start difference. First operand has 462 places, 451 transitions, 1064 flow. Second operand 3 states and 1362 transitions. [2025-03-14 01:16:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 451 transitions, 1093 flow [2025-03-14 01:16:16,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 451 transitions, 1091 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:16:16,668 INFO L231 Difference]: Finished difference. Result has 462 places, 450 transitions, 1064 flow [2025-03-14 01:16:16,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=450} [2025-03-14 01:16:16,669 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-14 01:16:16,669 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 450 transitions, 1064 flow [2025-03-14 01:16:16,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:16,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:16,670 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:16,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:16:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-14 01:16:16,870 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1413094414, now seen corresponding path program 1 times [2025-03-14 01:16:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300895947] [2025-03-14 01:16:16,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:16,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-14 01:16:16,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-14 01:16:16,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:16,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-14 01:16:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300895947] [2025-03-14 01:16:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300895947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916013641] [2025-03-14 01:16:17,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:17,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:17,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:16:17,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-14 01:16:18,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-14 01:16:18,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:18,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:16:18,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-14 01:16:18,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:16:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-14 01:16:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916013641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:16:19,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:16:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 01:16:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484276417] [2025-03-14 01:16:19,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:16:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:16:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:16:19,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:16:19,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-14 01:16:19,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 450 transitions, 1064 flow. Second operand has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:19,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:19,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-14 01:16:19,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:20,373 INFO L124 PetriNetUnfolderBase]: 122/4145 cut-off events. [2025-03-14 01:16:20,373 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-03-14 01:16:20,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 4145 events. 122/4145 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11092 event pairs, 10 based on Foata normal form. 16/4028 useless extension candidates. Maximal degree in co-relation 4835. Up to 67 conditions per place. [2025-03-14 01:16:20,388 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 68 selfloop transitions, 45 changer transitions 0/530 dead transitions. [2025-03-14 01:16:20,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 530 transitions, 1734 flow [2025-03-14 01:16:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:16:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:16:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20371 transitions. [2025-03-14 01:16:20,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590866290018832 [2025-03-14 01:16:20,397 INFO L175 Difference]: Start difference. First operand has 462 places, 450 transitions, 1064 flow. Second operand 45 states and 20371 transitions. [2025-03-14 01:16:20,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 530 transitions, 1734 flow [2025-03-14 01:16:20,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 530 transitions, 1730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:16:20,405 INFO L231 Difference]: Finished difference. Result has 513 places, 475 transitions, 1362 flow [2025-03-14 01:16:20,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1362, PETRI_PLACES=513, PETRI_TRANSITIONS=475} [2025-03-14 01:16:20,407 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-14 01:16:20,407 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 475 transitions, 1362 flow [2025-03-14 01:16:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:20,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:20,410 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:20,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:16:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:20,611 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -397418418, now seen corresponding path program 2 times [2025-03-14 01:16:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430579406] [2025-03-14 01:16:20,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:16:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:20,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1334 statements into 2 equivalence classes. [2025-03-14 01:16:20,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 197 of 1334 statements. [2025-03-14 01:16:20,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:16:20,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-14 01:16:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430579406] [2025-03-14 01:16:21,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430579406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:21,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:21,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279040081] [2025-03-14 01:16:21,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:21,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:21,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:21,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:21,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-14 01:16:21,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 475 transitions, 1362 flow. Second operand has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:21,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:21,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-14 01:16:21,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:22,906 INFO L124 PetriNetUnfolderBase]: 466/4463 cut-off events. [2025-03-14 01:16:22,906 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-14 01:16:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6885 conditions, 4463 events. 466/4463 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15509 event pairs, 353 based on Foata normal form. 0/4371 useless extension candidates. Maximal degree in co-relation 5450. Up to 1085 conditions per place. [2025-03-14 01:16:22,917 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 64 selfloop transitions, 6 changer transitions 0/476 dead transitions. [2025-03-14 01:16:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 476 transitions, 1508 flow [2025-03-14 01:16:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2437 transitions. [2025-03-14 01:16:22,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8605225988700564 [2025-03-14 01:16:22,919 INFO L175 Difference]: Start difference. First operand has 513 places, 475 transitions, 1362 flow. Second operand 6 states and 2437 transitions. [2025-03-14 01:16:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 476 transitions, 1508 flow [2025-03-14 01:16:22,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 476 transitions, 1452 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-14 01:16:22,926 INFO L231 Difference]: Finished difference. Result has 497 places, 472 transitions, 1312 flow [2025-03-14 01:16:22,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=497, PETRI_TRANSITIONS=472} [2025-03-14 01:16:22,927 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 38 predicate places. [2025-03-14 01:16:22,928 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 472 transitions, 1312 flow [2025-03-14 01:16:22,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:22,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:22,928 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:22,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:16:22,929 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1749416276, now seen corresponding path program 1 times [2025-03-14 01:16:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047663030] [2025-03-14 01:16:22,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:23,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-14 01:16:23,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-14 01:16:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-14 01:16:23,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047663030] [2025-03-14 01:16:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047663030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550947307] [2025-03-14 01:16:23,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:23,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:23,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:23,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:16:24,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-14 01:16:24,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-14 01:16:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:24,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:16:24,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12618 trivial. 0 not checked. [2025-03-14 01:16:24,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:16:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550947307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:16:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:16:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94961909] [2025-03-14 01:16:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:16:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:24,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:16:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:24,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-14 01:16:24,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 472 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:24,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:24,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-14 01:16:24,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:25,370 INFO L124 PetriNetUnfolderBase]: 67/4060 cut-off events. [2025-03-14 01:16:25,370 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-14 01:16:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 4060 events. 67/4060 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10157 event pairs, 10 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 3825. Up to 60 conditions per place. [2025-03-14 01:16:25,378 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 9 selfloop transitions, 0 changer transitions 5/472 dead transitions. [2025-03-14 01:16:25,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 472 transitions, 1341 flow [2025-03-14 01:16:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:16:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:16:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-14 01:16:25,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-14 01:16:25,380 INFO L175 Difference]: Start difference. First operand has 497 places, 472 transitions, 1312 flow. Second operand 3 states and 1362 transitions. [2025-03-14 01:16:25,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 472 transitions, 1341 flow [2025-03-14 01:16:25,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 472 transitions, 1329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:25,386 INFO L231 Difference]: Finished difference. Result has 493 places, 467 transitions, 1290 flow [2025-03-14 01:16:25,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=493, PETRI_TRANSITIONS=467} [2025-03-14 01:16:25,387 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 34 predicate places. [2025-03-14 01:16:25,387 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 467 transitions, 1290 flow [2025-03-14 01:16:25,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:25,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:25,388 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:25,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 01:16:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-14 01:16:25,588 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -33364687, now seen corresponding path program 1 times [2025-03-14 01:16:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106027099] [2025-03-14 01:16:25,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:25,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-14 01:16:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-14 01:16:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-14 01:16:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106027099] [2025-03-14 01:16:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106027099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:16:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106861175] [2025-03-14 01:16:28,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:16:28,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:16:28,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 01:16:28,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-14 01:16:29,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-14 01:16:29,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:29,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:16:29,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:16:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-14 01:16:30,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:16:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-14 01:16:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106861175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:16:31,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:16:31,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-03-14 01:16:31,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654157633] [2025-03-14 01:16:31,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:16:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-14 01:16:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-14 01:16:31,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-03-14 01:16:31,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-14 01:16:31,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 467 transitions, 1290 flow. Second operand has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:31,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:31,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-14 01:16:31,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:33,197 INFO L124 PetriNetUnfolderBase]: 150/5061 cut-off events. [2025-03-14 01:16:33,197 INFO L125 PetriNetUnfolderBase]: For 1840/1840 co-relation queries the response was YES. [2025-03-14 01:16:33,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 5061 events. 150/5061 cut-off events. For 1840/1840 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12589 event pairs, 10 based on Foata normal form. 10/4956 useless extension candidates. Maximal degree in co-relation 6137. Up to 87 conditions per place. [2025-03-14 01:16:33,216 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 88 selfloop transitions, 60 changer transitions 0/557 dead transitions. [2025-03-14 01:16:33,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 557 transitions, 2134 flow [2025-03-14 01:16:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-14 01:16:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-14 01:16:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 27153 transitions. [2025-03-14 01:16:33,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587923728813559 [2025-03-14 01:16:33,229 INFO L175 Difference]: Start difference. First operand has 493 places, 467 transitions, 1290 flow. Second operand 60 states and 27153 transitions. [2025-03-14 01:16:33,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 557 transitions, 2134 flow [2025-03-14 01:16:33,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 557 transitions, 2134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:16:33,238 INFO L231 Difference]: Finished difference. Result has 554 places, 483 transitions, 1584 flow [2025-03-14 01:16:33,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=1584, PETRI_PLACES=554, PETRI_TRANSITIONS=483} [2025-03-14 01:16:33,238 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 95 predicate places. [2025-03-14 01:16:33,239 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 483 transitions, 1584 flow [2025-03-14 01:16:33,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:33,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:33,242 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:33,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 01:16:33,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:16:33,446 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1939764179, now seen corresponding path program 2 times [2025-03-14 01:16:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608641575] [2025-03-14 01:16:33,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:16:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:33,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1715 statements into 2 equivalence classes. [2025-03-14 01:16:33,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 180 of 1715 statements. [2025-03-14 01:16:33,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:16:33,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-14 01:16:33,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608641575] [2025-03-14 01:16:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608641575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:33,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:33,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646785783] [2025-03-14 01:16:33,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:33,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:33,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:34,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 472 [2025-03-14 01:16:34,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 483 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:34,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:34,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 472 [2025-03-14 01:16:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:35,806 INFO L124 PetriNetUnfolderBase]: 554/5455 cut-off events. [2025-03-14 01:16:35,806 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-03-14 01:16:35,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8578 conditions, 5455 events. 554/5455 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 18013 event pairs, 473 based on Foata normal form. 0/5349 useless extension candidates. Maximal degree in co-relation 8546. Up to 1437 conditions per place. [2025-03-14 01:16:35,826 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/486 dead transitions. [2025-03-14 01:16:35,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 486 transitions, 1722 flow [2025-03-14 01:16:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2477 transitions. [2025-03-14 01:16:35,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746468926553672 [2025-03-14 01:16:35,827 INFO L175 Difference]: Start difference. First operand has 554 places, 483 transitions, 1584 flow. Second operand 6 states and 2477 transitions. [2025-03-14 01:16:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 486 transitions, 1722 flow [2025-03-14 01:16:35,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 486 transitions, 1624 flow, removed 7 selfloop flow, removed 42 redundant places. [2025-03-14 01:16:35,836 INFO L231 Difference]: Finished difference. Result has 516 places, 482 transitions, 1494 flow [2025-03-14 01:16:35,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1494, PETRI_PLACES=516, PETRI_TRANSITIONS=482} [2025-03-14 01:16:35,838 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 57 predicate places. [2025-03-14 01:16:35,838 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 482 transitions, 1494 flow [2025-03-14 01:16:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:35,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:35,840 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:16:35,840 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1933437851, now seen corresponding path program 1 times [2025-03-14 01:16:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269825052] [2025-03-14 01:16:35,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:35,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1724 statements into 1 equivalence classes. [2025-03-14 01:16:36,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1724 of 1724 statements. [2025-03-14 01:16:36,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:36,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-14 01:16:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269825052] [2025-03-14 01:16:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269825052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187832988] [2025-03-14 01:16:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:39,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:39,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:40,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-14 01:16:40,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 482 transitions, 1494 flow. Second operand has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:40,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:40,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-14 01:16:40,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:41,631 INFO L124 PetriNetUnfolderBase]: 518/5411 cut-off events. [2025-03-14 01:16:41,632 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2025-03-14 01:16:41,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 5411 events. 518/5411 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 17501 event pairs, 437 based on Foata normal form. 0/5321 useless extension candidates. Maximal degree in co-relation 8336. Up to 1329 conditions per place. [2025-03-14 01:16:41,658 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 50 selfloop transitions, 5 changer transitions 0/485 dead transitions. [2025-03-14 01:16:41,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 485 transitions, 1614 flow [2025-03-14 01:16:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-03-14 01:16:41,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905367231638418 [2025-03-14 01:16:41,659 INFO L175 Difference]: Start difference. First operand has 516 places, 482 transitions, 1494 flow. Second operand 6 states and 2522 transitions. [2025-03-14 01:16:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 485 transitions, 1614 flow [2025-03-14 01:16:41,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 485 transitions, 1604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:41,671 INFO L231 Difference]: Finished difference. Result has 515 places, 481 transitions, 1492 flow [2025-03-14 01:16:41,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=515, PETRI_TRANSITIONS=481} [2025-03-14 01:16:41,672 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 56 predicate places. [2025-03-14 01:16:41,672 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 481 transitions, 1492 flow [2025-03-14 01:16:41,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:41,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:41,673 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:41,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 01:16:41,674 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -557683693, now seen corresponding path program 1 times [2025-03-14 01:16:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941669432] [2025-03-14 01:16:41,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:41,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-03-14 01:16:41,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-03-14 01:16:41,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:41,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-14 01:16:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941669432] [2025-03-14 01:16:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941669432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:45,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448918866] [2025-03-14 01:16:45,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:45,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:45,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:45,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:45,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-14 01:16:45,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 481 transitions, 1492 flow. Second operand has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:45,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:45,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-14 01:16:45,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:47,381 INFO L124 PetriNetUnfolderBase]: 894/5779 cut-off events. [2025-03-14 01:16:47,381 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2025-03-14 01:16:47,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 5779 events. 894/5779 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 22234 event pairs, 813 based on Foata normal form. 0/5689 useless extension candidates. Maximal degree in co-relation 10480. Up to 2465 conditions per place. [2025-03-14 01:16:47,400 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 92 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-03-14 01:16:47,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 484 transitions, 1696 flow [2025-03-14 01:16:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2312 transitions. [2025-03-14 01:16:47,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8163841807909604 [2025-03-14 01:16:47,401 INFO L175 Difference]: Start difference. First operand has 515 places, 481 transitions, 1492 flow. Second operand 6 states and 2312 transitions. [2025-03-14 01:16:47,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 484 transitions, 1696 flow [2025-03-14 01:16:47,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 484 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:47,409 INFO L231 Difference]: Finished difference. Result has 514 places, 480 transitions, 1490 flow [2025-03-14 01:16:47,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=514, PETRI_TRANSITIONS=480} [2025-03-14 01:16:47,410 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 55 predicate places. [2025-03-14 01:16:47,410 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 480 transitions, 1490 flow [2025-03-14 01:16:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:47,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:47,411 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:47,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:16:47,411 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:47,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash 214897700, now seen corresponding path program 1 times [2025-03-14 01:16:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:47,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050596434] [2025-03-14 01:16:47,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:47,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:47,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1750 statements into 1 equivalence classes. [2025-03-14 01:16:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1750 of 1750 statements. [2025-03-14 01:16:47,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:47,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22686 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22686 trivial. 0 not checked. [2025-03-14 01:16:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050596434] [2025-03-14 01:16:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050596434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:51,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65055830] [2025-03-14 01:16:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:51,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:51,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-14 01:16:51,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 480 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:51,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:51,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-14 01:16:51,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:53,123 INFO L124 PetriNetUnfolderBase]: 950/5827 cut-off events. [2025-03-14 01:16:53,123 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2025-03-14 01:16:53,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5827 events. 950/5827 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22735 event pairs, 869 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 10704. Up to 2641 conditions per place. [2025-03-14 01:16:53,143 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-14 01:16:53,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 483 transitions, 1724 flow [2025-03-14 01:16:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-03-14 01:16:53,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899011299435028 [2025-03-14 01:16:53,145 INFO L175 Difference]: Start difference. First operand has 514 places, 480 transitions, 1490 flow. Second operand 6 states and 2237 transitions. [2025-03-14 01:16:53,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 483 transitions, 1724 flow [2025-03-14 01:16:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:53,153 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1488 flow [2025-03-14 01:16:53,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1488, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-14 01:16:53,153 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-14 01:16:53,153 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1488 flow [2025-03-14 01:16:53,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:53,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:53,154 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:53,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:16:53,154 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 788877584, now seen corresponding path program 1 times [2025-03-14 01:16:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376004885] [2025-03-14 01:16:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:53,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1757 statements into 1 equivalence classes. [2025-03-14 01:16:53,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1757 of 1757 statements. [2025-03-14 01:16:53,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:53,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:16:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 22699 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22699 trivial. 0 not checked. [2025-03-14 01:16:56,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:16:56,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376004885] [2025-03-14 01:16:56,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376004885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:16:56,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:16:56,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:16:56,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172719057] [2025-03-14 01:16:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:16:56,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:16:56,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:16:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:16:56,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:16:57,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-14 01:16:57,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 479 transitions, 1488 flow. Second operand has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:57,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:16:57,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-14 01:16:57,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:16:58,918 INFO L124 PetriNetUnfolderBase]: 950/5843 cut-off events. [2025-03-14 01:16:58,919 INFO L125 PetriNetUnfolderBase]: For 1207/1207 co-relation queries the response was YES. [2025-03-14 01:16:58,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 5843 events. 950/5843 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22886 event pairs, 869 based on Foata normal form. 0/5769 useless extension candidates. Maximal degree in co-relation 10720. Up to 2641 conditions per place. [2025-03-14 01:16:58,938 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-14 01:16:58,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 483 transitions, 1724 flow [2025-03-14 01:16:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:16:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:16:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2243 transitions. [2025-03-14 01:16:58,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920197740112994 [2025-03-14 01:16:58,940 INFO L175 Difference]: Start difference. First operand has 513 places, 479 transitions, 1488 flow. Second operand 6 states and 2243 transitions. [2025-03-14 01:16:58,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 483 transitions, 1724 flow [2025-03-14 01:16:58,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:16:58,948 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1492 flow [2025-03-14 01:16:58,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-14 01:16:58,949 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-14 01:16:58,949 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1492 flow [2025-03-14 01:16:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:16:58,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:16:58,950 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:16:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:16:58,951 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-14 01:16:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:16:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1877902575, now seen corresponding path program 1 times [2025-03-14 01:16:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:16:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465306806] [2025-03-14 01:16:58,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:16:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:16:59,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1762 statements into 1 equivalence classes. [2025-03-14 01:16:59,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1762 of 1762 statements. [2025-03-14 01:16:59,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:16:59,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22707 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22707 trivial. 0 not checked. [2025-03-14 01:17:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465306806] [2025-03-14 01:17:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465306806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:02,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:02,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688034009] [2025-03-14 01:17:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:02,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:02,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:03,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 472 [2025-03-14 01:17:03,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 479 transitions, 1492 flow. Second operand has 6 states, 6 states have (on average 411.1666666666667) internal successors, (2467), 6 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:03,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:03,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 472 [2025-03-14 01:17:03,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand