./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-nondet.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:21:14,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:21:14,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:21:14,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:21:14,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:21:14,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:21:14,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:21:14,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:21:14,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:21:14,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:21:14,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:21:14,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:21:14,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:21:14,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:21:14,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:21:14,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:21:14,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:21:14,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:21:14,608 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2025-03-17 11:21:14,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:21:14,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:21:14,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:21:14,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:21:14,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:21:14,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-17 11:21:15,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3313c7c88/0beb3bf18f4349208facf6b84172457a/FLAGeb1970c0a [2025-03-17 11:21:16,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:21:16,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-17 11:21:16,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3313c7c88/0beb3bf18f4349208facf6b84172457a/FLAGeb1970c0a [2025-03-17 11:21:16,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3313c7c88/0beb3bf18f4349208facf6b84172457a [2025-03-17 11:21:16,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:21:16,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:21:16,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:21:16,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:21:16,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:21:16,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ec220b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16, skipping insertion in model container [2025-03-17 11:21:16,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:21:16,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:21:16,866 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:21:16,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:21:16,938 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:21:16,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16 WrapperNode [2025-03-17 11:21:16,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:21:16,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:21:16,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:21:16,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:21:16,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,965 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2025-03-17 11:21:16,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:21:16,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:21:16,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:21:16,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:21:16,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:21:16,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:21:16,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:21:16,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:21:16,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (1/1) ... [2025-03-17 11:21:16,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:21:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:21:17,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:21:17,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:21:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:21:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-17 11:21:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-17 11:21:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-17 11:21:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-17 11:21:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:21:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:21:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:21:17,030 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:21:17,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:21:17,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:21:17,253 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:21:17,253 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:21:17,264 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:21:17,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:21:17,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:21:17 BoogieIcfgContainer [2025-03-17 11:21:17,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:21:17,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:21:17,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:21:17,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:21:17,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:21:16" (1/3) ... [2025-03-17 11:21:17,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b819628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:21:17, skipping insertion in model container [2025-03-17 11:21:17,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:21:16" (2/3) ... [2025-03-17 11:21:17,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b819628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:21:17, skipping insertion in model container [2025-03-17 11:21:17,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:21:17" (3/3) ... [2025-03-17 11:21:17,272 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-03-17 11:21:17,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:21:17,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 102 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-17 11:21:17,284 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:21:17,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:17,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 108 transitions, 224 flow [2025-03-17 11:21:17,412 INFO L124 PetriNetUnfolderBase]: 10/157 cut-off events. [2025-03-17 11:21:17,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:17,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 10/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-03-17 11:21:17,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 108 transitions, 224 flow [2025-03-17 11:21:17,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 189 flow [2025-03-17 11:21:17,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:17,443 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:17,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-17 11:21:17,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:17,453 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:17,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:17,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:17,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 289542576, now seen corresponding path program 1 times [2025-03-17 11:21:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613399132] [2025-03-17 11:21:17,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613399132] [2025-03-17 11:21:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613399132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881107622] [2025-03-17 11:21:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:17,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:17,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:17,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:17,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2025-03-17 11:21:17,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:17,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:17,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2025-03-17 11:21:17,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:17,771 INFO L124 PetriNetUnfolderBase]: 11/147 cut-off events. [2025-03-17 11:21:17,772 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:21:17,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 147 events. 11/147 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 288 event pairs, 8 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 104. Up to 33 conditions per place. [2025-03-17 11:21:17,773 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 13 selfloop transitions, 2 changer transitions 1/88 dead transitions. [2025-03-17 11:21:17,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 213 flow [2025-03-17 11:21:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-17 11:21:17,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2025-03-17 11:21:17,787 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 189 flow. Second operand 3 states and 279 transitions. [2025-03-17 11:21:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 213 flow [2025-03-17 11:21:17,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:17,811 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 184 flow [2025-03-17 11:21:17,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-03-17 11:21:17,818 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2025-03-17 11:21:17,819 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 184 flow [2025-03-17 11:21:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:17,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,819 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] [2025-03-17 11:21:17,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:21:17,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1714215234, now seen corresponding path program 1 times [2025-03-17 11:21:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352060167] [2025-03-17 11:21:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:17,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352060167] [2025-03-17 11:21:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352060167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034352957] [2025-03-17 11:21:17,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:17,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:17,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:17,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2025-03-17 11:21:17,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:17,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:17,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2025-03-17 11:21:17,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:17,956 INFO L124 PetriNetUnfolderBase]: 7/129 cut-off events. [2025-03-17 11:21:17,956 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:21:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 129 events. 7/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 4 based on Foata normal form. 3/124 useless extension candidates. Maximal degree in co-relation 144. Up to 25 conditions per place. [2025-03-17 11:21:17,957 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 11 selfloop transitions, 1 changer transitions 24/82 dead transitions. [2025-03-17 11:21:17,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 202 flow [2025-03-17 11:21:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-03-17 11:21:17,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8271604938271605 [2025-03-17 11:21:17,958 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 184 flow. Second operand 3 states and 268 transitions. [2025-03-17 11:21:17,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 202 flow [2025-03-17 11:21:17,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:17,961 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 122 flow [2025-03-17 11:21:17,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2025-03-17 11:21:17,962 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2025-03-17 11:21:17,962 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 122 flow [2025-03-17 11:21:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:17,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:17,962 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 11:21:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:21:17,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1276401827, now seen corresponding path program 1 times [2025-03-17 11:21:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830954579] [2025-03-17 11:21:17,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:17,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:21:17,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:21:17,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:17,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830954579] [2025-03-17 11:21:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830954579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206585447] [2025-03-17 11:21:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:18,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:18,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2025-03-17 11:21:18,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2025-03-17 11:21:18,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,203 INFO L124 PetriNetUnfolderBase]: 2/86 cut-off events. [2025-03-17 11:21:18,204 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:21:18,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 86 events. 2/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 88. Up to 17 conditions per place. [2025-03-17 11:21:18,204 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 4/61 dead transitions. [2025-03-17 11:21:18,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 162 flow [2025-03-17 11:21:18,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2025-03-17 11:21:18,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2025-03-17 11:21:18,206 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 122 flow. Second operand 5 states and 448 transitions. [2025-03-17 11:21:18,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 162 flow [2025-03-17 11:21:18,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,208 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 127 flow [2025-03-17 11:21:18,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-17 11:21:18,209 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2025-03-17 11:21:18,209 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 127 flow [2025-03-17 11:21:18,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,209 INFO L206 CegarLoopForPetriNet]: trace histogram [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-03-17 11:21:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:21:18,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-17 11:21:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 835914261, now seen corresponding path program 1 times [2025-03-17 11:21:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665614667] [2025-03-17 11:21:18,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:21:18,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:21:18,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:18,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:21:18,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:21:18,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:18,264 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:18,265 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-17 11:21:18,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-17 11:21:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:21:18,268 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:18,269 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:18,269 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 11:21:18,299 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:18,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 308 flow [2025-03-17 11:21:18,325 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2025-03-17 11:21:18,325 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:21:18,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 220 events. 14/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 468 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 231. Up to 6 conditions per place. [2025-03-17 11:21:18,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 308 flow [2025-03-17 11:21:18,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 98 transitions, 209 flow [2025-03-17 11:21:18,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:18,332 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:18,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 11:21:18,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:18,333 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:18,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:18,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -945512016, now seen corresponding path program 1 times [2025-03-17 11:21:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70817970] [2025-03-17 11:21:18,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:18,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:18,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70817970] [2025-03-17 11:21:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70817970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91444819] [2025-03-17 11:21:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2025-03-17 11:21:18,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2025-03-17 11:21:18,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,463 INFO L124 PetriNetUnfolderBase]: 38/271 cut-off events. [2025-03-17 11:21:18,464 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 11:21:18,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 271 events. 38/271 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 909 event pairs, 34 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 188. Up to 83 conditions per place. [2025-03-17 11:21:18,467 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 15 selfloop transitions, 2 changer transitions 1/95 dead transitions. [2025-03-17 11:21:18,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 237 flow [2025-03-17 11:21:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-17 11:21:18,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2025-03-17 11:21:18,469 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 209 flow. Second operand 3 states and 368 transitions. [2025-03-17 11:21:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 237 flow [2025-03-17 11:21:18,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,470 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 204 flow [2025-03-17 11:21:18,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-03-17 11:21:18,471 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2025-03-17 11:21:18,471 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 204 flow [2025-03-17 11:21:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:21:18,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1018256062, now seen corresponding path program 1 times [2025-03-17 11:21:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750998130] [2025-03-17 11:21:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:18,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750998130] [2025-03-17 11:21:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750998130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130591953] [2025-03-17 11:21:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2025-03-17 11:21:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2025-03-17 11:21:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,559 INFO L124 PetriNetUnfolderBase]: 26/233 cut-off events. [2025-03-17 11:21:18,559 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:21:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 233 events. 26/233 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 708 event pairs, 22 based on Foata normal form. 7/223 useless extension candidates. Maximal degree in co-relation 300. Up to 63 conditions per place. [2025-03-17 11:21:18,562 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 13 selfloop transitions, 1 changer transitions 18/89 dead transitions. [2025-03-17 11:21:18,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 226 flow [2025-03-17 11:21:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-03-17 11:21:18,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-03-17 11:21:18,564 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 204 flow. Second operand 3 states and 351 transitions. [2025-03-17 11:21:18,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 226 flow [2025-03-17 11:21:18,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:18,565 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 154 flow [2025-03-17 11:21:18,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2025-03-17 11:21:18,565 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -6 predicate places. [2025-03-17 11:21:18,565 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 154 flow [2025-03-17 11:21:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,566 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:21:18,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:21:18,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash 987757325, now seen corresponding path program 1 times [2025-03-17 11:21:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252490354] [2025-03-17 11:21:18,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:21:18,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:21:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252490354] [2025-03-17 11:21:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252490354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604070789] [2025-03-17 11:21:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:18,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:18,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2025-03-17 11:21:18,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2025-03-17 11:21:18,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,716 INFO L124 PetriNetUnfolderBase]: 17/181 cut-off events. [2025-03-17 11:21:18,717 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:21:18,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 181 events. 17/181 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 428 event pairs, 17 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 224. Up to 51 conditions per place. [2025-03-17 11:21:18,717 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 13 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2025-03-17 11:21:18,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 204 flow [2025-03-17 11:21:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2025-03-17 11:21:18,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361111111111111 [2025-03-17 11:21:18,719 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 154 flow. Second operand 5 states and 602 transitions. [2025-03-17 11:21:18,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 204 flow [2025-03-17 11:21:18,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,720 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 149 flow [2025-03-17 11:21:18,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-17 11:21:18,721 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -20 predicate places. [2025-03-17 11:21:18,721 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 149 flow [2025-03-17 11:21:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,721 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 11:21:18,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:21:18,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-17 11:21:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash 85665903, now seen corresponding path program 1 times [2025-03-17 11:21:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623480917] [2025-03-17 11:21:18,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 11:21:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 11:21:18,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:18,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 11:21:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 11:21:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:18,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:18,757 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 11:21:18,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 11:21:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:21:18,758 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:18,758 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:18,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 11:21:18,789 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 180 transitions, 396 flow [2025-03-17 11:21:18,824 INFO L124 PetriNetUnfolderBase]: 18/283 cut-off events. [2025-03-17 11:21:18,825 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:21:18,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 283 events. 18/283 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 659 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 300. Up to 8 conditions per place. [2025-03-17 11:21:18,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 180 transitions, 396 flow [2025-03-17 11:21:18,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 105 transitions, 231 flow [2025-03-17 11:21:18,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:18,827 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:18,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-17 11:21:18,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:18,828 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:18,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:18,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1415588432, now seen corresponding path program 1 times [2025-03-17 11:21:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549275808] [2025-03-17 11:21:18,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:18,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:18,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549275808] [2025-03-17 11:21:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549275808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691445135] [2025-03-17 11:21:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2025-03-17 11:21:18,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2025-03-17 11:21:18,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:18,937 INFO L124 PetriNetUnfolderBase]: 115/517 cut-off events. [2025-03-17 11:21:18,937 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 11:21:18,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 517 events. 115/517 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2367 event pairs, 110 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 384. Up to 207 conditions per place. [2025-03-17 11:21:18,942 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 17 selfloop transitions, 2 changer transitions 1/102 dead transitions. [2025-03-17 11:21:18,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 263 flow [2025-03-17 11:21:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-17 11:21:18,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462962962962963 [2025-03-17 11:21:18,943 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 231 flow. Second operand 3 states and 457 transitions. [2025-03-17 11:21:18,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 263 flow [2025-03-17 11:21:18,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 260 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:18,947 INFO L231 Difference]: Finished difference. Result has 111 places, 101 transitions, 224 flow [2025-03-17 11:21:18,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2025-03-17 11:21:18,947 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2025-03-17 11:21:18,948 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 224 flow [2025-03-17 11:21:18,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:18,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:18,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:21:18,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2008605762, now seen corresponding path program 1 times [2025-03-17 11:21:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334178649] [2025-03-17 11:21:18,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:18,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:18,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:18,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:18,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:18,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334178649] [2025-03-17 11:21:18,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334178649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:18,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:18,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243135668] [2025-03-17 11:21:18,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:18,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:18,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:18,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:18,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2025-03-17 11:21:18,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:18,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:18,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2025-03-17 11:21:18,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,040 INFO L124 PetriNetUnfolderBase]: 83/435 cut-off events. [2025-03-17 11:21:19,040 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:21:19,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 435 events. 83/435 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1888 event pairs, 78 based on Foata normal form. 15/420 useless extension candidates. Maximal degree in co-relation 626. Up to 159 conditions per place. [2025-03-17 11:21:19,043 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 15 selfloop transitions, 1 changer transitions 18/96 dead transitions. [2025-03-17 11:21:19,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 250 flow [2025-03-17 11:21:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2025-03-17 11:21:19,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8037037037037037 [2025-03-17 11:21:19,044 INFO L175 Difference]: Start difference. First operand has 111 places, 101 transitions, 224 flow. Second operand 3 states and 434 transitions. [2025-03-17 11:21:19,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 250 flow [2025-03-17 11:21:19,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:19,046 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 174 flow [2025-03-17 11:21:19,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2025-03-17 11:21:19,046 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-03-17 11:21:19,047 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 78 transitions, 174 flow [2025-03-17 11:21:19,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,047 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:21:19,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -534391904, now seen corresponding path program 1 times [2025-03-17 11:21:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568564791] [2025-03-17 11:21:19,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:21:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:21:19,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568564791] [2025-03-17 11:21:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568564791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952523289] [2025-03-17 11:21:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:19,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:19,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2025-03-17 11:21:19,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 78 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2025-03-17 11:21:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,225 INFO L124 PetriNetUnfolderBase]: 61/332 cut-off events. [2025-03-17 11:21:19,225 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 11:21:19,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 332 events. 61/332 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1201 event pairs, 61 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 463. Up to 127 conditions per place. [2025-03-17 11:21:19,226 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 15 selfloop transitions, 2 changer transitions 10/82 dead transitions. [2025-03-17 11:21:19,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 82 transitions, 228 flow [2025-03-17 11:21:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2025-03-17 11:21:19,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8377777777777777 [2025-03-17 11:21:19,228 INFO L175 Difference]: Start difference. First operand has 105 places, 78 transitions, 174 flow. Second operand 5 states and 754 transitions. [2025-03-17 11:21:19,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 82 transitions, 228 flow [2025-03-17 11:21:19,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 82 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,229 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 169 flow [2025-03-17 11:21:19,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2025-03-17 11:21:19,230 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -20 predicate places. [2025-03-17 11:21:19,230 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 169 flow [2025-03-17 11:21:19,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,230 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:21:19,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-17 11:21:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2047140146, now seen corresponding path program 1 times [2025-03-17 11:21:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277095196] [2025-03-17 11:21:19,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:21:19,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:21:19,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:19,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:21:19,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:21:19,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:19,267 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:19,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-17 11:21:19,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-17 11:21:19,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-17 11:21:19,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-17 11:21:19,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:21:19,268 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:19,268 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:19,268 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 11:21:19,293 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:19,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 216 transitions, 488 flow [2025-03-17 11:21:19,312 INFO L124 PetriNetUnfolderBase]: 22/346 cut-off events. [2025-03-17 11:21:19,313 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 11:21:19,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 346 events. 22/346 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 867 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 370. Up to 10 conditions per place. [2025-03-17 11:21:19,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 216 transitions, 488 flow [2025-03-17 11:21:19,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 255 flow [2025-03-17 11:21:19,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:19,316 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:19,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-17 11:21:19,318 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:19,318 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:19,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:19,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1120686672, now seen corresponding path program 1 times [2025-03-17 11:21:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633181869] [2025-03-17 11:21:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:19,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:19,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633181869] [2025-03-17 11:21:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633181869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484322052] [2025-03-17 11:21:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 216 [2025-03-17 11:21:19,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 216 [2025-03-17 11:21:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,473 INFO L124 PetriNetUnfolderBase]: 316/1031 cut-off events. [2025-03-17 11:21:19,473 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-03-17 11:21:19,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1031 events. 316/1031 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5814 event pairs, 310 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 835. Up to 503 conditions per place. [2025-03-17 11:21:19,480 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 19 selfloop transitions, 2 changer transitions 1/109 dead transitions. [2025-03-17 11:21:19,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 109 transitions, 291 flow [2025-03-17 11:21:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2025-03-17 11:21:19,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2025-03-17 11:21:19,481 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 255 flow. Second operand 3 states and 546 transitions. [2025-03-17 11:21:19,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 109 transitions, 291 flow [2025-03-17 11:21:19,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 109 transitions, 284 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,483 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 244 flow [2025-03-17 11:21:19,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-03-17 11:21:19,483 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-03-17 11:21:19,483 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 244 flow [2025-03-17 11:21:19,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,485 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] [2025-03-17 11:21:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:21:19,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2090101182, now seen corresponding path program 1 times [2025-03-17 11:21:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339238619] [2025-03-17 11:21:19,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:19,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:19,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339238619] [2025-03-17 11:21:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339238619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092889156] [2025-03-17 11:21:19,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 216 [2025-03-17 11:21:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 216 [2025-03-17 11:21:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,621 INFO L124 PetriNetUnfolderBase]: 236/853 cut-off events. [2025-03-17 11:21:19,621 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:21:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 853 events. 236/853 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4542 event pairs, 230 based on Foata normal form. 31/837 useless extension candidates. Maximal degree in co-relation 1332. Up to 391 conditions per place. [2025-03-17 11:21:19,625 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 17 selfloop transitions, 1 changer transitions 18/103 dead transitions. [2025-03-17 11:21:19,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 274 flow [2025-03-17 11:21:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2025-03-17 11:21:19,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7978395061728395 [2025-03-17 11:21:19,626 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 244 flow. Second operand 3 states and 517 transitions. [2025-03-17 11:21:19,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 274 flow [2025-03-17 11:21:19,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:19,628 INFO L231 Difference]: Finished difference. Result has 114 places, 85 transitions, 194 flow [2025-03-17 11:21:19,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=114, PETRI_TRANSITIONS=85} [2025-03-17 11:21:19,628 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -6 predicate places. [2025-03-17 11:21:19,628 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 85 transitions, 194 flow [2025-03-17 11:21:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,629 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:21:19,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash 431457180, now seen corresponding path program 1 times [2025-03-17 11:21:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277538289] [2025-03-17 11:21:19,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:21:19,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:21:19,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277538289] [2025-03-17 11:21:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277538289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413215607] [2025-03-17 11:21:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:19,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:19,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2025-03-17 11:21:19,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 85 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2025-03-17 11:21:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:19,823 INFO L124 PetriNetUnfolderBase]: 181/655 cut-off events. [2025-03-17 11:21:19,824 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 11:21:19,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 655 events. 181/655 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3107 event pairs, 181 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 994. Up to 311 conditions per place. [2025-03-17 11:21:19,826 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 17 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2025-03-17 11:21:19,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 89 transitions, 252 flow [2025-03-17 11:21:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 906 transitions. [2025-03-17 11:21:19,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388888888888889 [2025-03-17 11:21:19,829 INFO L175 Difference]: Start difference. First operand has 114 places, 85 transitions, 194 flow. Second operand 5 states and 906 transitions. [2025-03-17 11:21:19,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 89 transitions, 252 flow [2025-03-17 11:21:19,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:19,831 INFO L231 Difference]: Finished difference. Result has 100 places, 79 transitions, 189 flow [2025-03-17 11:21:19,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=100, PETRI_TRANSITIONS=79} [2025-03-17 11:21:19,831 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -20 predicate places. [2025-03-17 11:21:19,831 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 79 transitions, 189 flow [2025-03-17 11:21:19,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,833 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:21:19,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-17 11:21:19,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2010891406, now seen corresponding path program 1 times [2025-03-17 11:21:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086401] [2025-03-17 11:21:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 11:21:19,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 11:21:19,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:19,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 11:21:19,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 11:21:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:19,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:19,865 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-17 11:21:19,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-17 11:21:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:21:19,867 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:19,867 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:19,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 11:21:19,907 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:19,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 252 transitions, 584 flow [2025-03-17 11:21:19,937 INFO L124 PetriNetUnfolderBase]: 26/409 cut-off events. [2025-03-17 11:21:19,938 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 11:21:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 409 events. 26/409 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1058 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 441. Up to 12 conditions per place. [2025-03-17 11:21:19,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 252 transitions, 584 flow [2025-03-17 11:21:19,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 119 transitions, 281 flow [2025-03-17 11:21:19,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:19,940 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:19,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:21:19,941 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:19,941 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:19,941 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:19,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:19,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:19,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -60806736, now seen corresponding path program 1 times [2025-03-17 11:21:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092131589] [2025-03-17 11:21:19,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:19,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:19,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:19,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:19,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092131589] [2025-03-17 11:21:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092131589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39908988] [2025-03-17 11:21:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:19,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:19,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 252 [2025-03-17 11:21:19,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:19,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:19,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 252 [2025-03-17 11:21:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:20,212 INFO L124 PetriNetUnfolderBase]: 813/2129 cut-off events. [2025-03-17 11:21:20,213 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2025-03-17 11:21:20,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 2129 events. 813/2129 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13780 event pairs, 806 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 1830. Up to 1191 conditions per place. [2025-03-17 11:21:20,231 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 21 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-03-17 11:21:20,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 116 transitions, 321 flow [2025-03-17 11:21:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-03-17 11:21:20,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83994708994709 [2025-03-17 11:21:20,235 INFO L175 Difference]: Start difference. First operand has 129 places, 119 transitions, 281 flow. Second operand 3 states and 635 transitions. [2025-03-17 11:21:20,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 116 transitions, 321 flow [2025-03-17 11:21:20,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 116 transitions, 308 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:20,238 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 264 flow [2025-03-17 11:21:20,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2025-03-17 11:21:20,239 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2025-03-17 11:21:20,240 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 264 flow [2025-03-17 11:21:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,240 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] [2025-03-17 11:21:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:21:20,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 429475006, now seen corresponding path program 1 times [2025-03-17 11:21:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435125145] [2025-03-17 11:21:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:20,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435125145] [2025-03-17 11:21:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435125145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233536919] [2025-03-17 11:21:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:20,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:20,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 252 [2025-03-17 11:21:20,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 252 [2025-03-17 11:21:20,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:20,462 INFO L124 PetriNetUnfolderBase]: 621/1743 cut-off events. [2025-03-17 11:21:20,462 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-17 11:21:20,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 1743 events. 621/1743 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10816 event pairs, 614 based on Foata normal form. 63/1738 useless extension candidates. Maximal degree in co-relation 2878. Up to 935 conditions per place. [2025-03-17 11:21:20,470 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 19 selfloop transitions, 1 changer transitions 18/110 dead transitions. [2025-03-17 11:21:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 110 transitions, 298 flow [2025-03-17 11:21:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-03-17 11:21:20,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2025-03-17 11:21:20,471 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 264 flow. Second operand 3 states and 600 transitions. [2025-03-17 11:21:20,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 110 transitions, 298 flow [2025-03-17 11:21:20,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 110 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:20,473 INFO L231 Difference]: Finished difference. Result has 123 places, 92 transitions, 214 flow [2025-03-17 11:21:20,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=123, PETRI_TRANSITIONS=92} [2025-03-17 11:21:20,473 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -6 predicate places. [2025-03-17 11:21:20,473 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 92 transitions, 214 flow [2025-03-17 11:21:20,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,474 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:20,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:21:20,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1322974273, now seen corresponding path program 1 times [2025-03-17 11:21:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236612716] [2025-03-17 11:21:20,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:21:20,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:21:20,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236612716] [2025-03-17 11:21:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236612716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460946249] [2025-03-17 11:21:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:20,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 252 [2025-03-17 11:21:20,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 92 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 252 [2025-03-17 11:21:20,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:20,737 INFO L124 PetriNetUnfolderBase]: 485/1354 cut-off events. [2025-03-17 11:21:20,737 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-03-17 11:21:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1354 events. 485/1354 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7672 event pairs, 485 based on Foata normal form. 1/1354 useless extension candidates. Maximal degree in co-relation 2173. Up to 743 conditions per place. [2025-03-17 11:21:20,745 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 19 selfloop transitions, 2 changer transitions 10/96 dead transitions. [2025-03-17 11:21:20,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 96 transitions, 276 flow [2025-03-17 11:21:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1058 transitions. [2025-03-17 11:21:20,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8396825396825397 [2025-03-17 11:21:20,747 INFO L175 Difference]: Start difference. First operand has 123 places, 92 transitions, 214 flow. Second operand 5 states and 1058 transitions. [2025-03-17 11:21:20,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 96 transitions, 276 flow [2025-03-17 11:21:20,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:20,749 INFO L231 Difference]: Finished difference. Result has 109 places, 86 transitions, 209 flow [2025-03-17 11:21:20,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=109, PETRI_TRANSITIONS=86} [2025-03-17 11:21:20,749 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -20 predicate places. [2025-03-17 11:21:20,749 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 209 flow [2025-03-17 11:21:20,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,750 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:20,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:21:20,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-17 11:21:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1079418011, now seen corresponding path program 1 times [2025-03-17 11:21:20,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041098951] [2025-03-17 11:21:20,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:21:20,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:21:20,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:20,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:20,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:21:20,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:21:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:20,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:20,779 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 11:21:20,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 11:21:20,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:21:20,780 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:20,781 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:20,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-17 11:21:20,816 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 288 transitions, 684 flow [2025-03-17 11:21:20,850 INFO L124 PetriNetUnfolderBase]: 30/472 cut-off events. [2025-03-17 11:21:20,850 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-17 11:21:20,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 472 events. 30/472 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1224 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 513. Up to 14 conditions per place. [2025-03-17 11:21:20,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 288 transitions, 684 flow [2025-03-17 11:21:20,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 309 flow [2025-03-17 11:21:20,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:20,853 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:20,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 11:21:20,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:20,855 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:20,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:20,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:20,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:20,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1764051376, now seen corresponding path program 1 times [2025-03-17 11:21:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301591102] [2025-03-17 11:21:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:20,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:20,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:20,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:20,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301591102] [2025-03-17 11:21:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301591102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139265553] [2025-03-17 11:21:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:20,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:20,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:20,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:20,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 288 [2025-03-17 11:21:20,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:20,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:20,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 288 [2025-03-17 11:21:20,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:21,292 INFO L124 PetriNetUnfolderBase]: 1998/4491 cut-off events. [2025-03-17 11:21:21,292 INFO L125 PetriNetUnfolderBase]: For 1165/1165 co-relation queries the response was YES. [2025-03-17 11:21:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7898 conditions, 4491 events. 1998/4491 cut-off events. For 1165/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 31841 event pairs, 1990 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 4009. Up to 2759 conditions per place. [2025-03-17 11:21:21,330 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 23 selfloop transitions, 2 changer transitions 1/123 dead transitions. [2025-03-17 11:21:21,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 123 transitions, 353 flow [2025-03-17 11:21:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-17 11:21:21,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8379629629629629 [2025-03-17 11:21:21,332 INFO L175 Difference]: Start difference. First operand has 138 places, 126 transitions, 309 flow. Second operand 3 states and 724 transitions. [2025-03-17 11:21:21,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 123 transitions, 353 flow [2025-03-17 11:21:21,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 123 transitions, 332 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:21,334 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 284 flow [2025-03-17 11:21:21,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2025-03-17 11:21:21,336 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2025-03-17 11:21:21,336 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 284 flow [2025-03-17 11:21:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:21,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:21,336 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] [2025-03-17 11:21:21,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:21:21,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:21,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1599450302, now seen corresponding path program 1 times [2025-03-17 11:21:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413091747] [2025-03-17 11:21:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:21,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:21,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:21,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413091747] [2025-03-17 11:21:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413091747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994304433] [2025-03-17 11:21:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:21,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:21,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:21,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:21,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 288 [2025-03-17 11:21:21,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:21,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:21,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 288 [2025-03-17 11:21:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:21,705 INFO L124 PetriNetUnfolderBase]: 1550/3657 cut-off events. [2025-03-17 11:21:21,705 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-17 11:21:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6294 conditions, 3657 events. 1550/3657 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 25062 event pairs, 1542 based on Foata normal form. 127/3691 useless extension candidates. Maximal degree in co-relation 6264. Up to 2183 conditions per place. [2025-03-17 11:21:21,720 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 21 selfloop transitions, 1 changer transitions 18/117 dead transitions. [2025-03-17 11:21:21,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 117 transitions, 322 flow [2025-03-17 11:21:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-17 11:21:21,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905092592592593 [2025-03-17 11:21:21,722 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 284 flow. Second operand 3 states and 683 transitions. [2025-03-17 11:21:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 117 transitions, 322 flow [2025-03-17 11:21:21,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:21,724 INFO L231 Difference]: Finished difference. Result has 132 places, 99 transitions, 234 flow [2025-03-17 11:21:21,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=132, PETRI_TRANSITIONS=99} [2025-03-17 11:21:21,726 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -6 predicate places. [2025-03-17 11:21:21,726 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 99 transitions, 234 flow [2025-03-17 11:21:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:21,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:21,727 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:21,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:21:21,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:21,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1528398129, now seen corresponding path program 1 times [2025-03-17 11:21:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:21,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229067279] [2025-03-17 11:21:21,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:21,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:21:21,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:21:21,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:21,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229067279] [2025-03-17 11:21:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229067279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:21,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614229992] [2025-03-17 11:21:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:21,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 288 [2025-03-17 11:21:21,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 99 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:21,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:21,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 288 [2025-03-17 11:21:21,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:22,099 INFO L124 PetriNetUnfolderBase]: 1221/2869 cut-off events. [2025-03-17 11:21:22,100 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-03-17 11:21:22,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4808 conditions, 2869 events. 1221/2869 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 18283 event pairs, 1221 based on Foata normal form. 1/2869 useless extension candidates. Maximal degree in co-relation 4776. Up to 1735 conditions per place. [2025-03-17 11:21:22,119 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 21 selfloop transitions, 2 changer transitions 10/103 dead transitions. [2025-03-17 11:21:22,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 103 transitions, 300 flow [2025-03-17 11:21:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1210 transitions. [2025-03-17 11:21:22,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8402777777777778 [2025-03-17 11:21:22,122 INFO L175 Difference]: Start difference. First operand has 132 places, 99 transitions, 234 flow. Second operand 5 states and 1210 transitions. [2025-03-17 11:21:22,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 103 transitions, 300 flow [2025-03-17 11:21:22,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 103 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:22,124 INFO L231 Difference]: Finished difference. Result has 118 places, 93 transitions, 229 flow [2025-03-17 11:21:22,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=118, PETRI_TRANSITIONS=93} [2025-03-17 11:21:22,125 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -20 predicate places. [2025-03-17 11:21:22,125 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 93 transitions, 229 flow [2025-03-17 11:21:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:22,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:22,125 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:22,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:21:22,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-17 11:21:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 140325001, now seen corresponding path program 1 times [2025-03-17 11:21:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322374416] [2025-03-17 11:21:22,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:22,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:22,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:21:22,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:21:22,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:22,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:22,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:22,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:21:22,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:21:22,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:22,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:22,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:22,176 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-17 11:21:22,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-17 11:21:22,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-17 11:21:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:21:22,178 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:22,178 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:22,178 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-17 11:21:22,222 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:22,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 324 transitions, 788 flow [2025-03-17 11:21:22,262 INFO L124 PetriNetUnfolderBase]: 34/535 cut-off events. [2025-03-17 11:21:22,264 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-17 11:21:22,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 535 events. 34/535 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1449 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 586. Up to 16 conditions per place. [2025-03-17 11:21:22,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 330 places, 324 transitions, 788 flow [2025-03-17 11:21:22,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 133 transitions, 339 flow [2025-03-17 11:21:22,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:22,268 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:22,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-17 11:21:22,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:22,270 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:22,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:22,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:22,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:22,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 58920368, now seen corresponding path program 1 times [2025-03-17 11:21:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:22,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338046755] [2025-03-17 11:21:22,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:22,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:22,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:22,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:22,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338046755] [2025-03-17 11:21:22,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338046755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:22,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:22,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048430515] [2025-03-17 11:21:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:22,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:22,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:22,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:22,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-17 11:21:22,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:22,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-17 11:21:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:23,266 INFO L124 PetriNetUnfolderBase]: 4751/9573 cut-off events. [2025-03-17 11:21:23,266 INFO L125 PetriNetUnfolderBase]: For 3091/3091 co-relation queries the response was YES. [2025-03-17 11:21:23,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17269 conditions, 9573 events. 4751/9573 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 72448 event pairs, 4742 based on Foata normal form. 1/9425 useless extension candidates. Maximal degree in co-relation 8748. Up to 6279 conditions per place. [2025-03-17 11:21:23,341 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 25 selfloop transitions, 2 changer transitions 1/130 dead transitions. [2025-03-17 11:21:23,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 387 flow [2025-03-17 11:21:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-03-17 11:21:23,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364197530864198 [2025-03-17 11:21:23,343 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 339 flow. Second operand 3 states and 813 transitions. [2025-03-17 11:21:23,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 387 flow [2025-03-17 11:21:23,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 130 transitions, 356 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:23,346 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 304 flow [2025-03-17 11:21:23,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2025-03-17 11:21:23,346 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-03-17 11:21:23,346 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 304 flow [2025-03-17 11:21:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:23,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:23,346 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] [2025-03-17 11:21:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:21:23,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1305059774, now seen corresponding path program 1 times [2025-03-17 11:21:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35396159] [2025-03-17 11:21:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:23,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:23,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:23,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-03-17 11:21:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35396159] [2025-03-17 11:21:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35396159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093767840] [2025-03-17 11:21:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:23,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:23,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:23,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 324 [2025-03-17 11:21:23,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:23,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:23,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 324 [2025-03-17 11:21:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:24,053 INFO L124 PetriNetUnfolderBase]: 3727/7779 cut-off events. [2025-03-17 11:21:24,054 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-17 11:21:24,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13681 conditions, 7779 events. 3727/7779 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 57212 event pairs, 3718 based on Foata normal form. 255/7912 useless extension candidates. Maximal degree in co-relation 13650. Up to 4999 conditions per place. [2025-03-17 11:21:24,108 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 23 selfloop transitions, 1 changer transitions 18/124 dead transitions. [2025-03-17 11:21:24,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 124 transitions, 346 flow [2025-03-17 11:21:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2025-03-17 11:21:24,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-17 11:21:24,111 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 304 flow. Second operand 3 states and 766 transitions. [2025-03-17 11:21:24,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 124 transitions, 346 flow [2025-03-17 11:21:24,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 124 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:24,113 INFO L231 Difference]: Finished difference. Result has 141 places, 106 transitions, 254 flow [2025-03-17 11:21:24,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=141, PETRI_TRANSITIONS=106} [2025-03-17 11:21:24,113 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -6 predicate places. [2025-03-17 11:21:24,114 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 106 transitions, 254 flow [2025-03-17 11:21:24,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:24,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:24,114 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:21:24,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1323080838, now seen corresponding path program 1 times [2025-03-17 11:21:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2205558] [2025-03-17 11:21:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:24,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:21:24,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:21:24,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:24,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2205558] [2025-03-17 11:21:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2205558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:24,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:24,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563701318] [2025-03-17 11:21:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:24,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:24,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:24,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 324 [2025-03-17 11:21:24,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 106 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:24,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:24,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 324 [2025-03-17 11:21:24,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:24,892 INFO L124 PetriNetUnfolderBase]: 2949/6144 cut-off events. [2025-03-17 11:21:24,892 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-03-17 11:21:24,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10516 conditions, 6144 events. 2949/6144 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 42735 event pairs, 2949 based on Foata normal form. 1/6137 useless extension candidates. Maximal degree in co-relation 10483. Up to 3975 conditions per place. [2025-03-17 11:21:24,938 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 23 selfloop transitions, 2 changer transitions 10/110 dead transitions. [2025-03-17 11:21:24,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 110 transitions, 324 flow [2025-03-17 11:21:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1362 transitions. [2025-03-17 11:21:24,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2025-03-17 11:21:24,941 INFO L175 Difference]: Start difference. First operand has 141 places, 106 transitions, 254 flow. Second operand 5 states and 1362 transitions. [2025-03-17 11:21:24,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 110 transitions, 324 flow [2025-03-17 11:21:24,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 110 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:24,943 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 249 flow [2025-03-17 11:21:24,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2025-03-17 11:21:24,943 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -20 predicate places. [2025-03-17 11:21:24,943 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 249 flow [2025-03-17 11:21:24,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 269.6) internal successors, (1348), 5 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:24,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:24,944 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:21:24,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-17 11:21:24,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1576422020, now seen corresponding path program 1 times [2025-03-17 11:21:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630643724] [2025-03-17 11:21:24,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:24,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:21:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:21:24,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:24,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:24,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:24,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:21:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:21:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:24,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:24,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:24,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-17 11:21:24,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-17 11:21:24,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-17 11:21:24,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:21:24,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:24,984 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:24,984 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-17 11:21:25,038 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:25,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 360 transitions, 896 flow [2025-03-17 11:21:25,084 INFO L124 PetriNetUnfolderBase]: 38/598 cut-off events. [2025-03-17 11:21:25,084 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-17 11:21:25,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 598 events. 38/598 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1589 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 660. Up to 18 conditions per place. [2025-03-17 11:21:25,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 360 transitions, 896 flow [2025-03-17 11:21:25,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 140 transitions, 371 flow [2025-03-17 11:21:25,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:25,088 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:25,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 11:21:25,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:25,089 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:25,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:25,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:25,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:25,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:25,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash -881232464, now seen corresponding path program 1 times [2025-03-17 11:21:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497987348] [2025-03-17 11:21:25,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:25,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497987348] [2025-03-17 11:21:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497987348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344454497] [2025-03-17 11:21:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:25,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:25,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:25,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 360 [2025-03-17 11:21:25,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 140 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:25,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:25,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 360 [2025-03-17 11:21:25,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:26,890 INFO L124 PetriNetUnfolderBase]: 11024/20479 cut-off events. [2025-03-17 11:21:26,890 INFO L125 PetriNetUnfolderBase]: For 7962/7962 co-relation queries the response was YES. [2025-03-17 11:21:27,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37648 conditions, 20479 events. 11024/20479 cut-off events. For 7962/7962 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 164283 event pairs, 11014 based on Foata normal form. 1/20295 useless extension candidates. Maximal degree in co-relation 18991. Up to 14087 conditions per place. [2025-03-17 11:21:27,098 INFO L140 encePairwiseOnDemand]: 355/360 looper letters, 27 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-03-17 11:21:27,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 423 flow [2025-03-17 11:21:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-17 11:21:27,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351851851851851 [2025-03-17 11:21:27,101 INFO L175 Difference]: Start difference. First operand has 156 places, 140 transitions, 371 flow. Second operand 3 states and 902 transitions. [2025-03-17 11:21:27,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 423 flow [2025-03-17 11:21:27,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 137 transitions, 380 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:27,106 INFO L231 Difference]: Finished difference. Result has 156 places, 136 transitions, 324 flow [2025-03-17 11:21:27,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=156, PETRI_TRANSITIONS=136} [2025-03-17 11:21:27,106 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 0 predicate places. [2025-03-17 11:21:27,106 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 136 transitions, 324 flow [2025-03-17 11:21:27,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:27,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:27,107 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] [2025-03-17 11:21:27,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:21:27,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:27,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash -453696578, now seen corresponding path program 1 times [2025-03-17 11:21:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614243196] [2025-03-17 11:21:27,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:27,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:27,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:27,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:27,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614243196] [2025-03-17 11:21:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614243196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:27,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966722] [2025-03-17 11:21:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:27,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:27,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:27,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:27,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 360 [2025-03-17 11:21:27,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 136 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:27,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:27,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 360 [2025-03-17 11:21:27,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:28,930 INFO L124 PetriNetUnfolderBase]: 8720/16637 cut-off events. [2025-03-17 11:21:28,930 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2025-03-17 11:21:29,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29708 conditions, 16637 events. 8720/16637 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 129730 event pairs, 8710 based on Foata normal form. 511/16993 useless extension candidates. Maximal degree in co-relation 29676. Up to 11271 conditions per place. [2025-03-17 11:21:29,055 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 25 selfloop transitions, 1 changer transitions 18/131 dead transitions. [2025-03-17 11:21:29,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 131 transitions, 370 flow [2025-03-17 11:21:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-03-17 11:21:29,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2025-03-17 11:21:29,057 INFO L175 Difference]: Start difference. First operand has 156 places, 136 transitions, 324 flow. Second operand 3 states and 849 transitions. [2025-03-17 11:21:29,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 131 transitions, 370 flow [2025-03-17 11:21:29,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 131 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:29,062 INFO L231 Difference]: Finished difference. Result has 150 places, 113 transitions, 274 flow [2025-03-17 11:21:29,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=150, PETRI_TRANSITIONS=113} [2025-03-17 11:21:29,062 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -6 predicate places. [2025-03-17 11:21:29,062 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 113 transitions, 274 flow [2025-03-17 11:21:29,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:29,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:29,063 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:29,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:21:29,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 940062374, now seen corresponding path program 1 times [2025-03-17 11:21:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015013028] [2025-03-17 11:21:29,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:29,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:21:29,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:21:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:29,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015013028] [2025-03-17 11:21:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015013028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:29,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:29,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340671293] [2025-03-17 11:21:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:29,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:29,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:29,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:29,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:29,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 360 [2025-03-17 11:21:29,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 113 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 299.8) internal successors, (1499), 5 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:29,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:29,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 360 [2025-03-17 11:21:29,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:30,587 INFO L124 PetriNetUnfolderBase]: 6917/13195 cut-off events. [2025-03-17 11:21:30,587 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-03-17 11:21:30,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22944 conditions, 13195 events. 6917/13195 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 98224 event pairs, 6917 based on Foata normal form. 1/13187 useless extension candidates. Maximal degree in co-relation 22910. Up to 8967 conditions per place. [2025-03-17 11:21:30,651 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 25 selfloop transitions, 2 changer transitions 10/117 dead transitions. [2025-03-17 11:21:30,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 117 transitions, 348 flow [2025-03-17 11:21:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1514 transitions. [2025-03-17 11:21:30,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411111111111111 [2025-03-17 11:21:30,653 INFO L175 Difference]: Start difference. First operand has 150 places, 113 transitions, 274 flow. Second operand 5 states and 1514 transitions. [2025-03-17 11:21:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 117 transitions, 348 flow [2025-03-17 11:21:30,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 117 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:30,654 INFO L231 Difference]: Finished difference. Result has 136 places, 107 transitions, 269 flow [2025-03-17 11:21:30,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=136, PETRI_TRANSITIONS=107} [2025-03-17 11:21:30,655 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -20 predicate places. [2025-03-17 11:21:30,655 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 107 transitions, 269 flow [2025-03-17 11:21:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 299.8) internal successors, (1499), 5 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:30,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:30,655 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:30,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:21:30,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-17 11:21:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 959494580, now seen corresponding path program 1 times [2025-03-17 11:21:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806803988] [2025-03-17 11:21:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:30,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 11:21:30,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 11:21:30,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:30,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:30,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:30,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 11:21:30,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 11:21:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:30,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:30,685 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-17 11:21:30,685 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-17 11:21:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-17 11:21:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:21:30,686 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:30,687 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:30,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-17 11:21:30,726 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:30,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 404 places, 396 transitions, 1008 flow [2025-03-17 11:21:30,758 INFO L124 PetriNetUnfolderBase]: 42/661 cut-off events. [2025-03-17 11:21:30,758 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-17 11:21:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 661 events. 42/661 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1789 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 735. Up to 20 conditions per place. [2025-03-17 11:21:30,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 404 places, 396 transitions, 1008 flow [2025-03-17 11:21:30,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 147 transitions, 405 flow [2025-03-17 11:21:30,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:30,763 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:30,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 11:21:30,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:30,763 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:30,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:30,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:30,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:30,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1056407120, now seen corresponding path program 1 times [2025-03-17 11:21:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911565064] [2025-03-17 11:21:30,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:30,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:30,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:30,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:30,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911565064] [2025-03-17 11:21:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911565064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:30,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:30,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037631018] [2025-03-17 11:21:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:30,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:30,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:30,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:30,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 396 [2025-03-17 11:21:30,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 147 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:30,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:30,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 396 [2025-03-17 11:21:30,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:35,287 INFO L124 PetriNetUnfolderBase]: 25105/43801 cut-off events. [2025-03-17 11:21:35,287 INFO L125 PetriNetUnfolderBase]: For 20002/20002 co-relation queries the response was YES. [2025-03-17 11:21:35,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81707 conditions, 43801 events. 25105/43801 cut-off events. For 20002/20002 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 366542 event pairs, 25094 based on Foata normal form. 1/43577 useless extension candidates. Maximal degree in co-relation 41010. Up to 31239 conditions per place. [2025-03-17 11:21:35,725 INFO L140 encePairwiseOnDemand]: 391/396 looper letters, 29 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2025-03-17 11:21:35,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 144 transitions, 461 flow [2025-03-17 11:21:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2025-03-17 11:21:35,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8341750841750841 [2025-03-17 11:21:35,727 INFO L175 Difference]: Start difference. First operand has 165 places, 147 transitions, 405 flow. Second operand 3 states and 991 transitions. [2025-03-17 11:21:35,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 144 transitions, 461 flow [2025-03-17 11:21:35,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 144 transitions, 404 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:35,732 INFO L231 Difference]: Finished difference. Result has 165 places, 143 transitions, 344 flow [2025-03-17 11:21:35,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=165, PETRI_TRANSITIONS=143} [2025-03-17 11:21:35,733 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 0 predicate places. [2025-03-17 11:21:35,733 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 143 transitions, 344 flow [2025-03-17 11:21:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:35,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:35,733 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] [2025-03-17 11:21:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:21:35,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 618148542, now seen corresponding path program 1 times [2025-03-17 11:21:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110559197] [2025-03-17 11:21:35,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:35,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:21:35,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:21:35,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:35,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110559197] [2025-03-17 11:21:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110559197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:35,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:35,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392547580] [2025-03-17 11:21:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:35,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:35,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:35,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:35,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:35,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 396 [2025-03-17 11:21:35,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:35,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:35,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 396 [2025-03-17 11:21:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:39,312 INFO L124 PetriNetUnfolderBase]: 19985/35607 cut-off events. [2025-03-17 11:21:39,312 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-03-17 11:21:39,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64295 conditions, 35607 events. 19985/35607 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 290842 event pairs, 19974 based on Foata normal form. 1023/36438 useless extension candidates. Maximal degree in co-relation 64262. Up to 25095 conditions per place. [2025-03-17 11:21:39,592 INFO L140 encePairwiseOnDemand]: 390/396 looper letters, 27 selfloop transitions, 1 changer transitions 18/138 dead transitions. [2025-03-17 11:21:39,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 138 transitions, 394 flow [2025-03-17 11:21:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:21:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:21:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2025-03-17 11:21:39,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7845117845117845 [2025-03-17 11:21:39,594 INFO L175 Difference]: Start difference. First operand has 165 places, 143 transitions, 344 flow. Second operand 3 states and 932 transitions. [2025-03-17 11:21:39,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 138 transitions, 394 flow [2025-03-17 11:21:39,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 138 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:21:39,596 INFO L231 Difference]: Finished difference. Result has 159 places, 120 transitions, 294 flow [2025-03-17 11:21:39,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=159, PETRI_TRANSITIONS=120} [2025-03-17 11:21:39,596 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -6 predicate places. [2025-03-17 11:21:39,596 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 120 transitions, 294 flow [2025-03-17 11:21:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:39,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:39,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:21:39,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1234730607, now seen corresponding path program 1 times [2025-03-17 11:21:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627756460] [2025-03-17 11:21:39,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 11:21:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 11:21:39,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627756460] [2025-03-17 11:21:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627756460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:21:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903902885] [2025-03-17 11:21:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:39,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:21:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:39,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:21:39,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:21:39,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 396 [2025-03-17 11:21:39,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 120 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:39,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:39,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 396 [2025-03-17 11:21:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:21:42,478 INFO L124 PetriNetUnfolderBase]: 15877/28310 cut-off events. [2025-03-17 11:21:42,478 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2025-03-17 11:21:42,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49836 conditions, 28310 events. 15877/28310 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 221663 event pairs, 15877 based on Foata normal form. 1/28301 useless extension candidates. Maximal degree in co-relation 49801. Up to 19975 conditions per place. [2025-03-17 11:21:42,775 INFO L140 encePairwiseOnDemand]: 390/396 looper letters, 27 selfloop transitions, 2 changer transitions 10/124 dead transitions. [2025-03-17 11:21:42,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 124 transitions, 372 flow [2025-03-17 11:21:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:21:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:21:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1666 transitions. [2025-03-17 11:21:42,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8414141414141414 [2025-03-17 11:21:42,778 INFO L175 Difference]: Start difference. First operand has 159 places, 120 transitions, 294 flow. Second operand 5 states and 1666 transitions. [2025-03-17 11:21:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 124 transitions, 372 flow [2025-03-17 11:21:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 124 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:21:42,780 INFO L231 Difference]: Finished difference. Result has 145 places, 114 transitions, 289 flow [2025-03-17 11:21:42,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=145, PETRI_TRANSITIONS=114} [2025-03-17 11:21:42,780 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -20 predicate places. [2025-03-17 11:21:42,780 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 114 transitions, 289 flow [2025-03-17 11:21:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:42,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:42,781 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:21:42,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-17 11:21:42,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1688574833, now seen corresponding path program 1 times [2025-03-17 11:21:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273010031] [2025-03-17 11:21:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:42,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 11:21:42,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:21:42,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:42,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:42,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:21:42,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 11:21:42,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 11:21:42,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:42,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:21:42,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:21:42,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:21:42,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-17 11:21:42,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-17 11:21:42,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-17 11:21:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:21:42,987 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:21:42,987 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 11:21:42,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-03-17 11:21:43,036 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:21:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 441 places, 432 transitions, 1124 flow [2025-03-17 11:21:43,083 INFO L124 PetriNetUnfolderBase]: 46/724 cut-off events. [2025-03-17 11:21:43,083 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-17 11:21:43,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 724 events. 46/724 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1979 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 811. Up to 22 conditions per place. [2025-03-17 11:21:43,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 441 places, 432 transitions, 1124 flow [2025-03-17 11:21:43,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 154 transitions, 441 flow [2025-03-17 11:21:43,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:21:43,088 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;@47c6023a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:21:43,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 11:21:43,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:21:43,089 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-17 11:21:43,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:21:43,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:21:43,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:21:43,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-17 11:21:43,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:21:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -466603600, now seen corresponding path program 1 times [2025-03-17 11:21:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:21:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143116706] [2025-03-17 11:21:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:21:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:21:43,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:21:43,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:21:43,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:21:43,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:21:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:21:43,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:21:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143116706] [2025-03-17 11:21:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143116706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:21:43,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:21:43,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:21:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763467619] [2025-03-17 11:21:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:21:43,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:21:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:21:43,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:21:43,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:21:43,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 432 [2025-03-17 11:21:43,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 154 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:21:43,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:21:43,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 432 [2025-03-17 11:21:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand