./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 48c9605d 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-?-48c9605-m [2025-02-08 05:43:52,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:43:52,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:43:52,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:43:52,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:43:52,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:43:52,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:43:52,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:43:52,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:43:52,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:43:52,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:43:52,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:43:52,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:43:52,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:43:52,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:52,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:43:52,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:43:52,337 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-08 05:43:52,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:43:52,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:43:52,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:43:52,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:43:52,648 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:43:52,649 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-08 05:43:53,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92b5f06b9/de508937f0494d56988173e978a1a5d2/FLAG4f7c4246c [2025-02-08 05:43:54,210 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:43:54,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2025-02-08 05:43:54,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92b5f06b9/de508937f0494d56988173e978a1a5d2/FLAG4f7c4246c [2025-02-08 05:43:54,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92b5f06b9/de508937f0494d56988173e978a1a5d2 [2025-02-08 05:43:54,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:43:54,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:43:54,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:54,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:43:54,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:43:54,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:54,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c29e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54, skipping insertion in model container [2025-02-08 05:43:54,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:54,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:43:54,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:54,879 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:43:54,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:43:54,974 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:43:54,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54 WrapperNode [2025-02-08 05:43:54,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:43:54,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:54,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:43:54,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:43:54,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:54,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,004 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2025-02-08 05:43:55,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:43:55,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:43:55,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:43:55,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:43:55,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:43:55,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:43:55,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:43:55,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:43:55,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (1/1) ... [2025-02-08 05:43:55,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:43:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:43:55,047 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-08 05:43:55,049 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-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:43:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:43:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:43:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:43:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:43:55,066 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:43:55,145 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:43:55,146 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:43:55,387 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:43:55,388 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:43:55,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:43:55,403 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:43:55,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:55 BoogieIcfgContainer [2025-02-08 05:43:55,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:43:55,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:43:55,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:43:55,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:43:55,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:43:54" (1/3) ... [2025-02-08 05:43:55,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b038722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:55, skipping insertion in model container [2025-02-08 05:43:55,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:43:54" (2/3) ... [2025-02-08 05:43:55,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b038722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:43:55, skipping insertion in model container [2025-02-08 05:43:55,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:43:55" (3/3) ... [2025-02-08 05:43:55,410 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2025-02-08 05:43:55,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:43:55,428 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-08 05:43:55,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:43:55,492 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:43:55,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 245 flow [2025-02-08 05:43:55,593 INFO L124 PetriNetUnfolderBase]: 2/170 cut-off events. [2025-02-08 05:43:55,598 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:43:55,602 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-08 05:43:55,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 245 flow [2025-02-08 05:43:55,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 245 flow [2025-02-08 05:43:55,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:55,636 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;@9b1576f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:55,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:43:55,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:55,671 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-08 05:43:55,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:55,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:55,672 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-08 05:43:55,674 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-08 05:43:55,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash -869967209, now seen corresponding path program 1 times [2025-02-08 05:43:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125179363] [2025-02-08 05:43:55,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:43:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:43:55,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:55,843 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-08 05:43:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125179363] [2025-02-08 05:43:55,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125179363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:55,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531050674] [2025-02-08 05:43:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:55,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 119 [2025-02-08 05:43:55,893 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-08 05:43:55,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:55,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 119 [2025-02-08 05:43:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:55,957 INFO L124 PetriNetUnfolderBase]: 8/212 cut-off events. [2025-02-08 05:43:55,957 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-08 05:43:55,958 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 533 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-08 05:43:55,960 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 3 changer transitions 2/122 dead transitions. [2025-02-08 05:43:55,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 275 flow [2025-02-08 05:43:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-02-08 05:43:55,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635854341736695 [2025-02-08 05:43:55,973 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 245 flow. Second operand 3 states and 344 transitions. [2025-02-08 05:43:55,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 275 flow [2025-02-08 05:43:55,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:55,983 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 263 flow [2025-02-08 05:43:55,985 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-08 05:43:55,988 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-02-08 05:43:55,989 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 263 flow [2025-02-08 05:43:55,989 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-08 05:43:55,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:55,989 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-08 05:43:55,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:43:55,990 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-08 05:43:55,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1103839761, now seen corresponding path program 1 times [2025-02-08 05:43:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:55,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118559121] [2025-02-08 05:43:55,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:56,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:43:56,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:43:56,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:56,171 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-08 05:43:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118559121] [2025-02-08 05:43:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118559121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:56,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285735119] [2025-02-08 05:43:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:56,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:56,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:56,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 119 [2025-02-08 05:43:56,252 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-08 05:43:56,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:56,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 119 [2025-02-08 05:43:56,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:56,314 INFO L124 PetriNetUnfolderBase]: 17/323 cut-off events. [2025-02-08 05:43:56,314 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:43:56,315 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-08 05:43:56,316 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 15 selfloop transitions, 2 changer transitions 5/126 dead transitions. [2025-02-08 05:43:56,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 321 flow [2025-02-08 05:43:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-02-08 05:43:56,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977591036414566 [2025-02-08 05:43:56,319 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 263 flow. Second operand 6 states and 641 transitions. [2025-02-08 05:43:56,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 321 flow [2025-02-08 05:43:56,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:56,322 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 275 flow [2025-02-08 05:43:56,322 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-08 05:43:56,322 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2025-02-08 05:43:56,323 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 275 flow [2025-02-08 05:43:56,323 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-08 05:43:56,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:56,323 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-08 05:43:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:43:56,323 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-08 05:43:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1266403848, now seen corresponding path program 1 times [2025-02-08 05:43:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190844268] [2025-02-08 05:43:56,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:56,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:43:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:43:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:56,762 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-08 05:43:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190844268] [2025-02-08 05:43:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190844268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483354813] [2025-02-08 05:43:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:56,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:56,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:56,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:56,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 119 [2025-02-08 05:43:56,944 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-08 05:43:56,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:56,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 119 [2025-02-08 05:43:56,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:57,004 INFO L124 PetriNetUnfolderBase]: 46/420 cut-off events. [2025-02-08 05:43:57,005 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:43:57,006 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 1912 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-08 05:43:57,007 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 36 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-02-08 05:43:57,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 371 flow [2025-02-08 05:43:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2025-02-08 05:43:57,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2025-02-08 05:43:57,008 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 275 flow. Second operand 6 states and 546 transitions. [2025-02-08 05:43:57,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 371 flow [2025-02-08 05:43:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:57,011 INFO L231 Difference]: Finished difference. Result has 126 places, 118 transitions, 269 flow [2025-02-08 05:43:57,011 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-08 05:43:57,012 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2025-02-08 05:43:57,012 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 118 transitions, 269 flow [2025-02-08 05:43:57,012 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-08 05:43:57,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:57,013 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-08 05:43:57,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:43:57,013 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-08 05:43:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 219473547, now seen corresponding path program 1 times [2025-02-08 05:43:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787964928] [2025-02-08 05:43:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:43:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:43:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:57,327 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-08 05:43:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787964928] [2025-02-08 05:43:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787964928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054479966] [2025-02-08 05:43:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:57,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:57,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2025-02-08 05:43:57,416 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-08 05:43:57,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:57,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2025-02-08 05:43:57,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:57,486 INFO L124 PetriNetUnfolderBase]: 46/423 cut-off events. [2025-02-08 05:43:57,486 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:43:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 423 events. 46/423 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2010 event pairs, 34 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 484. Up to 112 conditions per place. [2025-02-08 05:43:57,490 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 34 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-02-08 05:43:57,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2025-02-08 05:43:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-02-08 05:43:57,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7787114845938375 [2025-02-08 05:43:57,492 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 269 flow. Second operand 6 states and 556 transitions. [2025-02-08 05:43:57,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2025-02-08 05:43:57,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:57,497 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 267 flow [2025-02-08 05:43:57,498 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-08 05:43:57,498 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-02-08 05:43:57,498 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 267 flow [2025-02-08 05:43:57,499 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-08 05:43:57,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:57,499 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-08 05:43:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:43:57,499 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-08 05:43:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -748321250, now seen corresponding path program 1 times [2025-02-08 05:43:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724493863] [2025-02-08 05:43:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:57,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:43:57,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:43:57,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:57,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:57,543 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-08 05:43:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724493863] [2025-02-08 05:43:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724493863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:57,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909500844] [2025-02-08 05:43:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:57,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:57,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:57,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2025-02-08 05:43:57,554 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-08 05:43:57,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:57,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2025-02-08 05:43:57,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:57,581 INFO L124 PetriNetUnfolderBase]: 5/216 cut-off events. [2025-02-08 05:43:57,582 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2025-02-08 05:43:57,582 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 601 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-08 05:43:57,582 INFO L140 encePairwiseOnDemand]: 114/119 looper letters, 8 selfloop transitions, 4 changer transitions 3/120 dead transitions. [2025-02-08 05:43:57,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 303 flow [2025-02-08 05:43:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-02-08 05:43:57,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467787114845938 [2025-02-08 05:43:57,584 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 267 flow. Second operand 3 states and 338 transitions. [2025-02-08 05:43:57,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 303 flow [2025-02-08 05:43:57,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:43:57,586 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 279 flow [2025-02-08 05:43:57,587 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-08 05:43:57,587 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2025-02-08 05:43:57,587 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 279 flow [2025-02-08 05:43:57,588 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-08 05:43:57,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:57,588 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-08 05:43:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:43:57,588 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-08 05:43:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -738914749, now seen corresponding path program 1 times [2025-02-08 05:43:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400399020] [2025-02-08 05:43:57,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:57,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:43:57,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:43:57,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:57,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:57,909 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-08 05:43:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400399020] [2025-02-08 05:43:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400399020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353644118] [2025-02-08 05:43:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:57,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:57,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:57,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:58,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2025-02-08 05:43:58,179 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-08 05:43:58,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:58,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2025-02-08 05:43:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:58,256 INFO L124 PetriNetUnfolderBase]: 33/406 cut-off events. [2025-02-08 05:43:58,259 INFO L125 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2025-02-08 05:43:58,260 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 1848 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-08 05:43:58,261 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 31 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-02-08 05:43:58,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 363 flow [2025-02-08 05:43:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2025-02-08 05:43:58,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7927170868347339 [2025-02-08 05:43:58,263 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 279 flow. Second operand 6 states and 566 transitions. [2025-02-08 05:43:58,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 363 flow [2025-02-08 05:43:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:58,268 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 277 flow [2025-02-08 05:43:58,268 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-08 05:43:58,269 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-02-08 05:43:58,269 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 277 flow [2025-02-08 05:43:58,269 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-08 05:43:58,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:58,269 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-08 05:43:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:43:58,270 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-08 05:43:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 750502540, now seen corresponding path program 1 times [2025-02-08 05:43:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383951205] [2025-02-08 05:43:58,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:58,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:43:58,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:43:58,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:58,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:58,380 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-08 05:43:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383951205] [2025-02-08 05:43:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383951205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:43:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087755186] [2025-02-08 05:43:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:58,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:58,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2025-02-08 05:43:58,469 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-08 05:43:58,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:58,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2025-02-08 05:43:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:58,519 INFO L124 PetriNetUnfolderBase]: 10/238 cut-off events. [2025-02-08 05:43:58,519 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:43:58,520 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 587 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-08 05:43:58,520 INFO L140 encePairwiseOnDemand]: 112/119 looper letters, 13 selfloop transitions, 5 changer transitions 9/116 dead transitions. [2025-02-08 05:43:58,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 309 flow [2025-02-08 05:43:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-02-08 05:43:58,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8879551820728291 [2025-02-08 05:43:58,523 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 277 flow. Second operand 6 states and 634 transitions. [2025-02-08 05:43:58,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 309 flow [2025-02-08 05:43:58,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 285 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-02-08 05:43:58,526 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 231 flow [2025-02-08 05:43:58,526 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-08 05:43:58,527 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-02-08 05:43:58,527 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 231 flow [2025-02-08 05:43:58,528 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-08 05:43:58,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:58,529 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-08 05:43:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:43:58,529 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-08 05:43:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 622139299, now seen corresponding path program 1 times [2025-02-08 05:43:58,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:58,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59100256] [2025-02-08 05:43:58,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:58,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:43:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:43:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:58,871 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-08 05:43:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59100256] [2025-02-08 05:43:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59100256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592578344] [2025-02-08 05:43:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:58,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:58,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:59,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-02-08 05:43:59,005 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-08 05:43:59,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:59,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-02-08 05:43:59,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:59,048 INFO L124 PetriNetUnfolderBase]: 28/299 cut-off events. [2025-02-08 05:43:59,049 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:43:59,049 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 1058 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-08 05:43:59,050 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 0 changer transitions 38/110 dead transitions. [2025-02-08 05:43:59,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 301 flow [2025-02-08 05:43:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-02-08 05:43:59,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8473389355742297 [2025-02-08 05:43:59,055 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 231 flow. Second operand 6 states and 605 transitions. [2025-02-08 05:43:59,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 301 flow [2025-02-08 05:43:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 293 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:59,056 INFO L231 Difference]: Finished difference. Result has 111 places, 72 transitions, 156 flow [2025-02-08 05:43:59,057 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-08 05:43:59,057 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -9 predicate places. [2025-02-08 05:43:59,057 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 72 transitions, 156 flow [2025-02-08 05:43:59,057 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-08 05:43:59,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:59,058 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-08 05:43:59,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:43:59,058 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-08 05:43:59,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 821492972, now seen corresponding path program 1 times [2025-02-08 05:43:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:59,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977163409] [2025-02-08 05:43:59,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:59,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:43:59,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:43:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:59,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:43:59,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:43:59,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:43:59,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:59,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:43:59,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:43:59,149 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:43:59,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:43:59,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:43:59,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:43:59,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:43:59,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:43:59,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:43:59,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:43:59,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:43:59,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:43:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:43:59,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:59,154 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:43:59,154 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:43:59,172 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:43:59,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 290 flow [2025-02-08 05:43:59,197 INFO L124 PetriNetUnfolderBase]: 4/301 cut-off events. [2025-02-08 05:43:59,198 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:43:59,198 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-08 05:43:59,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 290 flow [2025-02-08 05:43:59,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 137 transitions, 290 flow [2025-02-08 05:43:59,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:43:59,201 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;@9b1576f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:43:59,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:43:59,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:43:59,204 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-08 05:43:59,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:43:59,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:59,204 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-08 05:43:59,204 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-08 05:43:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1712602551, now seen corresponding path program 1 times [2025-02-08 05:43:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519467179] [2025-02-08 05:43:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:59,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:43:59,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:43:59,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:59,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:59,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-08 05:43:59,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:59,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519467179] [2025-02-08 05:43:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519467179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:59,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611245280] [2025-02-08 05:43:59,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:59,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:59,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:59,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:59,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:59,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-02-08 05:43:59,236 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-08 05:43:59,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:59,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-02-08 05:43:59,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:59,320 INFO L124 PetriNetUnfolderBase]: 119/878 cut-off events. [2025-02-08 05:43:59,320 INFO L125 PetriNetUnfolderBase]: For 72/115 co-relation queries the response was YES. [2025-02-08 05:43:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 878 events. 119/878 cut-off events. For 72/115 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4835 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-08 05:43:59,326 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 16 selfloop transitions, 4 changer transitions 1/143 dead transitions. [2025-02-08 05:43:59,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 342 flow [2025-02-08 05:43:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-02-08 05:43:59,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-02-08 05:43:59,327 INFO L175 Difference]: Start difference. First operand has 139 places, 137 transitions, 290 flow. Second operand 3 states and 391 transitions. [2025-02-08 05:43:59,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 342 flow [2025-02-08 05:43:59,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:59,330 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 316 flow [2025-02-08 05:43:59,331 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-08 05:43:59,332 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2025-02-08 05:43:59,332 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 316 flow [2025-02-08 05:43:59,332 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-08 05:43:59,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:59,332 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-08 05:43:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:43:59,333 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-08 05:43:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 462286417, now seen corresponding path program 1 times [2025-02-08 05:43:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092106654] [2025-02-08 05:43:59,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:59,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:43:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:43:59,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:59,392 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-08 05:43:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092106654] [2025-02-08 05:43:59,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092106654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:59,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:59,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4623532] [2025-02-08 05:43:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:59,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:59,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:59,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:59,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:59,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-02-08 05:43:59,488 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-08 05:43:59,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:59,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-02-08 05:43:59,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:59,634 INFO L124 PetriNetUnfolderBase]: 189/1374 cut-off events. [2025-02-08 05:43:59,635 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2025-02-08 05:43:59,640 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 9496 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-08 05:43:59,645 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 20 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2025-02-08 05:43:59,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 386 flow [2025-02-08 05:43:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2025-02-08 05:43:59,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-02-08 05:43:59,647 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 316 flow. Second operand 6 states and 730 transitions. [2025-02-08 05:43:59,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 386 flow [2025-02-08 05:43:59,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:59,650 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 330 flow [2025-02-08 05:43:59,650 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-08 05:43:59,651 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2025-02-08 05:43:59,651 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 330 flow [2025-02-08 05:43:59,651 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-08 05:43:59,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:59,651 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-08 05:43:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:43:59,654 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-08 05:43:59,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 320279105, now seen corresponding path program 1 times [2025-02-08 05:43:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023198176] [2025-02-08 05:43:59,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:59,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:43:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:43:59,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:59,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:59,812 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-08 05:43:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023198176] [2025-02-08 05:43:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023198176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:59,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777858478] [2025-02-08 05:43:59,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:59,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:59,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:59,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:59,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 137 [2025-02-08 05:43:59,928 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-08 05:43:59,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:59,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 137 [2025-02-08 05:43:59,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:00,202 INFO L124 PetriNetUnfolderBase]: 448/2416 cut-off events. [2025-02-08 05:44:00,203 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-08 05:44:00,209 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 19987 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-08 05:44:00,216 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 49 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-02-08 05:44:00,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 468 flow [2025-02-08 05:44:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2025-02-08 05:44:00,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781021897810219 [2025-02-08 05:44:00,218 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 330 flow. Second operand 6 states and 642 transitions. [2025-02-08 05:44:00,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 468 flow [2025-02-08 05:44:00,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:44:00,221 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 326 flow [2025-02-08 05:44:00,221 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-08 05:44:00,222 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2025-02-08 05:44:00,222 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 326 flow [2025-02-08 05:44:00,222 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-08 05:44:00,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:00,222 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-08 05:44:00,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:44:00,223 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-08 05:44:00,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -936230604, now seen corresponding path program 1 times [2025-02-08 05:44:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:00,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219929118] [2025-02-08 05:44:00,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:00,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:44:00,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:44:00,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:00,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:00,401 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-08 05:44:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219929118] [2025-02-08 05:44:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219929118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848329004] [2025-02-08 05:44:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:00,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:00,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:00,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:00,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 137 [2025-02-08 05:44:00,518 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-08 05:44:00,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:00,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 137 [2025-02-08 05:44:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:00,720 INFO L124 PetriNetUnfolderBase]: 446/2418 cut-off events. [2025-02-08 05:44:00,720 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-08 05:44:00,725 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 19968 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-08 05:44:00,730 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-02-08 05:44:00,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 458 flow [2025-02-08 05:44:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2025-02-08 05:44:00,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7931873479318735 [2025-02-08 05:44:00,732 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 326 flow. Second operand 6 states and 652 transitions. [2025-02-08 05:44:00,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 458 flow [2025-02-08 05:44:00,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:00,735 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 324 flow [2025-02-08 05:44:00,735 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-08 05:44:00,736 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-02-08 05:44:00,736 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 324 flow [2025-02-08 05:44:00,736 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-08 05:44:00,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:00,736 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-08 05:44:00,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:44:00,736 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-08 05:44:00,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash -253626089, now seen corresponding path program 1 times [2025-02-08 05:44:00,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603401246] [2025-02-08 05:44:00,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:44:00,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:44:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:00,762 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-08 05:44:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603401246] [2025-02-08 05:44:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603401246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933356592] [2025-02-08 05:44:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:00,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:00,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:00,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-02-08 05:44:00,773 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-08 05:44:00,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:00,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-02-08 05:44:00,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:00,856 INFO L124 PetriNetUnfolderBase]: 165/1189 cut-off events. [2025-02-08 05:44:00,856 INFO L125 PetriNetUnfolderBase]: For 192/359 co-relation queries the response was YES. [2025-02-08 05:44:00,858 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 8171 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-08 05:44:00,861 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2025-02-08 05:44:00,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 408 flow [2025-02-08 05:44:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-02-08 05:44:00,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2025-02-08 05:44:00,863 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 324 flow. Second operand 3 states and 387 transitions. [2025-02-08 05:44:00,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 408 flow [2025-02-08 05:44:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:00,865 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 370 flow [2025-02-08 05:44:00,866 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-08 05:44:00,866 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2025-02-08 05:44:00,867 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 370 flow [2025-02-08 05:44:00,867 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-08 05:44:00,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:00,868 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-08 05:44:00,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:44:00,868 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-08 05:44:00,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1035537596, now seen corresponding path program 1 times [2025-02-08 05:44:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854136891] [2025-02-08 05:44:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:00,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:44:00,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:44:00,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:00,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:44:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854136891] [2025-02-08 05:44:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854136891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:01,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029307660] [2025-02-08 05:44:01,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:01,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:01,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:01,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 137 [2025-02-08 05:44:01,203 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-08 05:44:01,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:01,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 137 [2025-02-08 05:44:01,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:01,424 INFO L124 PetriNetUnfolderBase]: 463/2595 cut-off events. [2025-02-08 05:44:01,424 INFO L125 PetriNetUnfolderBase]: For 408/466 co-relation queries the response was YES. [2025-02-08 05:44:01,432 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 22412 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-08 05:44:01,441 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 43 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-02-08 05:44:01,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 494 flow [2025-02-08 05:44:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2025-02-08 05:44:01,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2025-02-08 05:44:01,444 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 370 flow. Second operand 6 states and 662 transitions. [2025-02-08 05:44:01,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 494 flow [2025-02-08 05:44:01,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:01,448 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 362 flow [2025-02-08 05:44:01,448 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-08 05:44:01,449 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-02-08 05:44:01,449 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 362 flow [2025-02-08 05:44:01,449 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-08 05:44:01,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:01,449 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-08 05:44:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:44:01,450 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-08 05:44:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1801945117, now seen corresponding path program 1 times [2025-02-08 05:44:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992360791] [2025-02-08 05:44:01,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:44:01,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:44:01,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:01,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:01,524 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-08 05:44:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992360791] [2025-02-08 05:44:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992360791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:01,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:44:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778346276] [2025-02-08 05:44:01,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:01,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:01,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:01,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-02-08 05:44:01,608 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-08 05:44:01,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:01,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-02-08 05:44:01,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:01,712 INFO L124 PetriNetUnfolderBase]: 145/1371 cut-off events. [2025-02-08 05:44:01,712 INFO L125 PetriNetUnfolderBase]: For 142/170 co-relation queries the response was YES. [2025-02-08 05:44:01,715 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 9330 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-08 05:44:01,718 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 26 selfloop transitions, 6 changer transitions 3/153 dead transitions. [2025-02-08 05:44:01,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 462 flow [2025-02-08 05:44:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-02-08 05:44:01,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905109489051095 [2025-02-08 05:44:01,719 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 362 flow. Second operand 6 states and 732 transitions. [2025-02-08 05:44:01,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 462 flow [2025-02-08 05:44:01,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:01,721 INFO L231 Difference]: Finished difference. Result has 147 places, 141 transitions, 372 flow [2025-02-08 05:44:01,722 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-08 05:44:01,722 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-08 05:44:01,722 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 372 flow [2025-02-08 05:44:01,723 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-08 05:44:01,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:01,723 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-08 05:44:01,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:44:01,723 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-08 05:44:01,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1372025532, now seen corresponding path program 1 times [2025-02-08 05:44:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425882599] [2025-02-08 05:44:01,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:01,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:01,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:44:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:44:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:01,915 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-08 05:44:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425882599] [2025-02-08 05:44:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425882599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438728998] [2025-02-08 05:44:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:01,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:02,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2025-02-08 05:44:02,064 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-08 05:44:02,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:02,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2025-02-08 05:44:02,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:02,216 INFO L124 PetriNetUnfolderBase]: 329/1886 cut-off events. [2025-02-08 05:44:02,216 INFO L125 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2025-02-08 05:44:02,221 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 14538 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-08 05:44:02,225 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 36 selfloop transitions, 5 changer transitions 1/156 dead transitions. [2025-02-08 05:44:02,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 484 flow [2025-02-08 05:44:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2025-02-08 05:44:02,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540145985401459 [2025-02-08 05:44:02,227 INFO L175 Difference]: Start difference. First operand has 147 places, 141 transitions, 372 flow. Second operand 6 states and 702 transitions. [2025-02-08 05:44:02,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 484 flow [2025-02-08 05:44:02,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:44:02,230 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 368 flow [2025-02-08 05:44:02,230 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-08 05:44:02,230 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-02-08 05:44:02,230 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 368 flow [2025-02-08 05:44:02,231 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-08 05:44:02,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:02,231 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-08 05:44:02,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:44:02,231 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-08 05:44:02,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:02,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1855456443, now seen corresponding path program 1 times [2025-02-08 05:44:02,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:02,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150077187] [2025-02-08 05:44:02,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:44:02,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:44:02,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:02,281 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-08 05:44:02,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:02,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150077187] [2025-02-08 05:44:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150077187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:02,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672577482] [2025-02-08 05:44:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:02,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:02,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:02,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2025-02-08 05:44:02,294 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-08 05:44:02,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:02,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2025-02-08 05:44:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:02,375 INFO L124 PetriNetUnfolderBase]: 56/879 cut-off events. [2025-02-08 05:44:02,375 INFO L125 PetriNetUnfolderBase]: For 231/459 co-relation queries the response was YES. [2025-02-08 05:44:02,377 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 5332 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-08 05:44:02,379 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 7 changer transitions 1/146 dead transitions. [2025-02-08 05:44:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 445 flow [2025-02-08 05:44:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-02-08 05:44:02,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391727493917275 [2025-02-08 05:44:02,381 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 368 flow. Second operand 3 states and 386 transitions. [2025-02-08 05:44:02,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 445 flow [2025-02-08 05:44:02,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:02,384 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 408 flow [2025-02-08 05:44:02,384 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-08 05:44:02,387 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-08 05:44:02,387 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 408 flow [2025-02-08 05:44:02,387 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-08 05:44:02,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:02,388 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-08 05:44:02,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:44:02,388 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-08 05:44:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -47517037, now seen corresponding path program 1 times [2025-02-08 05:44:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673837587] [2025-02-08 05:44:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:02,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:44:02,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:44:02,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:02,479 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-08 05:44:02,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673837587] [2025-02-08 05:44:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673837587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:44:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55370852] [2025-02-08 05:44:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:02,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:02,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:02,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 137 [2025-02-08 05:44:02,489 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-08 05:44:02,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:02,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 137 [2025-02-08 05:44:02,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:02,545 INFO L124 PetriNetUnfolderBase]: 12/474 cut-off events. [2025-02-08 05:44:02,545 INFO L125 PetriNetUnfolderBase]: For 119/146 co-relation queries the response was YES. [2025-02-08 05:44:02,546 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 1872 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-08 05:44:02,548 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 8 selfloop transitions, 4 changer transitions 4/143 dead transitions. [2025-02-08 05:44:02,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 429 flow [2025-02-08 05:44:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-02-08 05:44:02,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2025-02-08 05:44:02,549 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 408 flow. Second operand 3 states and 395 transitions. [2025-02-08 05:44:02,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 429 flow [2025-02-08 05:44:02,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:02,553 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 368 flow [2025-02-08 05:44:02,553 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-08 05:44:02,553 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2025-02-08 05:44:02,553 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 368 flow [2025-02-08 05:44:02,553 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-08 05:44:02,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:02,554 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-08 05:44:02,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:44:02,554 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-08 05:44:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2119156151, now seen corresponding path program 1 times [2025-02-08 05:44:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546768872] [2025-02-08 05:44:02,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:02,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:44:02,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:44:02,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:02,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:02,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:44:02,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:44:02,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:02,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:44:02,624 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:44:02,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:44:02,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:44:02,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:02,626 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:44:02,626 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:44:02,646 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:44:02,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 155 transitions, 337 flow [2025-02-08 05:44:02,674 INFO L124 PetriNetUnfolderBase]: 9/515 cut-off events. [2025-02-08 05:44:02,675 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:44:02,675 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 1346 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-08 05:44:02,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 155 transitions, 337 flow [2025-02-08 05:44:02,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 155 transitions, 337 flow [2025-02-08 05:44:02,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:02,679 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;@9b1576f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:02,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:44:02,681 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:02,681 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-08 05:44:02,681 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:02,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:02,681 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-08 05:44:02,681 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-08 05:44:02,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:02,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1541486825, now seen corresponding path program 1 times [2025-02-08 05:44:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615025359] [2025-02-08 05:44:02,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:02,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:44:02,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:44:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:02,698 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-08 05:44:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615025359] [2025-02-08 05:44:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615025359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297985573] [2025-02-08 05:44:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:02,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:02,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:02,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 155 [2025-02-08 05:44:02,712 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-08 05:44:02,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:02,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 155 [2025-02-08 05:44:02,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:03,054 INFO L124 PetriNetUnfolderBase]: 1071/4747 cut-off events. [2025-02-08 05:44:03,054 INFO L125 PetriNetUnfolderBase]: For 439/826 co-relation queries the response was YES. [2025-02-08 05:44:03,064 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 42162 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-08 05:44:03,073 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 23 selfloop transitions, 5 changer transitions 1/164 dead transitions. [2025-02-08 05:44:03,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 411 flow [2025-02-08 05:44:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-02-08 05:44:03,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419354838709677 [2025-02-08 05:44:03,075 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 337 flow. Second operand 3 states and 438 transitions. [2025-02-08 05:44:03,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 411 flow [2025-02-08 05:44:03,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:44:03,077 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 371 flow [2025-02-08 05:44:03,077 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-08 05:44:03,077 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 4 predicate places. [2025-02-08 05:44:03,077 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 371 flow [2025-02-08 05:44:03,078 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-08 05:44:03,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:03,078 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-08 05:44:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:44:03,079 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-08 05:44:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 18592529, now seen corresponding path program 1 times [2025-02-08 05:44:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785932503] [2025-02-08 05:44:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:44:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:44:03,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:03,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:03,118 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-08 05:44:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785932503] [2025-02-08 05:44:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785932503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115393468] [2025-02-08 05:44:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:03,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:44:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:03,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:44:03,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:44:03,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 155 [2025-02-08 05:44:03,180 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-08 05:44:03,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:03,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 155 [2025-02-08 05:44:03,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:03,657 INFO L124 PetriNetUnfolderBase]: 1404/6861 cut-off events. [2025-02-08 05:44:03,658 INFO L125 PetriNetUnfolderBase]: For 443/458 co-relation queries the response was YES. [2025-02-08 05:44:03,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 6861 events. 1404/6861 cut-off events. For 443/458 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 66669 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-08 05:44:03,687 INFO L140 encePairwiseOnDemand]: 147/155 looper letters, 24 selfloop transitions, 2 changer transitions 5/165 dead transitions. [2025-02-08 05:44:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 165 transitions, 449 flow [2025-02-08 05:44:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2025-02-08 05:44:03,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795698924731182 [2025-02-08 05:44:03,689 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 371 flow. Second operand 6 states and 818 transitions. [2025-02-08 05:44:03,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 165 transitions, 449 flow [2025-02-08 05:44:03,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:03,695 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 383 flow [2025-02-08 05:44:03,695 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-08 05:44:03,695 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 10 predicate places. [2025-02-08 05:44:03,695 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 383 flow [2025-02-08 05:44:03,696 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-08 05:44:03,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:03,696 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-08 05:44:03,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:44:03,696 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-08 05:44:03,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash -549329380, now seen corresponding path program 1 times [2025-02-08 05:44:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461375472] [2025-02-08 05:44:03,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:03,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:44:03,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:44:03,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:03,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:03,802 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-08 05:44:03,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:03,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461375472] [2025-02-08 05:44:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461375472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:03,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:03,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668168018] [2025-02-08 05:44:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:03,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:03,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2025-02-08 05:44:03,957 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-08 05:44:03,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:03,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2025-02-08 05:44:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:05,055 INFO L124 PetriNetUnfolderBase]: 3152/13178 cut-off events. [2025-02-08 05:44:05,055 INFO L125 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2025-02-08 05:44:05,094 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 142848 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-08 05:44:05,128 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 61 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-02-08 05:44:05,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 561 flow [2025-02-08 05:44:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2025-02-08 05:44:05,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7935483870967742 [2025-02-08 05:44:05,130 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 383 flow. Second operand 6 states and 738 transitions. [2025-02-08 05:44:05,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 561 flow [2025-02-08 05:44:05,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 181 transitions, 549 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:44:05,135 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 379 flow [2025-02-08 05:44:05,136 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-08 05:44:05,136 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 7 predicate places. [2025-02-08 05:44:05,136 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 379 flow [2025-02-08 05:44:05,136 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-08 05:44:05,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:05,137 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-08 05:44:05,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:44:05,137 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-08 05:44:05,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1925787695, now seen corresponding path program 1 times [2025-02-08 05:44:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380209951] [2025-02-08 05:44:05,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:05,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:44:05,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:44:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:05,267 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-08 05:44:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:05,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380209951] [2025-02-08 05:44:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380209951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458911755] [2025-02-08 05:44:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:05,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:05,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:05,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 155 [2025-02-08 05:44:05,436 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-08 05:44:05,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:05,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 155 [2025-02-08 05:44:05,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:06,428 INFO L124 PetriNetUnfolderBase]: 3111/12735 cut-off events. [2025-02-08 05:44:06,428 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-02-08 05:44:06,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18633 conditions, 12735 events. 3111/12735 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 138490 event pairs, 1733 based on Foata normal form. 0/11154 useless extension candidates. Maximal degree in co-relation 5021. Up to 3533 conditions per place. [2025-02-08 05:44:06,483 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-02-08 05:44:06,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 551 flow [2025-02-08 05:44:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2025-02-08 05:44:06,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043010752688172 [2025-02-08 05:44:06,488 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 379 flow. Second operand 6 states and 748 transitions. [2025-02-08 05:44:06,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 551 flow [2025-02-08 05:44:06,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:06,490 INFO L231 Difference]: Finished difference. Result has 164 places, 156 transitions, 377 flow [2025-02-08 05:44:06,490 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-08 05:44:06,491 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-02-08 05:44:06,491 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 156 transitions, 377 flow [2025-02-08 05:44:06,491 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-08 05:44:06,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:06,491 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-08 05:44:06,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:44:06,492 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-08 05:44:06,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1126916798, now seen corresponding path program 1 times [2025-02-08 05:44:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:06,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534311360] [2025-02-08 05:44:06,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:44:06,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:44:06,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:06,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:06,513 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-08 05:44:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534311360] [2025-02-08 05:44:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534311360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338422] [2025-02-08 05:44:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:06,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:06,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:06,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:06,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-08 05:44:06,528 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-08 05:44:06,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:06,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-08 05:44:06,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:07,083 INFO L124 PetriNetUnfolderBase]: 1743/7668 cut-off events. [2025-02-08 05:44:07,084 INFO L125 PetriNetUnfolderBase]: For 1814/3268 co-relation queries the response was YES. [2025-02-08 05:44:07,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11998 conditions, 7668 events. 1743/7668 cut-off events. For 1814/3268 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 78691 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-08 05:44:07,122 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 29 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-02-08 05:44:07,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 511 flow [2025-02-08 05:44:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-02-08 05:44:07,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376344086021505 [2025-02-08 05:44:07,123 INFO L175 Difference]: Start difference. First operand has 164 places, 156 transitions, 377 flow. Second operand 3 states and 436 transitions. [2025-02-08 05:44:07,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 511 flow [2025-02-08 05:44:07,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 501 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:07,126 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 443 flow [2025-02-08 05:44:07,126 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-08 05:44:07,126 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 5 predicate places. [2025-02-08 05:44:07,127 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 443 flow [2025-02-08 05:44:07,127 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-08 05:44:07,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:07,127 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-08 05:44:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:44:07,127 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-08 05:44:07,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2134064313, now seen corresponding path program 1 times [2025-02-08 05:44:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628251405] [2025-02-08 05:44:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:07,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:44:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:44:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:07,359 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-08 05:44:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628251405] [2025-02-08 05:44:07,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628251405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:07,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:07,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195752630] [2025-02-08 05:44:07,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:07,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:07,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:07,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2025-02-08 05:44:07,559 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-08 05:44:07,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:07,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2025-02-08 05:44:07,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:08,977 INFO L124 PetriNetUnfolderBase]: 3779/14522 cut-off events. [2025-02-08 05:44:08,977 INFO L125 PetriNetUnfolderBase]: For 2116/2667 co-relation queries the response was YES. [2025-02-08 05:44:09,047 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 535. Compared 163632 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-08 05:44:09,094 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 55 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-02-08 05:44:09,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 185 transitions, 607 flow [2025-02-08 05:44:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-02-08 05:44:09,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8150537634408602 [2025-02-08 05:44:09,095 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 443 flow. Second operand 6 states and 758 transitions. [2025-02-08 05:44:09,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 185 transitions, 607 flow [2025-02-08 05:44:09,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 185 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:09,112 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 431 flow [2025-02-08 05:44:09,112 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-08 05:44:09,112 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2025-02-08 05:44:09,113 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 431 flow [2025-02-08 05:44:09,113 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-08 05:44:09,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:09,113 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-08 05:44:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:44:09,114 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-08 05:44:09,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash -866581336, now seen corresponding path program 1 times [2025-02-08 05:44:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665129900] [2025-02-08 05:44:09,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:44:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:44:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:09,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:09,177 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-08 05:44:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665129900] [2025-02-08 05:44:09,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665129900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:09,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:09,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:44:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799780670] [2025-02-08 05:44:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:09,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:09,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:09,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:09,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2025-02-08 05:44:09,271 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-08 05:44:09,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:09,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2025-02-08 05:44:09,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:09,852 INFO L124 PetriNetUnfolderBase]: 1302/7697 cut-off events. [2025-02-08 05:44:09,853 INFO L125 PetriNetUnfolderBase]: For 964/1221 co-relation queries the response was YES. [2025-02-08 05:44:09,880 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 79487 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-08 05:44:09,899 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 38 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-02-08 05:44:09,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 568 flow [2025-02-08 05:44:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2025-02-08 05:44:09,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870967741935484 [2025-02-08 05:44:09,902 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 431 flow. Second operand 6 states and 825 transitions. [2025-02-08 05:44:09,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 568 flow [2025-02-08 05:44:09,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:09,909 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 447 flow [2025-02-08 05:44:09,910 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-08 05:44:09,910 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-08 05:44:09,910 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 447 flow [2025-02-08 05:44:09,910 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-08 05:44:09,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:09,911 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-08 05:44:09,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:44:09,911 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-08 05:44:09,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:09,911 INFO L85 PathProgramCache]: Analyzing trace with hash 856491815, now seen corresponding path program 1 times [2025-02-08 05:44:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577812205] [2025-02-08 05:44:09,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:09,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:44:09,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:44:09,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:09,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:10,099 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-08 05:44:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577812205] [2025-02-08 05:44:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577812205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284677259] [2025-02-08 05:44:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:10,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 155 [2025-02-08 05:44:10,224 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-08 05:44:10,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:10,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 155 [2025-02-08 05:44:10,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:11,117 INFO L124 PetriNetUnfolderBase]: 2701/10581 cut-off events. [2025-02-08 05:44:11,117 INFO L125 PetriNetUnfolderBase]: For 967/1385 co-relation queries the response was YES. [2025-02-08 05:44:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17027 conditions, 10581 events. 2701/10581 cut-off events. For 967/1385 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 112964 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-08 05:44:11,163 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 48 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2025-02-08 05:44:11,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 599 flow [2025-02-08 05:44:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2025-02-08 05:44:11,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580645161290322 [2025-02-08 05:44:11,165 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 447 flow. Second operand 6 states and 798 transitions. [2025-02-08 05:44:11,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 186 transitions, 599 flow [2025-02-08 05:44:11,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 186 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:44:11,168 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 447 flow [2025-02-08 05:44:11,168 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-08 05:44:11,169 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2025-02-08 05:44:11,169 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 447 flow [2025-02-08 05:44:11,169 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-08 05:44:11,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:11,169 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-08 05:44:11,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:44:11,169 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-08 05:44:11,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash 687367131, now seen corresponding path program 1 times [2025-02-08 05:44:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:11,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926071691] [2025-02-08 05:44:11,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:11,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:44:11,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:44:11,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:11,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:11,198 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-08 05:44:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926071691] [2025-02-08 05:44:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926071691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:11,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:11,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875183621] [2025-02-08 05:44:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:11,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:11,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:11,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:11,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:11,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-08 05:44:11,212 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-08 05:44:11,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:11,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-08 05:44:11,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:11,722 INFO L124 PetriNetUnfolderBase]: 1086/6184 cut-off events. [2025-02-08 05:44:11,722 INFO L125 PetriNetUnfolderBase]: For 2886/5458 co-relation queries the response was YES. [2025-02-08 05:44:11,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 6184 events. 1086/6184 cut-off events. For 2886/5458 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 65864 event pairs, 589 based on Foata normal form. 13/5722 useless extension candidates. Maximal degree in co-relation 9427. Up to 1450 conditions per place. [2025-02-08 05:44:11,764 INFO L140 encePairwiseOnDemand]: 148/155 looper letters, 31 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2025-02-08 05:44:11,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 178 transitions, 608 flow [2025-02-08 05:44:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-02-08 05:44:11,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-08 05:44:11,765 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 447 flow. Second operand 3 states and 435 transitions. [2025-02-08 05:44:11,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 178 transitions, 608 flow [2025-02-08 05:44:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:11,770 INFO L231 Difference]: Finished difference. Result has 166 places, 171 transitions, 555 flow [2025-02-08 05:44:11,770 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-08 05:44:11,770 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-08 05:44:11,770 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 171 transitions, 555 flow [2025-02-08 05:44:11,771 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-08 05:44:11,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:11,771 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-08 05:44:11,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:44:11,771 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-08 05:44:11,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1891180015, now seen corresponding path program 1 times [2025-02-08 05:44:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246535022] [2025-02-08 05:44:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:11,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:44:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:44:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:11,822 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-08 05:44:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246535022] [2025-02-08 05:44:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246535022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:11,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:11,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:44:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297661759] [2025-02-08 05:44:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:11,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:11,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:11,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:11,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 155 [2025-02-08 05:44:11,831 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-08 05:44:11,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:11,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 155 [2025-02-08 05:44:11,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:11,989 INFO L124 PetriNetUnfolderBase]: 124/2155 cut-off events. [2025-02-08 05:44:11,990 INFO L125 PetriNetUnfolderBase]: For 721/844 co-relation queries the response was YES. [2025-02-08 05:44:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 2155 events. 124/2155 cut-off events. For 721/844 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17239 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-08 05:44:11,997 INFO L140 encePairwiseOnDemand]: 149/155 looper letters, 12 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2025-02-08 05:44:11,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 528 flow [2025-02-08 05:44:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-02-08 05:44:11,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548387096774194 [2025-02-08 05:44:11,998 INFO L175 Difference]: Start difference. First operand has 166 places, 171 transitions, 555 flow. Second operand 3 states and 444 transitions. [2025-02-08 05:44:11,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 528 flow [2025-02-08 05:44:12,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:12,002 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 459 flow [2025-02-08 05:44:12,002 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-08 05:44:12,002 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2025-02-08 05:44:12,003 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 459 flow [2025-02-08 05:44:12,003 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-08 05:44:12,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:12,003 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-08 05:44:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:44:12,003 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-08 05:44:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -67884319, now seen corresponding path program 1 times [2025-02-08 05:44:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105771244] [2025-02-08 05:44:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:12,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:44:12,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:44:12,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:12,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:12,045 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-08 05:44:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105771244] [2025-02-08 05:44:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105771244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936735827] [2025-02-08 05:44:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:12,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:12,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:12,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:12,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:12,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2025-02-08 05:44:12,059 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-08 05:44:12,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:12,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2025-02-08 05:44:12,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:12,261 INFO L124 PetriNetUnfolderBase]: 203/2144 cut-off events. [2025-02-08 05:44:12,262 INFO L125 PetriNetUnfolderBase]: For 1461/1958 co-relation queries the response was YES. [2025-02-08 05:44:12,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 2144 events. 203/2144 cut-off events. For 1461/1958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17707 event pairs, 134 based on Foata normal form. 3/1994 useless extension candidates. Maximal degree in co-relation 3042. Up to 435 conditions per place. [2025-02-08 05:44:12,267 INFO L140 encePairwiseOnDemand]: 150/155 looper letters, 25 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-02-08 05:44:12,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 541 flow [2025-02-08 05:44:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2025-02-08 05:44:12,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204301075268817 [2025-02-08 05:44:12,268 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 459 flow. Second operand 3 states and 428 transitions. [2025-02-08 05:44:12,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 541 flow [2025-02-08 05:44:12,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:44:12,271 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 493 flow [2025-02-08 05:44:12,271 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-08 05:44:12,271 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 11 predicate places. [2025-02-08 05:44:12,271 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 493 flow [2025-02-08 05:44:12,273 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-08 05:44:12,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:12,273 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-08 05:44:12,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:44:12,273 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-08 05:44:12,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -903909553, now seen corresponding path program 1 times [2025-02-08 05:44:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458046796] [2025-02-08 05:44:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:44:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:44:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:12,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:44:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:44:12,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:44:12,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:12,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:44:12,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:44:12,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:44:12,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:44:12,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:44:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:44:12,361 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:44:12,361 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:44:12,361 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:44:12,379 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:44:12,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 173 transitions, 386 flow [2025-02-08 05:44:12,438 INFO L124 PetriNetUnfolderBase]: 22/897 cut-off events. [2025-02-08 05:44:12,439 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:44:12,441 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 3094 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-08 05:44:12,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 173 transitions, 386 flow [2025-02-08 05:44:12,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 173 transitions, 386 flow [2025-02-08 05:44:12,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:44:12,444 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;@9b1576f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:44:12,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:44:12,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:44:12,446 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-02-08 05:44:12,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:44:12,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:12,446 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-08 05:44:12,447 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-08 05:44:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2042300745, now seen corresponding path program 1 times [2025-02-08 05:44:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499886929] [2025-02-08 05:44:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:12,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:44:12,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:44:12,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:12,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:12,459 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-08 05:44:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499886929] [2025-02-08 05:44:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499886929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608837106] [2025-02-08 05:44:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:12,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:12,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:12,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2025-02-08 05:44:12,474 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-08 05:44:12,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:12,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2025-02-08 05:44:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:15,172 INFO L124 PetriNetUnfolderBase]: 7859/26538 cut-off events. [2025-02-08 05:44:15,173 INFO L125 PetriNetUnfolderBase]: For 2688/5413 co-relation queries the response was YES. [2025-02-08 05:44:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38888 conditions, 26538 events. 7859/26538 cut-off events. For 2688/5413 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 306219 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-08 05:44:15,369 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 30 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2025-02-08 05:44:15,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 482 flow [2025-02-08 05:44:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-02-08 05:44:15,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-02-08 05:44:15,370 INFO L175 Difference]: Start difference. First operand has 177 places, 173 transitions, 386 flow. Second operand 3 states and 485 transitions. [2025-02-08 05:44:15,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 482 flow [2025-02-08 05:44:15,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:44:15,375 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 428 flow [2025-02-08 05:44:15,375 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-08 05:44:15,376 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 4 predicate places. [2025-02-08 05:44:15,376 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 428 flow [2025-02-08 05:44:15,376 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-08 05:44:15,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:15,376 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-08 05:44:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:44:15,376 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-08 05:44:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash -227241903, now seen corresponding path program 1 times [2025-02-08 05:44:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613678230] [2025-02-08 05:44:15,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:15,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:44:15,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:44:15,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:15,415 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-08 05:44:15,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613678230] [2025-02-08 05:44:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613678230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:15,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116322327] [2025-02-08 05:44:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:44:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:15,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:44:15,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:44:15,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2025-02-08 05:44:15,499 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-08 05:44:15,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:15,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2025-02-08 05:44:15,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:19,203 INFO L124 PetriNetUnfolderBase]: 9343/35816 cut-off events. [2025-02-08 05:44:19,203 INFO L125 PetriNetUnfolderBase]: For 2616/2740 co-relation queries the response was YES. [2025-02-08 05:44:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52733 conditions, 35816 events. 9343/35816 cut-off events. For 2616/2740 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 443592 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-08 05:44:19,502 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 28 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2025-02-08 05:44:19,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 514 flow [2025-02-08 05:44:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2025-02-08 05:44:19,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8728323699421965 [2025-02-08 05:44:19,503 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 428 flow. Second operand 6 states and 906 transitions. [2025-02-08 05:44:19,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 514 flow [2025-02-08 05:44:19,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:44:19,546 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 438 flow [2025-02-08 05:44:19,546 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-08 05:44:19,546 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 10 predicate places. [2025-02-08 05:44:19,547 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 438 flow [2025-02-08 05:44:19,547 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-08 05:44:19,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:19,547 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-08 05:44:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:44:19,548 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-08 05:44:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 419737993, now seen corresponding path program 1 times [2025-02-08 05:44:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822574148] [2025-02-08 05:44:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:19,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:44:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:44:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:19,687 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-08 05:44:19,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:19,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822574148] [2025-02-08 05:44:19,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822574148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587440241] [2025-02-08 05:44:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:19,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:19,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:19,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2025-02-08 05:44:19,799 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-08 05:44:19,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:19,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2025-02-08 05:44:19,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:27,518 INFO L124 PetriNetUnfolderBase]: 20475/70474 cut-off events. [2025-02-08 05:44:27,519 INFO L125 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2025-02-08 05:44:27,950 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 1690. Compared 937012 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-08 05:44:28,187 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 73 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2025-02-08 05:44:28,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 656 flow [2025-02-08 05:44:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2025-02-08 05:44:28,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034682080924855 [2025-02-08 05:44:28,189 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 438 flow. Second operand 6 states and 834 transitions. [2025-02-08 05:44:28,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 656 flow [2025-02-08 05:44:28,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:44:28,227 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 434 flow [2025-02-08 05:44:28,228 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-08 05:44:28,228 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 7 predicate places. [2025-02-08 05:44:28,228 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 434 flow [2025-02-08 05:44:28,228 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-08 05:44:28,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:28,229 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-08 05:44:28,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 05:44:28,229 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-08 05:44:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash 215593852, now seen corresponding path program 1 times [2025-02-08 05:44:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766600617] [2025-02-08 05:44:28,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:44:28,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:44:28,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:28,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:28,339 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-08 05:44:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766600617] [2025-02-08 05:44:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766600617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:28,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404301857] [2025-02-08 05:44:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:28,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:28,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 173 [2025-02-08 05:44:28,411 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-08 05:44:28,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:28,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 173 [2025-02-08 05:44:28,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:35,076 INFO L124 PetriNetUnfolderBase]: 21685/51607 cut-off events. [2025-02-08 05:44:35,076 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2025-02-08 05:44:35,393 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 1961. Compared 586890 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-08 05:44:35,631 INFO L140 encePairwiseOnDemand]: 167/173 looper letters, 70 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2025-02-08 05:44:35,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 646 flow [2025-02-08 05:44:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:44:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:44:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-02-08 05:44:35,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8131021194605009 [2025-02-08 05:44:35,633 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 434 flow. Second operand 6 states and 844 transitions. [2025-02-08 05:44:35,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 646 flow [2025-02-08 05:44:35,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 207 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:35,641 INFO L231 Difference]: Finished difference. Result has 183 places, 175 transitions, 432 flow [2025-02-08 05:44:35,642 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-08 05:44:35,642 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2025-02-08 05:44:35,642 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 432 flow [2025-02-08 05:44:35,642 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-08 05:44:35,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:35,643 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-08 05:44:35,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 05:44:35,643 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-08 05:44:35,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1450809935, now seen corresponding path program 1 times [2025-02-08 05:44:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562989526] [2025-02-08 05:44:35,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:35,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:44:35,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:44:35,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:35,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:35,788 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-08 05:44:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562989526] [2025-02-08 05:44:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562989526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:35,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:44:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665496899] [2025-02-08 05:44:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:35,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:44:35,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:35,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:44:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:44:35,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2025-02-08 05:44:35,808 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-08 05:44:35,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:35,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2025-02-08 05:44:35,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:44:40,691 INFO L124 PetriNetUnfolderBase]: 13641/46120 cut-off events. [2025-02-08 05:44:40,691 INFO L125 PetriNetUnfolderBase]: For 11721/21100 co-relation queries the response was YES. [2025-02-08 05:44:40,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75500 conditions, 46120 events. 13641/46120 cut-off events. For 11721/21100 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 590273 event pairs, 7860 based on Foata normal form. 33/40396 useless extension candidates. Maximal degree in co-relation 62457. Up to 15890 conditions per place. [2025-02-08 05:44:41,280 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 39 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2025-02-08 05:44:41,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 618 flow [2025-02-08 05:44:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:44:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:44:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-02-08 05:44:41,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344894026974951 [2025-02-08 05:44:41,281 INFO L175 Difference]: Start difference. First operand has 183 places, 175 transitions, 432 flow. Second operand 3 states and 485 transitions. [2025-02-08 05:44:41,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 618 flow [2025-02-08 05:44:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:44:41,287 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 518 flow [2025-02-08 05:44:41,287 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-08 05:44:41,287 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2025-02-08 05:44:41,287 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 518 flow [2025-02-08 05:44:41,288 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-08 05:44:41,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:44:41,288 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-08 05:44:41,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 05:44:41,288 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-08 05:44:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:44:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1657785884, now seen corresponding path program 1 times [2025-02-08 05:44:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:44:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067264831] [2025-02-08 05:44:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:44:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:44:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:44:41,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:44:41,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:44:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:44:41,471 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-08 05:44:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:44:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067264831] [2025-02-08 05:44:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067264831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:44:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:44:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:44:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937391672] [2025-02-08 05:44:41,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:44:41,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:44:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:44:41,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:44:41,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:44:41,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 173 [2025-02-08 05:44:41,633 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-08 05:44:41,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:44:41,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 173 [2025-02-08 05:44:41,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand