./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:35:42,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:35:42,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:35:42,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:35:42,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:35:42,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:35:42,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:35:42,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:35:42,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:35:42,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:35:42,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:35:42,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:35:42,723 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:35:42,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:35:42,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:35:42,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:35:42,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:35:42,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:35:42,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:35:42,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:35:42,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:35:42,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:35:42,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:35:42,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:35:42,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:35:42,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:35:42,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:35:42,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:35:42,728 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de [2025-02-06 09:35:43,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:35:43,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:35:43,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:35:43,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:35:43,030 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:35:43,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-02-06 09:35:44,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3e5c8e6/38318f4f57754a7f977e2c2ac16120ee/FLAGbedfbf2a2 [2025-02-06 09:35:44,713 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:35:44,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-02-06 09:35:44,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3e5c8e6/38318f4f57754a7f977e2c2ac16120ee/FLAGbedfbf2a2 [2025-02-06 09:35:44,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3e5c8e6/38318f4f57754a7f977e2c2ac16120ee [2025-02-06 09:35:44,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:35:44,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:35:44,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:35:44,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:35:44,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:35:44,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:35:44" (1/1) ... [2025-02-06 09:35:44,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:44, skipping insertion in model container [2025-02-06 09:35:44,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:35:44" (1/1) ... [2025-02-06 09:35:44,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:35:45,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:35:45,272 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:35:45,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:35:45,383 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:35:45,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45 WrapperNode [2025-02-06 09:35:45,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:35:45,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:35:45,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:35:45,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:35:45,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,441 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2025-02-06 09:35:45,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:35:45,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:35:45,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:35:45,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:35:45,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:35:45,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:35:45,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:35:45,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:35:45,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (1/1) ... [2025-02-06 09:35:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:35:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:45,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:35:45,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:35:45,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:35:45,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:35:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:35:45,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:35:45,543 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:35:45,683 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:35:45,684 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:35:45,943 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:35:45,943 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:35:45,967 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:35:45,969 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:35:45,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:35:45 BoogieIcfgContainer [2025-02-06 09:35:45,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:35:45,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:35:45,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:35:45,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:35:45,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:35:44" (1/3) ... [2025-02-06 09:35:45,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07c1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:35:45, skipping insertion in model container [2025-02-06 09:35:45,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:35:45" (2/3) ... [2025-02-06 09:35:45,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07c1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:35:45, skipping insertion in model container [2025-02-06 09:35:45,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:35:45" (3/3) ... [2025-02-06 09:35:45,981 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2025-02-06 09:35:45,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:35:45,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid-join.i that has 2 procedures, 117 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-02-06 09:35:45,997 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:35:46,054 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:35:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 245 flow [2025-02-06 09:35:46,186 INFO L124 PetriNetUnfolderBase]: 2/170 cut-off events. [2025-02-06 09:35:46,190 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:35:46,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 170 events. 2/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 79. Up to 3 conditions per place. [2025-02-06 09:35:46,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 245 flow [2025-02-06 09:35:46,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 245 flow [2025-02-06 09:35:46,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:35:46,217 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;@aae604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:35:46,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:35:46,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:35:46,228 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-06 09:35:46,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:35:46,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:46,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:46,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1727080092, now seen corresponding path program 1 times [2025-02-06 09:35:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264153632] [2025-02-06 09:35:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:35:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:35:46,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264153632] [2025-02-06 09:35:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264153632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141552416] [2025-02-06 09:35:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:46,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:46,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:46,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:46,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 119 [2025-02-06 09:35:46,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:46,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 119 [2025-02-06 09:35:46,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:46,663 INFO L124 PetriNetUnfolderBase]: 8/212 cut-off events. [2025-02-06 09:35:46,667 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-06 09:35:46,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 212 events. 8/212 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 531 event pairs, 1 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 142. Up to 16 conditions per place. [2025-02-06 09:35:46,670 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 3 changer transitions 2/122 dead transitions. [2025-02-06 09:35:46,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 275 flow [2025-02-06 09:35:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-02-06 09:35:46,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635854341736695 [2025-02-06 09:35:46,689 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 245 flow. Second operand 3 states and 344 transitions. [2025-02-06 09:35:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 275 flow [2025-02-06 09:35:46,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:46,699 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 263 flow [2025-02-06 09:35:46,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-02-06 09:35:46,706 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-02-06 09:35:46,707 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 263 flow [2025-02-06 09:35:46,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:46,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:46,708 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] [2025-02-06 09:35:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:35:46,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1489453352, now seen corresponding path program 1 times [2025-02-06 09:35:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130443928] [2025-02-06 09:35:46,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:46,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:35:46,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:35:46,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:46,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130443928] [2025-02-06 09:35:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130443928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903913103] [2025-02-06 09:35:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:35:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:46,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:35:46,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:35:47,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 119 [2025-02-06 09:35:47,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:47,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 119 [2025-02-06 09:35:47,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:47,173 INFO L124 PetriNetUnfolderBase]: 17/323 cut-off events. [2025-02-06 09:35:47,174 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:35:47,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 323 events. 17/323 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1163 event pairs, 1 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 311. Up to 49 conditions per place. [2025-02-06 09:35:47,176 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 15 selfloop transitions, 2 changer transitions 5/126 dead transitions. [2025-02-06 09:35:47,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 321 flow [2025-02-06 09:35:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-02-06 09:35:47,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977591036414566 [2025-02-06 09:35:47,180 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 263 flow. Second operand 6 states and 641 transitions. [2025-02-06 09:35:47,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 321 flow [2025-02-06 09:35:47,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:47,187 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 275 flow [2025-02-06 09:35:47,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2025-02-06 09:35:47,188 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2025-02-06 09:35:47,188 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 275 flow [2025-02-06 09:35:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:47,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:47,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:35:47,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1091823684, now seen corresponding path program 1 times [2025-02-06 09:35:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181706914] [2025-02-06 09:35:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:47,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:35:47,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:35:47,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181706914] [2025-02-06 09:35:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181706914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658987322] [2025-02-06 09:35:47,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:47,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:47,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2025-02-06 09:35:47,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:47,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:47,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2025-02-06 09:35:47,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:48,032 INFO L124 PetriNetUnfolderBase]: 46/420 cut-off events. [2025-02-06 09:35:48,032 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:35:48,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 420 events. 46/420 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1911 event pairs, 35 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2025-02-06 09:35:48,037 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 36 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-02-06 09:35:48,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 371 flow [2025-02-06 09:35:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2025-02-06 09:35:48,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-02-06 09:35:48,040 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 275 flow. Second operand 6 states and 546 transitions. [2025-02-06 09:35:48,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 371 flow [2025-02-06 09:35:48,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:48,060 INFO L231 Difference]: Finished difference. Result has 126 places, 118 transitions, 269 flow [2025-02-06 09:35:48,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=126, PETRI_TRANSITIONS=118} [2025-02-06 09:35:48,061 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2025-02-06 09:35:48,062 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 118 transitions, 269 flow [2025-02-06 09:35:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:48,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:35:48,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:48,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1602215832, now seen corresponding path program 1 times [2025-02-06 09:35:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832972357] [2025-02-06 09:35:48,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:35:48,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:35:48,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:48,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:48,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832972357] [2025-02-06 09:35:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832972357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:48,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:48,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864144220] [2025-02-06 09:35:48,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:48,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:48,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:48,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2025-02-06 09:35:48,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:48,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2025-02-06 09:35:48,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:48,675 INFO L124 PetriNetUnfolderBase]: 46/346 cut-off events. [2025-02-06 09:35:48,676 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:35:48,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 346 events. 46/346 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 19 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 407. Up to 112 conditions per place. [2025-02-06 09:35:48,681 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 34 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-02-06 09:35:48,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2025-02-06 09:35:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-02-06 09:35:48,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787114845938375 [2025-02-06 09:35:48,685 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 269 flow. Second operand 6 states and 556 transitions. [2025-02-06 09:35:48,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2025-02-06 09:35:48,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:48,692 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 267 flow [2025-02-06 09:35:48,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2025-02-06 09:35:48,693 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-02-06 09:35:48,693 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 267 flow [2025-02-06 09:35:48,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:48,694 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] [2025-02-06 09:35:48,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:35:48,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:48,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash -773651573, now seen corresponding path program 1 times [2025-02-06 09:35:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919221726] [2025-02-06 09:35:48,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:35:48,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:35:48,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:48,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919221726] [2025-02-06 09:35:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919221726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589654601] [2025-02-06 09:35:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:48,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:48,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2025-02-06 09:35:48,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:48,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2025-02-06 09:35:48,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:48,807 INFO L124 PetriNetUnfolderBase]: 5/216 cut-off events. [2025-02-06 09:35:48,808 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-02-06 09:35:48,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 216 events. 5/216 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 595 event pairs, 3 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 212. Up to 25 conditions per place. [2025-02-06 09:35:48,809 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 4 changer transitions 3/120 dead transitions. [2025-02-06 09:35:48,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 303 flow [2025-02-06 09:35:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-02-06 09:35:48,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467787114845938 [2025-02-06 09:35:48,812 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 267 flow. Second operand 3 states and 338 transitions. [2025-02-06 09:35:48,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 303 flow [2025-02-06 09:35:48,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:48,817 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 279 flow [2025-02-06 09:35:48,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2025-02-06 09:35:48,818 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-02-06 09:35:48,818 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 279 flow [2025-02-06 09:35:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:48,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:48,818 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] [2025-02-06 09:35:48,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:35:48,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:48,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1679504555, now seen corresponding path program 1 times [2025-02-06 09:35:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933025114] [2025-02-06 09:35:48,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:35:48,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:35:48,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:48,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933025114] [2025-02-06 09:35:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933025114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732832164] [2025-02-06 09:35:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:49,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:49,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:49,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2025-02-06 09:35:49,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:49,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:49,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2025-02-06 09:35:49,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:49,608 INFO L124 PetriNetUnfolderBase]: 33/406 cut-off events. [2025-02-06 09:35:49,608 INFO L125 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2025-02-06 09:35:49,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 406 events. 33/406 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1816 event pairs, 23 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 511. Up to 79 conditions per place. [2025-02-06 09:35:49,610 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 31 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-02-06 09:35:49,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 363 flow [2025-02-06 09:35:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2025-02-06 09:35:49,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7927170868347339 [2025-02-06 09:35:49,613 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 279 flow. Second operand 6 states and 566 transitions. [2025-02-06 09:35:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 363 flow [2025-02-06 09:35:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:49,620 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 277 flow [2025-02-06 09:35:49,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=125, PETRI_TRANSITIONS=115} [2025-02-06 09:35:49,621 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-02-06 09:35:49,621 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 277 flow [2025-02-06 09:35:49,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:49,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:49,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:49,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:35:49,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1735450292, now seen corresponding path program 1 times [2025-02-06 09:35:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970336219] [2025-02-06 09:35:49,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:49,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:35:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:35:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:35:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970336219] [2025-02-06 09:35:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970336219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:49,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:49,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:35:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062686686] [2025-02-06 09:35:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:49,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:49,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:49,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:49,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:49,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2025-02-06 09:35:49,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:49,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:49,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2025-02-06 09:35:49,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:49,927 INFO L124 PetriNetUnfolderBase]: 10/238 cut-off events. [2025-02-06 09:35:49,928 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:35:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 238 events. 10/238 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 582 event pairs, 0 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 209. Up to 23 conditions per place. [2025-02-06 09:35:49,929 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 13 selfloop transitions, 5 changer transitions 9/116 dead transitions. [2025-02-06 09:35:49,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 309 flow [2025-02-06 09:35:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-02-06 09:35:49,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879551820728291 [2025-02-06 09:35:49,932 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 277 flow. Second operand 6 states and 634 transitions. [2025-02-06 09:35:49,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 309 flow [2025-02-06 09:35:49,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 285 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-02-06 09:35:49,936 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 231 flow [2025-02-06 09:35:49,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2025-02-06 09:35:49,938 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-02-06 09:35:49,938 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 231 flow [2025-02-06 09:35:49,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:49,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:49,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:49,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:35:49,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash 781559917, now seen corresponding path program 1 times [2025-02-06 09:35:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-02-06 09:35:49,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:49,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:49,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:35:49,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:35:49,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:49,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:35:50,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:50,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-02-06 09:35:50,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240100179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:50,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:50,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606302981] [2025-02-06 09:35:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:50,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:50,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:50,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-02-06 09:35:50,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 103 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:50,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-02-06 09:35:50,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:50,567 INFO L124 PetriNetUnfolderBase]: 28/299 cut-off events. [2025-02-06 09:35:50,567 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:35:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 299 events. 28/299 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1036 event pairs, 18 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 60 conditions per place. [2025-02-06 09:35:50,569 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 0 changer transitions 38/110 dead transitions. [2025-02-06 09:35:50,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 301 flow [2025-02-06 09:35:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-02-06 09:35:50,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473389355742297 [2025-02-06 09:35:50,571 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 231 flow. Second operand 6 states and 605 transitions. [2025-02-06 09:35:50,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 301 flow [2025-02-06 09:35:50,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 293 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:50,574 INFO L231 Difference]: Finished difference. Result has 111 places, 72 transitions, 156 flow [2025-02-06 09:35:50,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=111, PETRI_TRANSITIONS=72} [2025-02-06 09:35:50,574 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -9 predicate places. [2025-02-06 09:35:50,575 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 72 transitions, 156 flow [2025-02-06 09:35:50,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:50,575 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:35:50,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:35:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1551377583, now seen corresponding path program 1 times [2025-02-06 09:35:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428262164] [2025-02-06 09:35:50,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:50,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 09:35:50,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 09:35:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:50,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:50,630 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:35:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 09:35:50,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 09:35:50,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:50,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:50,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:35:50,688 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:35:50,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-06 09:35:50,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:35:50,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:35:50,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:35:50,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-06 09:35:50,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:35:50,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-06 09:35:50,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:35:50,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:35:50,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:35:50,692 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:50,694 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:35:50,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:35:50,717 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:35:50,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 290 flow [2025-02-06 09:35:50,753 INFO L124 PetriNetUnfolderBase]: 4/301 cut-off events. [2025-02-06 09:35:50,753 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:35:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 301 events. 4/301 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 594 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 172. Up to 6 conditions per place. [2025-02-06 09:35:50,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 290 flow [2025-02-06 09:35:50,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 290 flow [2025-02-06 09:35:50,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:35:50,758 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;@aae604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:35:50,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 09:35:50,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:35:50,763 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-06 09:35:50,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:35:50,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:50,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:50,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 14682556, now seen corresponding path program 1 times [2025-02-06 09:35:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301654996] [2025-02-06 09:35:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:50,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:35:50,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:35:50,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:50,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301654996] [2025-02-06 09:35:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301654996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:50,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337739706] [2025-02-06 09:35:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:50,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:50,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:50,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:50,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-02-06 09:35:50,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:50,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-02-06 09:35:50,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:50,937 INFO L124 PetriNetUnfolderBase]: 119/878 cut-off events. [2025-02-06 09:35:50,938 INFO L125 PetriNetUnfolderBase]: For 44/87 co-relation queries the response was YES. [2025-02-06 09:35:50,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 878 events. 119/878 cut-off events. For 44/87 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4815 event pairs, 50 based on Foata normal form. 1/773 useless extension candidates. Maximal degree in co-relation 837. Up to 139 conditions per place. [2025-02-06 09:35:50,942 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 4 changer transitions 1/143 dead transitions. [2025-02-06 09:35:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 342 flow [2025-02-06 09:35:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-02-06 09:35:50,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-02-06 09:35:50,944 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 290 flow. Second operand 3 states and 391 transitions. [2025-02-06 09:35:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 342 flow [2025-02-06 09:35:50,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:50,947 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 316 flow [2025-02-06 09:35:50,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-02-06 09:35:50,948 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2025-02-06 09:35:50,948 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 316 flow [2025-02-06 09:35:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:50,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:50,948 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] [2025-02-06 09:35:50,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:35:50,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:50,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 847900008, now seen corresponding path program 1 times [2025-02-06 09:35:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136422854] [2025-02-06 09:35:50,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:50,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:35:50,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:35:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136422854] [2025-02-06 09:35:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136422854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293794313] [2025-02-06 09:35:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:51,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:35:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:51,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:35:51,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:35:51,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-02-06 09:35:51,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:51,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:51,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-02-06 09:35:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:51,318 INFO L124 PetriNetUnfolderBase]: 189/1374 cut-off events. [2025-02-06 09:35:51,318 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2025-02-06 09:35:51,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 1374 events. 189/1374 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9510 event pairs, 131 based on Foata normal form. 1/1256 useless extension candidates. Maximal degree in co-relation 1273. Up to 314 conditions per place. [2025-02-06 09:35:51,331 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 20 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-02-06 09:35:51,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 386 flow [2025-02-06 09:35:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2025-02-06 09:35:51,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-02-06 09:35:51,334 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 316 flow. Second operand 6 states and 730 transitions. [2025-02-06 09:35:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 386 flow [2025-02-06 09:35:51,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:51,339 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 330 flow [2025-02-06 09:35:51,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=149, PETRI_TRANSITIONS=139} [2025-02-06 09:35:51,340 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2025-02-06 09:35:51,341 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 330 flow [2025-02-06 09:35:51,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:51,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:51,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:51,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:35:51,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1616460659, now seen corresponding path program 1 times [2025-02-06 09:35:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406338318] [2025-02-06 09:35:51,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:51,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:35:51,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:35:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406338318] [2025-02-06 09:35:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406338318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179309956] [2025-02-06 09:35:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:51,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:51,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:51,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 137 [2025-02-06 09:35:51,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:51,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:51,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 137 [2025-02-06 09:35:51,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:52,091 INFO L124 PetriNetUnfolderBase]: 448/2416 cut-off events. [2025-02-06 09:35:52,091 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-06 09:35:52,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 2416 events. 448/2416 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20046 event pairs, 342 based on Foata normal form. 0/2149 useless extension candidates. Maximal degree in co-relation 3409. Up to 657 conditions per place. [2025-02-06 09:35:52,106 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 49 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-02-06 09:35:52,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 468 flow [2025-02-06 09:35:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2025-02-06 09:35:52,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781021897810219 [2025-02-06 09:35:52,109 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 330 flow. Second operand 6 states and 642 transitions. [2025-02-06 09:35:52,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 468 flow [2025-02-06 09:35:52,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:52,112 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 326 flow [2025-02-06 09:35:52,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2025-02-06 09:35:52,113 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2025-02-06 09:35:52,113 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 326 flow [2025-02-06 09:35:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:52,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:52,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:52,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:35:52,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:52,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:52,114 INFO L85 PathProgramCache]: Analyzing trace with hash 446511681, now seen corresponding path program 1 times [2025-02-06 09:35:52,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:52,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475847618] [2025-02-06 09:35:52,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:52,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:35:52,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:35:52,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:52,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475847618] [2025-02-06 09:35:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475847618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:52,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254605371] [2025-02-06 09:35:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:52,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:52,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:52,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:52,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2025-02-06 09:35:52,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:52,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:52,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2025-02-06 09:35:52,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:52,848 INFO L124 PetriNetUnfolderBase]: 446/2418 cut-off events. [2025-02-06 09:35:52,848 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-06 09:35:52,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3494 conditions, 2418 events. 446/2418 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 20065 event pairs, 264 based on Foata normal form. 0/2139 useless extension candidates. Maximal degree in co-relation 2137. Up to 633 conditions per place. [2025-02-06 09:35:52,864 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-02-06 09:35:52,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 458 flow [2025-02-06 09:35:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2025-02-06 09:35:52,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931873479318735 [2025-02-06 09:35:52,867 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 326 flow. Second operand 6 states and 652 transitions. [2025-02-06 09:35:52,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 458 flow [2025-02-06 09:35:52,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:52,872 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 324 flow [2025-02-06 09:35:52,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-02-06 09:35:52,874 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-02-06 09:35:52,874 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 324 flow [2025-02-06 09:35:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:52,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:52,874 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] [2025-02-06 09:35:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:35:52,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -278956412, now seen corresponding path program 1 times [2025-02-06 09:35:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-02-06 09:35:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:52,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:35:52,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:35:52,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:52,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400933189] [2025-02-06 09:35:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400933189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95039017] [2025-02-06 09:35:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:52,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:52,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:52,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-02-06 09:35:52,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:52,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:52,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-02-06 09:35:52,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:53,060 INFO L124 PetriNetUnfolderBase]: 165/1189 cut-off events. [2025-02-06 09:35:53,061 INFO L125 PetriNetUnfolderBase]: For 192/359 co-relation queries the response was YES. [2025-02-06 09:35:53,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1189 events. 165/1189 cut-off events. For 192/359 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8120 event pairs, 88 based on Foata normal form. 3/1059 useless extension candidates. Maximal degree in co-relation 1425. Up to 269 conditions per place. [2025-02-06 09:35:53,069 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2025-02-06 09:35:53,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 408 flow [2025-02-06 09:35:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-02-06 09:35:53,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2025-02-06 09:35:53,071 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 324 flow. Second operand 3 states and 387 transitions. [2025-02-06 09:35:53,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 408 flow [2025-02-06 09:35:53,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:53,074 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 370 flow [2025-02-06 09:35:53,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2025-02-06 09:35:53,074 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2025-02-06 09:35:53,075 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 370 flow [2025-02-06 09:35:53,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:53,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:53,075 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] [2025-02-06 09:35:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:35:53,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -841010396, now seen corresponding path program 1 times [2025-02-06 09:35:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630810474] [2025-02-06 09:35:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:35:53,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:35:53,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:53,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630810474] [2025-02-06 09:35:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630810474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678224461] [2025-02-06 09:35:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:53,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:53,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 137 [2025-02-06 09:35:53,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:53,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:53,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 137 [2025-02-06 09:35:53,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:53,875 INFO L124 PetriNetUnfolderBase]: 463/2595 cut-off events. [2025-02-06 09:35:53,875 INFO L125 PetriNetUnfolderBase]: For 408/466 co-relation queries the response was YES. [2025-02-06 09:35:53,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 2595 events. 463/2595 cut-off events. For 408/466 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 22427 event pairs, 251 based on Foata normal form. 3/2378 useless extension candidates. Maximal degree in co-relation 3254. Up to 490 conditions per place. [2025-02-06 09:35:53,889 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 43 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-02-06 09:35:53,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 494 flow [2025-02-06 09:35:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2025-02-06 09:35:53,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2025-02-06 09:35:53,892 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 370 flow. Second operand 6 states and 662 transitions. [2025-02-06 09:35:53,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 494 flow [2025-02-06 09:35:53,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:53,897 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 362 flow [2025-02-06 09:35:53,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2025-02-06 09:35:53,898 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-02-06 09:35:53,898 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 362 flow [2025-02-06 09:35:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:53,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:53,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:53,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:35:53,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:53,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash -985564059, now seen corresponding path program 1 times [2025-02-06 09:35:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749970809] [2025-02-06 09:35:53,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:53,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:35:53,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:35:53,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:53,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:53,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749970809] [2025-02-06 09:35:53,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749970809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:53,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:53,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:35:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951887855] [2025-02-06 09:35:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:53,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:54,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-02-06 09:35:54,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:54,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:54,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-02-06 09:35:54,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:54,282 INFO L124 PetriNetUnfolderBase]: 145/1371 cut-off events. [2025-02-06 09:35:54,282 INFO L125 PetriNetUnfolderBase]: For 142/170 co-relation queries the response was YES. [2025-02-06 09:35:54,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1371 events. 145/1371 cut-off events. For 142/170 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9261 event pairs, 75 based on Foata normal form. 15/1306 useless extension candidates. Maximal degree in co-relation 1061. Up to 195 conditions per place. [2025-02-06 09:35:54,291 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 26 selfloop transitions, 6 changer transitions 3/153 dead transitions. [2025-02-06 09:35:54,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 462 flow [2025-02-06 09:35:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-02-06 09:35:54,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-02-06 09:35:54,294 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 362 flow. Second operand 6 states and 732 transitions. [2025-02-06 09:35:54,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 462 flow [2025-02-06 09:35:54,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:54,298 INFO L231 Difference]: Finished difference. Result has 147 places, 141 transitions, 372 flow [2025-02-06 09:35:54,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=147, PETRI_TRANSITIONS=141} [2025-02-06 09:35:54,298 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-06 09:35:54,298 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 372 flow [2025-02-06 09:35:54,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:54,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:54,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:35:54,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1531446150, now seen corresponding path program 1 times [2025-02-06 09:35:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:54,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975199846] [2025-02-06 09:35:54,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:54,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:35:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:35:54,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:54,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975199846] [2025-02-06 09:35:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975199846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:54,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298960104] [2025-02-06 09:35:54,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:54,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:54,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:54,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2025-02-06 09:35:54,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 141 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:54,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:54,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2025-02-06 09:35:54,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:55,060 INFO L124 PetriNetUnfolderBase]: 329/1886 cut-off events. [2025-02-06 09:35:55,060 INFO L125 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2025-02-06 09:35:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1886 events. 329/1886 cut-off events. For 141/176 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14535 event pairs, 186 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 2181. Up to 364 conditions per place. [2025-02-06 09:35:55,073 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 36 selfloop transitions, 5 changer transitions 1/156 dead transitions. [2025-02-06 09:35:55,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 484 flow [2025-02-06 09:35:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-02-06 09:35:55,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2025-02-06 09:35:55,076 INFO L175 Difference]: Start difference. First operand has 147 places, 141 transitions, 372 flow. Second operand 6 states and 702 transitions. [2025-02-06 09:35:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 484 flow [2025-02-06 09:35:55,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:35:55,081 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 368 flow [2025-02-06 09:35:55,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-02-06 09:35:55,082 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-02-06 09:35:55,082 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 368 flow [2025-02-06 09:35:55,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:55,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:35:55,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 568969079, now seen corresponding path program 1 times [2025-02-06 09:35:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473987733] [2025-02-06 09:35:55,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:35:55,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:35:55,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:35:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:55,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473987733] [2025-02-06 09:35:55,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473987733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:55,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:55,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760530406] [2025-02-06 09:35:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:55,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:55,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:55,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:55,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-02-06 09:35:55,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:55,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-02-06 09:35:55,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:55,264 INFO L124 PetriNetUnfolderBase]: 56/879 cut-off events. [2025-02-06 09:35:55,265 INFO L125 PetriNetUnfolderBase]: For 231/459 co-relation queries the response was YES. [2025-02-06 09:35:55,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 879 events. 56/879 cut-off events. For 231/459 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5322 event pairs, 30 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 1138. Up to 119 conditions per place. [2025-02-06 09:35:55,271 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 1/146 dead transitions. [2025-02-06 09:35:55,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 445 flow [2025-02-06 09:35:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-02-06 09:35:55,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391727493917275 [2025-02-06 09:35:55,273 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 368 flow. Second operand 3 states and 386 transitions. [2025-02-06 09:35:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 445 flow [2025-02-06 09:35:55,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:35:55,279 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 408 flow [2025-02-06 09:35:55,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-02-06 09:35:55,280 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-06 09:35:55,280 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 408 flow [2025-02-06 09:35:55,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:55,280 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:35:55,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1040538817, now seen corresponding path program 1 times [2025-02-06 09:35:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324770325] [2025-02-06 09:35:55,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:55,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:35:55,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:35:55,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:35:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324770325] [2025-02-06 09:35:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324770325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:35:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919369516] [2025-02-06 09:35:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:55,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:55,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 137 [2025-02-06 09:35:55,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:55,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 137 [2025-02-06 09:35:55,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:55,471 INFO L124 PetriNetUnfolderBase]: 12/474 cut-off events. [2025-02-06 09:35:55,472 INFO L125 PetriNetUnfolderBase]: For 119/146 co-relation queries the response was YES. [2025-02-06 09:35:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 474 events. 12/474 cut-off events. For 119/146 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1852 event pairs, 5 based on Foata normal form. 4/472 useless extension candidates. Maximal degree in co-relation 510. Up to 25 conditions per place. [2025-02-06 09:35:55,474 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 8 selfloop transitions, 4 changer transitions 4/143 dead transitions. [2025-02-06 09:35:55,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 429 flow [2025-02-06 09:35:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-02-06 09:35:55,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2025-02-06 09:35:55,477 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 408 flow. Second operand 3 states and 395 transitions. [2025-02-06 09:35:55,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 429 flow [2025-02-06 09:35:55,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:55,481 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 368 flow [2025-02-06 09:35:55,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=147, PETRI_TRANSITIONS=136} [2025-02-06 09:35:55,482 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-06 09:35:55,482 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 368 flow [2025-02-06 09:35:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:55,483 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:55,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:35:55,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:35:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 343188605, now seen corresponding path program 1 times [2025-02-06 09:35:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247990548] [2025-02-06 09:35:55,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:35:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:35:55,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:55,537 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:35:55,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:35:55,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:35:55,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:35:55,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:35:55,577 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 09:35:55,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 09:35:55,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:35:55,579 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:55,579 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:35:55,579 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:35:55,601 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:35:55,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 155 transitions, 337 flow [2025-02-06 09:35:55,652 INFO L124 PetriNetUnfolderBase]: 9/515 cut-off events. [2025-02-06 09:35:55,652 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:35:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 515 events. 9/515 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1345 event pairs, 1 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 309. Up to 12 conditions per place. [2025-02-06 09:35:55,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 155 transitions, 337 flow [2025-02-06 09:35:55,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 155 transitions, 337 flow [2025-02-06 09:35:55,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:35:55,661 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;@aae604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:35:55,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 09:35:55,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:35:55,664 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-06 09:35:55,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:35:55,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:55,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:55,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:35:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1055560476, now seen corresponding path program 1 times [2025-02-06 09:35:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077561714] [2025-02-06 09:35:55,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:55,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:35:55,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:35:55,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077561714] [2025-02-06 09:35:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077561714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178427119] [2025-02-06 09:35:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:55,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 155 [2025-02-06 09:35:55,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:55,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:55,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 155 [2025-02-06 09:35:55,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:56,260 INFO L124 PetriNetUnfolderBase]: 1071/4747 cut-off events. [2025-02-06 09:35:56,260 INFO L125 PetriNetUnfolderBase]: For 439/826 co-relation queries the response was YES. [2025-02-06 09:35:56,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 4747 events. 1071/4747 cut-off events. For 439/826 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 41988 event pairs, 542 based on Foata normal form. 1/4219 useless extension candidates. Maximal degree in co-relation 5220. Up to 1110 conditions per place. [2025-02-06 09:35:56,292 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 23 selfloop transitions, 5 changer transitions 1/164 dead transitions. [2025-02-06 09:35:56,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 411 flow [2025-02-06 09:35:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-02-06 09:35:56,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-02-06 09:35:56,294 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 337 flow. Second operand 3 states and 438 transitions. [2025-02-06 09:35:56,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 411 flow [2025-02-06 09:35:56,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:56,297 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 371 flow [2025-02-06 09:35:56,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-02-06 09:35:56,298 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 4 predicate places. [2025-02-06 09:35:56,298 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 371 flow [2025-02-06 09:35:56,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:56,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:56,299 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] [2025-02-06 09:35:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:35:56,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:35:56,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash 404206120, now seen corresponding path program 1 times [2025-02-06 09:35:56,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729638854] [2025-02-06 09:35:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:56,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:35:56,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:35:56,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:56,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729638854] [2025-02-06 09:35:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729638854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101955905] [2025-02-06 09:35:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:35:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:56,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:35:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:35:56,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 155 [2025-02-06 09:35:56,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:56,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:56,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 155 [2025-02-06 09:35:56,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:57,213 INFO L124 PetriNetUnfolderBase]: 1404/6861 cut-off events. [2025-02-06 09:35:57,213 INFO L125 PetriNetUnfolderBase]: For 440/455 co-relation queries the response was YES. [2025-02-06 09:35:57,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 6861 events. 1404/6861 cut-off events. For 440/455 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 66692 event pairs, 1086 based on Foata normal form. 1/6146 useless extension candidates. Maximal degree in co-relation 6125. Up to 1847 conditions per place. [2025-02-06 09:35:57,262 INFO L140 encePairwiseOnDemand]: 147/155 looper letters, 24 selfloop transitions, 2 changer transitions 5/165 dead transitions. [2025-02-06 09:35:57,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 165 transitions, 449 flow [2025-02-06 09:35:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2025-02-06 09:35:57,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795698924731182 [2025-02-06 09:35:57,265 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 371 flow. Second operand 6 states and 818 transitions. [2025-02-06 09:35:57,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 165 transitions, 449 flow [2025-02-06 09:35:57,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:35:57,275 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 383 flow [2025-02-06 09:35:57,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=168, PETRI_TRANSITIONS=158} [2025-02-06 09:35:57,276 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 10 predicate places. [2025-02-06 09:35:57,276 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 383 flow [2025-02-06 09:35:57,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:57,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:57,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:57,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:35:57,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:35:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1808898152, now seen corresponding path program 1 times [2025-02-06 09:35:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516662749] [2025-02-06 09:35:57,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:57,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:35:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:35:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516662749] [2025-02-06 09:35:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516662749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284331090] [2025-02-06 09:35:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:57,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:57,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:57,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2025-02-06 09:35:57,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:57,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:57,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2025-02-06 09:35:57,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:59,123 INFO L124 PetriNetUnfolderBase]: 3152/13178 cut-off events. [2025-02-06 09:35:59,123 INFO L125 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2025-02-06 09:35:59,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 13178 events. 3152/13178 cut-off events. For 507/508 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 142701 event pairs, 2465 based on Foata normal form. 0/11518 useless extension candidates. Maximal degree in co-relation 19209. Up to 3699 conditions per place. [2025-02-06 09:35:59,188 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 61 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-02-06 09:35:59,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 561 flow [2025-02-06 09:35:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:35:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:35:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-02-06 09:35:59,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2025-02-06 09:35:59,190 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 383 flow. Second operand 6 states and 738 transitions. [2025-02-06 09:35:59,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 561 flow [2025-02-06 09:35:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 181 transitions, 549 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:59,197 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 379 flow [2025-02-06 09:35:59,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=165, PETRI_TRANSITIONS=157} [2025-02-06 09:35:59,198 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 7 predicate places. [2025-02-06 09:35:59,198 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 379 flow [2025-02-06 09:35:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:59,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:59,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:59,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:35:59,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:35:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -986437316, now seen corresponding path program 1 times [2025-02-06 09:35:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989255947] [2025-02-06 09:35:59,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:35:59,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:35:59,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:59,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989255947] [2025-02-06 09:35:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989255947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:35:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802590812] [2025-02-06 09:35:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:35:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:59,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:35:59,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:35:59,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 155 [2025-02-06 09:35:59,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 157 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:59,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:59,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 155 [2025-02-06 09:35:59,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:00,759 INFO L124 PetriNetUnfolderBase]: 3180/13177 cut-off events. [2025-02-06 09:36:00,759 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-02-06 09:36:00,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19214 conditions, 13177 events. 3180/13177 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 143024 event pairs, 1609 based on Foata normal form. 0/11456 useless extension candidates. Maximal degree in co-relation 12505. Up to 3627 conditions per place. [2025-02-06 09:36:00,860 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-02-06 09:36:00,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 551 flow [2025-02-06 09:36:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2025-02-06 09:36:00,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043010752688172 [2025-02-06 09:36:00,863 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 379 flow. Second operand 6 states and 748 transitions. [2025-02-06 09:36:00,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 551 flow [2025-02-06 09:36:00,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:00,868 INFO L231 Difference]: Finished difference. Result has 164 places, 156 transitions, 377 flow [2025-02-06 09:36:00,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=164, PETRI_TRANSITIONS=156} [2025-02-06 09:36:00,869 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-02-06 09:36:00,869 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 156 transitions, 377 flow [2025-02-06 09:36:00,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:00,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:00,869 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] [2025-02-06 09:36:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:36:00,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1152247121, now seen corresponding path program 1 times [2025-02-06 09:36:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269292363] [2025-02-06 09:36:00,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:36:00,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:36:00,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:00,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269292363] [2025-02-06 09:36:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269292363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909370169] [2025-02-06 09:36:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:00,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:00,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-06 09:36:00,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 156 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:00,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:00,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-06 09:36:00,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:01,626 INFO L124 PetriNetUnfolderBase]: 1743/7668 cut-off events. [2025-02-06 09:36:01,626 INFO L125 PetriNetUnfolderBase]: For 1543/2997 co-relation queries the response was YES. [2025-02-06 09:36:01,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11998 conditions, 7668 events. 1743/7668 cut-off events. For 1543/2997 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 78515 event pairs, 967 based on Foata normal form. 9/6727 useless extension candidates. Maximal degree in co-relation 10027. Up to 2242 conditions per place. [2025-02-06 09:36:01,664 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 29 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-02-06 09:36:01,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 511 flow [2025-02-06 09:36:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-02-06 09:36:01,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-02-06 09:36:01,666 INFO L175 Difference]: Start difference. First operand has 164 places, 156 transitions, 377 flow. Second operand 3 states and 436 transitions. [2025-02-06 09:36:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 511 flow [2025-02-06 09:36:01,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 501 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:01,670 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 443 flow [2025-02-06 09:36:01,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2025-02-06 09:36:01,671 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 5 predicate places. [2025-02-06 09:36:01,671 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 443 flow [2025-02-06 09:36:01,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:01,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:01,671 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] [2025-02-06 09:36:01,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:36:01,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 284354991, now seen corresponding path program 1 times [2025-02-06 09:36:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:01,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124048830] [2025-02-06 09:36:01,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:36:01,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:36:01,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:01,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124048830] [2025-02-06 09:36:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124048830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909229768] [2025-02-06 09:36:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:01,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:01,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:01,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:02,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2025-02-06 09:36:02,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:02,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:02,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2025-02-06 09:36:02,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:03,258 INFO L124 PetriNetUnfolderBase]: 3779/14522 cut-off events. [2025-02-06 09:36:03,259 INFO L125 PetriNetUnfolderBase]: For 2116/2667 co-relation queries the response was YES. [2025-02-06 09:36:03,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23789 conditions, 14522 events. 3779/14522 cut-off events. For 2116/2667 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 163663 event pairs, 1889 based on Foata normal form. 17/12972 useless extension candidates. Maximal degree in co-relation 18569. Up to 2793 conditions per place. [2025-02-06 09:36:03,345 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 55 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-02-06 09:36:03,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 185 transitions, 607 flow [2025-02-06 09:36:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-02-06 09:36:03,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2025-02-06 09:36:03,347 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 443 flow. Second operand 6 states and 758 transitions. [2025-02-06 09:36:03,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 185 transitions, 607 flow [2025-02-06 09:36:03,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 185 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:03,363 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 431 flow [2025-02-06 09:36:03,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=164, PETRI_TRANSITIONS=161} [2025-02-06 09:36:03,364 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-02-06 09:36:03,364 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 431 flow [2025-02-06 09:36:03,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:03,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:03,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:03,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:36:03,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:03,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 640876784, now seen corresponding path program 1 times [2025-02-06 09:36:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795625414] [2025-02-06 09:36:03,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:36:03,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:36:03,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:03,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:36:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795625414] [2025-02-06 09:36:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795625414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:36:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279458321] [2025-02-06 09:36:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:03,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:03,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:03,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2025-02-06 09:36:03,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 161 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:03,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:03,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2025-02-06 09:36:03,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:04,241 INFO L124 PetriNetUnfolderBase]: 1302/7697 cut-off events. [2025-02-06 09:36:04,241 INFO L125 PetriNetUnfolderBase]: For 964/1221 co-relation queries the response was YES. [2025-02-06 09:36:04,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11596 conditions, 7697 events. 1302/7697 cut-off events. For 964/1221 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 79478 event pairs, 530 based on Foata normal form. 65/7066 useless extension candidates. Maximal degree in co-relation 5585. Up to 1223 conditions per place. [2025-02-06 09:36:04,281 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 38 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-02-06 09:36:04,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 568 flow [2025-02-06 09:36:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2025-02-06 09:36:04,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870967741935484 [2025-02-06 09:36:04,282 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 431 flow. Second operand 6 states and 825 transitions. [2025-02-06 09:36:04,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 568 flow [2025-02-06 09:36:04,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:04,288 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 447 flow [2025-02-06 09:36:04,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2025-02-06 09:36:04,289 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-06 09:36:04,289 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 447 flow [2025-02-06 09:36:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:04,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:04,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:36:04,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:04,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1015912433, now seen corresponding path program 1 times [2025-02-06 09:36:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056408973] [2025-02-06 09:36:04,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:04,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 09:36:04,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 09:36:04,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:04,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:36:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056408973] [2025-02-06 09:36:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056408973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696740128] [2025-02-06 09:36:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:04,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2025-02-06 09:36:04,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:04,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:04,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2025-02-06 09:36:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:05,709 INFO L124 PetriNetUnfolderBase]: 2701/10581 cut-off events. [2025-02-06 09:36:05,709 INFO L125 PetriNetUnfolderBase]: For 982/1400 co-relation queries the response was YES. [2025-02-06 09:36:05,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17027 conditions, 10581 events. 2701/10581 cut-off events. For 982/1400 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 112748 event pairs, 1410 based on Foata normal form. 11/9539 useless extension candidates. Maximal degree in co-relation 12583. Up to 2113 conditions per place. [2025-02-06 09:36:05,774 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-02-06 09:36:05,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 599 flow [2025-02-06 09:36:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2025-02-06 09:36:05,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580645161290322 [2025-02-06 09:36:05,776 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 447 flow. Second operand 6 states and 798 transitions. [2025-02-06 09:36:05,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 186 transitions, 599 flow [2025-02-06 09:36:05,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 186 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:05,780 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 447 flow [2025-02-06 09:36:05,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2025-02-06 09:36:05,781 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2025-02-06 09:36:05,781 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 447 flow [2025-02-06 09:36:05,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:05,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:05,781 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:05,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:36:05,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -599120233, now seen corresponding path program 1 times [2025-02-06 09:36:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-02-06 09:36:05,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:05,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:36:05,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:36:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:36:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-02-06 09:36:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395878715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:05,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:05,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127286957] [2025-02-06 09:36:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:05,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:05,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:05,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:05,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-06 09:36:05,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:05,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:05,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-06 09:36:05,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:06,557 INFO L124 PetriNetUnfolderBase]: 1086/6184 cut-off events. [2025-02-06 09:36:06,557 INFO L125 PetriNetUnfolderBase]: For 2452/4123 co-relation queries the response was YES. [2025-02-06 09:36:06,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 6184 events. 1086/6184 cut-off events. For 2452/4123 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 65888 event pairs, 589 based on Foata normal form. 13/5734 useless extension candidates. Maximal degree in co-relation 9427. Up to 1450 conditions per place. [2025-02-06 09:36:06,594 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 31 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2025-02-06 09:36:06,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 178 transitions, 608 flow [2025-02-06 09:36:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-02-06 09:36:06,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:36:06,595 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 447 flow. Second operand 3 states and 435 transitions. [2025-02-06 09:36:06,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 178 transitions, 608 flow [2025-02-06 09:36:06,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:06,602 INFO L231 Difference]: Finished difference. Result has 166 places, 171 transitions, 555 flow [2025-02-06 09:36:06,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=166, PETRI_TRANSITIONS=171} [2025-02-06 09:36:06,602 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-06 09:36:06,602 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 171 transitions, 555 flow [2025-02-06 09:36:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:06,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:06,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:36:06,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1611320021, now seen corresponding path program 1 times [2025-02-06 09:36:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-02-06 09:36:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:06,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:36:06,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:36:06,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:06,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:36:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-02-06 09:36:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766571878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:36:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692588647] [2025-02-06 09:36:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:06,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:06,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:06,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:06,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 155 [2025-02-06 09:36:06,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 171 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:06,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:06,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 155 [2025-02-06 09:36:06,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:06,955 INFO L124 PetriNetUnfolderBase]: 124/2155 cut-off events. [2025-02-06 09:36:06,955 INFO L125 PetriNetUnfolderBase]: For 705/828 co-relation queries the response was YES. [2025-02-06 09:36:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 2155 events. 124/2155 cut-off events. For 705/828 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17096 event pairs, 20 based on Foata normal form. 26/2104 useless extension candidates. Maximal degree in co-relation 1243. Up to 142 conditions per place. [2025-02-06 09:36:06,966 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 12 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2025-02-06 09:36:06,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 528 flow [2025-02-06 09:36:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-02-06 09:36:06,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548387096774194 [2025-02-06 09:36:06,967 INFO L175 Difference]: Start difference. First operand has 166 places, 171 transitions, 555 flow. Second operand 3 states and 444 transitions. [2025-02-06 09:36:06,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 528 flow [2025-02-06 09:36:06,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:06,995 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 459 flow [2025-02-06 09:36:06,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2025-02-06 09:36:06,995 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-06 09:36:06,995 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 459 flow [2025-02-06 09:36:06,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:06,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:06,996 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:06,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:36:06,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1518124718, now seen corresponding path program 1 times [2025-02-06 09:36:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:06,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076154544] [2025-02-06 09:36:06,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:06,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 09:36:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 09:36:07,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:07,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 09:36:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076154544] [2025-02-06 09:36:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076154544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:07,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:07,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436168611] [2025-02-06 09:36:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:07,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:07,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:07,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:07,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-06 09:36:07,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:07,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:07,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-06 09:36:07,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:07,328 INFO L124 PetriNetUnfolderBase]: 203/2144 cut-off events. [2025-02-06 09:36:07,328 INFO L125 PetriNetUnfolderBase]: For 1365/1860 co-relation queries the response was YES. [2025-02-06 09:36:07,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 2144 events. 203/2144 cut-off events. For 1365/1860 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17686 event pairs, 134 based on Foata normal form. 3/1995 useless extension candidates. Maximal degree in co-relation 3042. Up to 435 conditions per place. [2025-02-06 09:36:07,340 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 25 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-02-06 09:36:07,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 541 flow [2025-02-06 09:36:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2025-02-06 09:36:07,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204301075268817 [2025-02-06 09:36:07,342 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 459 flow. Second operand 3 states and 428 transitions. [2025-02-06 09:36:07,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 541 flow [2025-02-06 09:36:07,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:36:07,346 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 493 flow [2025-02-06 09:36:07,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2025-02-06 09:36:07,347 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 11 predicate places. [2025-02-06 09:36:07,348 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 493 flow [2025-02-06 09:36:07,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:07,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:07,349 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 09:36:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:36:07,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-06 09:36:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 129004564, now seen corresponding path program 1 times [2025-02-06 09:36:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937480111] [2025-02-06 09:36:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:07,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 09:36:07,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 09:36:07,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:07,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:07,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:36:07,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 09:36:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 09:36:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:07,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:36:07,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:36:07,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 09:36:07,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-06 09:36:07,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-06 09:36:07,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-06 09:36:07,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:36:07,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:07,456 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:36:07,456 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 09:36:07,484 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:36:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 173 transitions, 386 flow [2025-02-06 09:36:07,561 INFO L124 PetriNetUnfolderBase]: 22/897 cut-off events. [2025-02-06 09:36:07,561 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 09:36:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 897 events. 22/897 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3098 event pairs, 6 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 535. Up to 32 conditions per place. [2025-02-06 09:36:07,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 173 transitions, 386 flow [2025-02-06 09:36:07,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 173 transitions, 386 flow [2025-02-06 09:36:07,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:36:07,567 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;@aae604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:36:07,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:36:07,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:36:07,570 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-06 09:36:07,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:36:07,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:07,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:07,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash 554746556, now seen corresponding path program 1 times [2025-02-06 09:36:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-02-06 09:36:07,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:07,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:36:07,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:36:07,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:07,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-02-06 09:36:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846734958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:07,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:07,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047132376] [2025-02-06 09:36:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:07,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:07,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:07,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:07,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2025-02-06 09:36:07,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:07,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:07,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2025-02-06 09:36:07,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:10,083 INFO L124 PetriNetUnfolderBase]: 7859/26538 cut-off events. [2025-02-06 09:36:10,083 INFO L125 PetriNetUnfolderBase]: For 2850/5575 co-relation queries the response was YES. [2025-02-06 09:36:10,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38888 conditions, 26538 events. 7859/26538 cut-off events. For 2850/5575 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 305897 event pairs, 4292 based on Foata normal form. 1/23810 useless extension candidates. Maximal degree in co-relation 30851. Up to 7653 conditions per place. [2025-02-06 09:36:10,512 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 30 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2025-02-06 09:36:10,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 482 flow [2025-02-06 09:36:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-02-06 09:36:10,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-02-06 09:36:10,514 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 386 flow. Second operand 3 states and 485 transitions. [2025-02-06 09:36:10,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 482 flow [2025-02-06 09:36:10,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:36:10,519 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 428 flow [2025-02-06 09:36:10,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2025-02-06 09:36:10,520 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 4 predicate places. [2025-02-06 09:36:10,520 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 428 flow [2025-02-06 09:36:10,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:10,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:10,521 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] [2025-02-06 09:36:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:36:10,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 158371688, now seen corresponding path program 1 times [2025-02-06 09:36:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181626239] [2025-02-06 09:36:10,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:10,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:36:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:36:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181626239] [2025-02-06 09:36:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181626239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:10,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112344632] [2025-02-06 09:36:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:10,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:36:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:10,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:36:10,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:36:10,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2025-02-06 09:36:10,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:10,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:10,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2025-02-06 09:36:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:14,867 INFO L124 PetriNetUnfolderBase]: 9343/35816 cut-off events. [2025-02-06 09:36:14,868 INFO L125 PetriNetUnfolderBase]: For 2632/2756 co-relation queries the response was YES. [2025-02-06 09:36:14,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52733 conditions, 35816 events. 9343/35816 cut-off events. For 2632/2756 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 443793 event pairs, 7523 based on Foata normal form. 1/31567 useless extension candidates. Maximal degree in co-relation 32440. Up to 10778 conditions per place. [2025-02-06 09:36:15,083 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 28 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2025-02-06 09:36:15,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 514 flow [2025-02-06 09:36:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2025-02-06 09:36:15,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728323699421965 [2025-02-06 09:36:15,085 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 428 flow. Second operand 6 states and 906 transitions. [2025-02-06 09:36:15,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 514 flow [2025-02-06 09:36:15,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:15,137 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 438 flow [2025-02-06 09:36:15,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=187, PETRI_TRANSITIONS=177} [2025-02-06 09:36:15,138 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 10 predicate places. [2025-02-06 09:36:15,138 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 438 flow [2025-02-06 09:36:15,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:15,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:15,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:36:15,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:15,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1517001771, now seen corresponding path program 1 times [2025-02-06 09:36:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412351035] [2025-02-06 09:36:15,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:36:15,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:36:15,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412351035] [2025-02-06 09:36:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412351035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565930747] [2025-02-06 09:36:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:15,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2025-02-06 09:36:15,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 177 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:15,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2025-02-06 09:36:15,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:23,676 INFO L124 PetriNetUnfolderBase]: 20475/70474 cut-off events. [2025-02-06 09:36:23,676 INFO L125 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2025-02-06 09:36:23,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105344 conditions, 70474 events. 20475/70474 cut-off events. For 2766/2782 co-relation queries the response was YES. Maximal size of possible extension queue 1691. Compared 937870 event pairs, 16494 based on Foata normal form. 0/60691 useless extension candidates. Maximal degree in co-relation 105230. Up to 21481 conditions per place. [2025-02-06 09:36:24,170 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 73 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2025-02-06 09:36:24,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 656 flow [2025-02-06 09:36:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2025-02-06 09:36:24,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2025-02-06 09:36:24,172 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 438 flow. Second operand 6 states and 834 transitions. [2025-02-06 09:36:24,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 656 flow [2025-02-06 09:36:24,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 09:36:24,217 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 434 flow [2025-02-06 09:36:24,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=184, PETRI_TRANSITIONS=176} [2025-02-06 09:36:24,218 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 7 predicate places. [2025-02-06 09:36:24,218 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 434 flow [2025-02-06 09:36:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:24,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:24,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:36:24,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1598336137, now seen corresponding path program 1 times [2025-02-06 09:36:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650148313] [2025-02-06 09:36:24,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:24,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:36:24,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:36:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650148313] [2025-02-06 09:36:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650148313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304424622] [2025-02-06 09:36:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:24,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2025-02-06 09:36:24,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:24,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:24,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2025-02-06 09:36:24,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:30,848 INFO L124 PetriNetUnfolderBase]: 21685/51607 cut-off events. [2025-02-06 09:36:30,848 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2025-02-06 09:36:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86514 conditions, 51607 events. 21685/51607 cut-off events. For 2346/2346 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 585275 event pairs, 3534 based on Foata normal form. 0/45288 useless extension candidates. Maximal degree in co-relation 15703. Up to 25048 conditions per place. [2025-02-06 09:36:31,188 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 70 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2025-02-06 09:36:31,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 646 flow [2025-02-06 09:36:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-02-06 09:36:31,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8131021194605009 [2025-02-06 09:36:31,189 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 434 flow. Second operand 6 states and 844 transitions. [2025-02-06 09:36:31,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 646 flow [2025-02-06 09:36:31,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 207 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:31,194 INFO L231 Difference]: Finished difference. Result has 183 places, 175 transitions, 432 flow [2025-02-06 09:36:31,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=183, PETRI_TRANSITIONS=175} [2025-02-06 09:36:31,195 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2025-02-06 09:36:31,195 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 432 flow [2025-02-06 09:36:31,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:31,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:31,195 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] [2025-02-06 09:36:31,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:36:31,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1425479612, now seen corresponding path program 1 times [2025-02-06 09:36:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-02-06 09:36:31,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:31,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 09:36:31,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 09:36:31,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:31,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-02-06 09:36:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237428178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:31,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525342601] [2025-02-06 09:36:31,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:31,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:31,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:31,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:31,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2025-02-06 09:36:31,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 175 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:31,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:31,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2025-02-06 09:36:31,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:36,394 INFO L124 PetriNetUnfolderBase]: 13641/46120 cut-off events. [2025-02-06 09:36:36,394 INFO L125 PetriNetUnfolderBase]: For 11665/23311 co-relation queries the response was YES. [2025-02-06 09:36:36,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75500 conditions, 46120 events. 13641/46120 cut-off events. For 11665/23311 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 590456 event pairs, 7860 based on Foata normal form. 33/40368 useless extension candidates. Maximal degree in co-relation 62457. Up to 15890 conditions per place. [2025-02-06 09:36:36,687 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 39 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2025-02-06 09:36:36,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 618 flow [2025-02-06 09:36:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-02-06 09:36:36,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-02-06 09:36:36,689 INFO L175 Difference]: Start difference. First operand has 183 places, 175 transitions, 432 flow. Second operand 3 states and 485 transitions. [2025-02-06 09:36:36,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 618 flow [2025-02-06 09:36:36,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:36,694 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 518 flow [2025-02-06 09:36:36,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=182, PETRI_TRANSITIONS=184} [2025-02-06 09:36:36,694 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2025-02-06 09:36:36,695 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 518 flow [2025-02-06 09:36:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:36,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:36,695 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] [2025-02-06 09:36:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 09:36:36,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:36:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash 760633420, now seen corresponding path program 1 times [2025-02-06 09:36:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850626567] [2025-02-06 09:36:36,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:36,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 09:36:36,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 09:36:36,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:36,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850626567] [2025-02-06 09:36:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850626567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408732403] [2025-02-06 09:36:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:36,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:36,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:36,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:37,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 173 [2025-02-06 09:36:37,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 184 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:37,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:37,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 173 [2025-02-06 09:36:37,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand