./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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-ext/45_monabsex1_vs.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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:27:33,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:27:33,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:27:33,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:27:33,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:27:33,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:27:33,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:27:33,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:27:33,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:27:33,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:27:33,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:27:33,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:27:33,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:27:33,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:27:33,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:27:33,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:27:33,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:27:33,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:27:33,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:27:33,543 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2025-03-04 06:27:33,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:27:33,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:27:33,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:27:33,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:27:33,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:27:33,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 06:27:35,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e1db610/ee01838dc1a540059becaafe6a66d3b9/FLAG39ca474c5 [2025-03-04 06:27:35,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:27:35,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2025-03-04 06:27:35,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e1db610/ee01838dc1a540059becaafe6a66d3b9/FLAG39ca474c5 [2025-03-04 06:27:35,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e1db610/ee01838dc1a540059becaafe6a66d3b9 [2025-03-04 06:27:35,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:27:35,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:27:35,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:27:35,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:27:35,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:27:35,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35, skipping insertion in model container [2025-03-04 06:27:35,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:27:35,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:27:35,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:27:35,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:27:35,724 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:27:35,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35 WrapperNode [2025-03-04 06:27:35,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:27:35,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:27:35,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:27:35,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:27:35,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,754 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-04 06:27:35,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:27:35,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:27:35,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:27:35,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:27:35,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:27:35,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:27:35,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:27:35,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:27:35,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (1/1) ... [2025-03-04 06:27:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:27:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:27:35,808 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-04 06:27:35,811 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-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:27:35,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:27:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:27:35,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:27:35,830 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:27:35,916 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:27:35,918 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:27:36,014 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:27:36,014 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:27:36,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:27:36,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:27:36,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:27:36 BoogieIcfgContainer [2025-03-04 06:27:36,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:27:36,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:27:36,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:27:36,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:27:36,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:27:35" (1/3) ... [2025-03-04 06:27:36,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13309fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:27:36, skipping insertion in model container [2025-03-04 06:27:36,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:27:35" (2/3) ... [2025-03-04 06:27:36,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13309fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:27:36, skipping insertion in model container [2025-03-04 06:27:36,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:27:36" (3/3) ... [2025-03-04 06:27:36,057 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-03-04 06:27:36,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:27:36,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-04 06:27:36,070 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:27:36,106 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:36,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 84 flow [2025-03-04 06:27:36,165 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-04 06:27:36,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:36,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 06:27:36,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 84 flow [2025-03-04 06:27:36,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 84 flow [2025-03-04 06:27:36,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:36,192 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:36,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 06:27:36,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:36,202 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:36,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:36,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:36,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 06:27:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash -937087091, now seen corresponding path program 1 times [2025-03-04 06:27:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939680959] [2025-03-04 06:27:36,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:36,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:36,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:36,381 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-04 06:27:36,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939680959] [2025-03-04 06:27:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939680959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646242410] [2025-03-04 06:27:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:36,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:36,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:36,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:36,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:36,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 40 [2025-03-04 06:27:36,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-04 06:27:36,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:36,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 40 [2025-03-04 06:27:36,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:36,471 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-04 06:27:36,472 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:27:36,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 0/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 4/40 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-04 06:27:36,473 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 6 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-04 06:27:36,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 86 flow [2025-03-04 06:27:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 06:27:36,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.775 [2025-03-04 06:27:36,484 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 84 flow. Second operand 3 states and 93 transitions. [2025-03-04 06:27:36,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 86 flow [2025-03-04 06:27:36,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:36,490 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 74 flow [2025-03-04 06:27:36,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 06:27:36,496 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-03-04 06:27:36,497 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 74 flow [2025-03-04 06:27:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-04 06:27:36,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,498 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:36,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:27:36,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 06:27:36,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1868936967, now seen corresponding path program 1 times [2025-03-04 06:27:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413845499] [2025-03-04 06:27:36,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 06:27:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 06:27:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:36,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:36,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 06:27:36,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 06:27:36,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:36,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:36,561 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:36,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-04 06:27:36,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-04 06:27:36,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-04 06:27:36,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-04 06:27:36,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-04 06:27:36,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-04 06:27:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:27:36,564 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:36,566 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:36,566 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:27:36,589 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:36,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 116 flow [2025-03-04 06:27:36,602 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-03-04 06:27:36,602 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:27:36,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 67 events. 0/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-03-04 06:27:36,602 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 53 transitions, 116 flow [2025-03-04 06:27:36,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 53 transitions, 116 flow [2025-03-04 06:27:36,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:36,604 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:36,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 06:27:36,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:36,607 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:36,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:36,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:36,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:27:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 165287266, now seen corresponding path program 1 times [2025-03-04 06:27:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-03-04 06:27:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:36,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:36,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:36,655 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-04 06:27:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652213142] [2025-03-04 06:27:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652213142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:36,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180060895] [2025-03-04 06:27:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:36,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:36,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:36,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 53 [2025-03-04 06:27:36,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-04 06:27:36,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:36,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 53 [2025-03-04 06:27:36,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:36,731 INFO L124 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-03-04 06:27:36,731 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:27:36,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 80 events. 6/80 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 6 based on Foata normal form. 13/91 useless extension candidates. Maximal degree in co-relation 31. Up to 22 conditions per place. [2025-03-04 06:27:36,733 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-03-04 06:27:36,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 120 flow [2025-03-04 06:27:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-04 06:27:36,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7672955974842768 [2025-03-04 06:27:36,735 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 116 flow. Second operand 3 states and 122 transitions. [2025-03-04 06:27:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 120 flow [2025-03-04 06:27:36,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:36,736 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 102 flow [2025-03-04 06:27:36,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-04 06:27:36,737 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-04 06:27:36,737 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 102 flow [2025-03-04 06:27:36,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-04 06:27:36,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,737 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:36,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:27:36,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:27:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1200795982, now seen corresponding path program 1 times [2025-03-04 06:27:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-03-04 06:27:36,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:27:36,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:27:36,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:36,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:36,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:27:36,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:27:36,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:36,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:36,780 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:36,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-04 06:27:36,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-04 06:27:36,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:27:36,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:36,782 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:36,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:27:36,801 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 150 flow [2025-03-04 06:27:36,813 INFO L124 PetriNetUnfolderBase]: 0/87 cut-off events. [2025-03-04 06:27:36,813 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:27:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 87 events. 0/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-03-04 06:27:36,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 150 flow [2025-03-04 06:27:36,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 66 transitions, 150 flow [2025-03-04 06:27:36,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:36,815 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:36,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:27:36,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:36,821 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:36,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:36,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:36,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 06:27:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1619092452, now seen corresponding path program 1 times [2025-03-04 06:27:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183982463] [2025-03-04 06:27:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:36,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:36,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:36,870 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-04 06:27:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183982463] [2025-03-04 06:27:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183982463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:36,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421774910] [2025-03-04 06:27:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:36,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:36,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:36,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:36,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 66 [2025-03-04 06:27:36,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-04 06:27:36,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:36,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 66 [2025-03-04 06:27:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:36,967 INFO L124 PetriNetUnfolderBase]: 42/219 cut-off events. [2025-03-04 06:27:36,967 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 06:27:36,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 219 events. 42/219 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 975 event pairs, 42 based on Foata normal form. 40/248 useless extension candidates. Maximal degree in co-relation 112. Up to 85 conditions per place. [2025-03-04 06:27:36,969 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 12 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-04 06:27:36,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 156 flow [2025-03-04 06:27:36,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-04 06:27:36,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7626262626262627 [2025-03-04 06:27:36,971 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 150 flow. Second operand 3 states and 151 transitions. [2025-03-04 06:27:36,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 156 flow [2025-03-04 06:27:36,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 154 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:36,973 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-03-04 06:27:36,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-04 06:27:36,973 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2025-03-04 06:27:36,974 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-03-04 06:27:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-04 06:27:36,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:36,974 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:27:36,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-04 06:27:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1029731378, now seen corresponding path program 1 times [2025-03-04 06:27:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883233096] [2025-03-04 06:27:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:36,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:27:36,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:27:36,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:36,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:27:36,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:27:36,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:36,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:37,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:37,000 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:27:37,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:27:37,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:27:37,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:27:37,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:27:37,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:27:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:27:37,001 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:37,001 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:37,002 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:27:37,021 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:37,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 79 transitions, 186 flow [2025-03-04 06:27:37,040 INFO L124 PetriNetUnfolderBase]: 0/107 cut-off events. [2025-03-04 06:27:37,040 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:27:37,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 107 events. 0/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 244 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-03-04 06:27:37,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 79 transitions, 186 flow [2025-03-04 06:27:37,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 79 transitions, 186 flow [2025-03-04 06:27:37,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:37,043 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:37,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 06:27:37,047 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:37,047 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:37,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:37,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:37,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:37,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 06:27:37,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash -870638829, now seen corresponding path program 1 times [2025-03-04 06:27:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613764625] [2025-03-04 06:27:37,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:37,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:37,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:37,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:37,087 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-04 06:27:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613764625] [2025-03-04 06:27:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613764625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979813058] [2025-03-04 06:27:37,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:37,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:37,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:37,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 79 [2025-03-04 06:27:37,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-04 06:27:37,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:37,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 79 [2025-03-04 06:27:37,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:37,274 INFO L124 PetriNetUnfolderBase]: 204/680 cut-off events. [2025-03-04 06:27:37,274 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-03-04 06:27:37,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 680 events. 204/680 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4446 event pairs, 204 based on Foata normal form. 121/759 useless extension candidates. Maximal degree in co-relation 348. Up to 328 conditions per place. [2025-03-04 06:27:37,279 INFO L140 encePairwiseOnDemand]: 67/79 looper letters, 15 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-03-04 06:27:37,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 194 flow [2025-03-04 06:27:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-04 06:27:37,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.759493670886076 [2025-03-04 06:27:37,283 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 186 flow. Second operand 3 states and 180 transitions. [2025-03-04 06:27:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 194 flow [2025-03-04 06:27:37,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 188 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:37,286 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 158 flow [2025-03-04 06:27:37,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-03-04 06:27:37,286 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -11 predicate places. [2025-03-04 06:27:37,286 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 158 flow [2025-03-04 06:27:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-04 06:27:37,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:37,287 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:27:37,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 06:27:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -992367161, now seen corresponding path program 1 times [2025-03-04 06:27:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:37,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061765426] [2025-03-04 06:27:37,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:37,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:27:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:27:37,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:37,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:37,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:27:37,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:27:37,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:37,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:37,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-04 06:27:37,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-04 06:27:37,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-04 06:27:37,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-04 06:27:37,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-04 06:27:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:27:37,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:37,319 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:37,319 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 06:27:37,355 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:37,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 92 transitions, 224 flow [2025-03-04 06:27:37,367 INFO L124 PetriNetUnfolderBase]: 0/127 cut-off events. [2025-03-04 06:27:37,367 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:27:37,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 127 events. 0/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 321 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-03-04 06:27:37,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 92 transitions, 224 flow [2025-03-04 06:27:37,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 92 transitions, 224 flow [2025-03-04 06:27:37,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:37,370 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:37,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:27:37,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:37,371 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:37,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:37,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:37,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:37,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-04 06:27:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1286028015, now seen corresponding path program 1 times [2025-03-04 06:27:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550223140] [2025-03-04 06:27:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:37,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:37,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:37,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:37,395 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-04 06:27:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:37,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550223140] [2025-03-04 06:27:37,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550223140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:37,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:37,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:37,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316018970] [2025-03-04 06:27:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:37,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:37,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:37,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:37,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:37,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2025-03-04 06:27:37,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-04 06:27:37,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:37,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2025-03-04 06:27:37,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:37,683 INFO L124 PetriNetUnfolderBase]: 852/2215 cut-off events. [2025-03-04 06:27:37,683 INFO L125 PetriNetUnfolderBase]: For 1829/1829 co-relation queries the response was YES. [2025-03-04 06:27:37,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 2215 events. 852/2215 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17615 event pairs, 852 based on Foata normal form. 364/2440 useless extension candidates. Maximal degree in co-relation 1208. Up to 1219 conditions per place. [2025-03-04 06:27:37,701 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 18 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 06:27:37,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 77 transitions, 234 flow [2025-03-04 06:27:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-04 06:27:37,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7572463768115942 [2025-03-04 06:27:37,703 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 224 flow. Second operand 3 states and 209 transitions. [2025-03-04 06:27:37,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 77 transitions, 234 flow [2025-03-04 06:27:37,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 77 transitions, 222 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:37,706 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 186 flow [2025-03-04 06:27:37,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-03-04 06:27:37,709 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -13 predicate places. [2025-03-04 06:27:37,709 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 186 flow [2025-03-04 06:27:37,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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-04 06:27:37,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:37,709 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:37,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:27:37,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-03-04 06:27:37,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash -965411207, now seen corresponding path program 1 times [2025-03-04 06:27:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779214396] [2025-03-04 06:27:37,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:27:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:27:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:37,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:37,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:27:37,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:27:37,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:37,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:37,754 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 06:27:37,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:27:37,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:27:37,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:27:37,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:27:37,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:37,755 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:37,755 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-04 06:27:37,782 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 264 flow [2025-03-04 06:27:37,798 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2025-03-04 06:27:37,798 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 06:27:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 147 events. 0/147 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 397 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-03-04 06:27:37,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 105 transitions, 264 flow [2025-03-04 06:27:37,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 105 transitions, 264 flow [2025-03-04 06:27:37,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:37,801 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:37,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 06:27:37,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:37,803 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:37,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:37,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:37,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:37,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 06:27:37,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -500841608, now seen corresponding path program 1 times [2025-03-04 06:27:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:37,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030981140] [2025-03-04 06:27:37,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:37,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:37,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:37,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:37,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:37,835 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-04 06:27:37,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030981140] [2025-03-04 06:27:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030981140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482643965] [2025-03-04 06:27:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:37,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:37,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:37,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2025-03-04 06:27:37,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 105 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-04 06:27:37,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:37,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2025-03-04 06:27:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:38,626 INFO L124 PetriNetUnfolderBase]: 3282/7296 cut-off events. [2025-03-04 06:27:38,626 INFO L125 PetriNetUnfolderBase]: For 7882/7882 co-relation queries the response was YES. [2025-03-04 06:27:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14052 conditions, 7296 events. 3282/7296 cut-off events. For 7882/7882 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66480 event pairs, 3282 based on Foata normal form. 1093/7955 useless extension candidates. Maximal degree in co-relation 4201. Up to 4378 conditions per place. [2025-03-04 06:27:38,740 INFO L140 encePairwiseOnDemand]: 89/105 looper letters, 21 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-04 06:27:38,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 88 transitions, 276 flow [2025-03-04 06:27:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2025-03-04 06:27:38,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-03-04 06:27:38,741 INFO L175 Difference]: Start difference. First operand has 118 places, 105 transitions, 264 flow. Second operand 3 states and 238 transitions. [2025-03-04 06:27:38,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 88 transitions, 276 flow [2025-03-04 06:27:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 88 transitions, 256 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:38,751 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 214 flow [2025-03-04 06:27:38,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=101, 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=214, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2025-03-04 06:27:38,752 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2025-03-04 06:27:38,753 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 88 transitions, 214 flow [2025-03-04 06:27:38,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-04 06:27:38,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:38,753 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:38,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:27:38,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 06:27:38,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:38,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1040966948, now seen corresponding path program 1 times [2025-03-04 06:27:38,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-04 06:27:38,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:38,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:38,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:27:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:27:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:38,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:38,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 06:27:38,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 06:27:38,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:38,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:38,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:38,788 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:38,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 06:27:38,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-04 06:27:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-04 06:27:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:27:38,792 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:38,793 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:38,793 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-04 06:27:38,819 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:38,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 118 transitions, 306 flow [2025-03-04 06:27:38,837 INFO L124 PetriNetUnfolderBase]: 0/167 cut-off events. [2025-03-04 06:27:38,837 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 06:27:38,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 167 events. 0/167 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 478 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-03-04 06:27:38,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 118 transitions, 306 flow [2025-03-04 06:27:38,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 118 transitions, 306 flow [2025-03-04 06:27:38,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:38,840 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:38,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:27:38,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:38,841 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:38,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:38,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:38,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:38,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-04 06:27:38,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1936280402, now seen corresponding path program 1 times [2025-03-04 06:27:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425387278] [2025-03-04 06:27:38,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:38,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:38,864 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-04 06:27:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425387278] [2025-03-04 06:27:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425387278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323151496] [2025-03-04 06:27:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:38,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:38,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:38,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:38,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 118 [2025-03-04 06:27:38,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 118 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-04 06:27:38,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:38,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 118 [2025-03-04 06:27:38,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:41,549 INFO L124 PetriNetUnfolderBase]: 12030/23987 cut-off events. [2025-03-04 06:27:41,550 INFO L125 PetriNetUnfolderBase]: For 32188/32188 co-relation queries the response was YES. [2025-03-04 06:27:41,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47511 conditions, 23987 events. 12030/23987 cut-off events. For 32188/32188 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 237823 event pairs, 12030 based on Foata normal form. 3280/25944 useless extension candidates. Maximal degree in co-relation 14385. Up to 15313 conditions per place. [2025-03-04 06:27:41,864 INFO L140 encePairwiseOnDemand]: 100/118 looper letters, 24 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-03-04 06:27:41,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 320 flow [2025-03-04 06:27:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-03-04 06:27:41,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542372881355932 [2025-03-04 06:27:41,866 INFO L175 Difference]: Start difference. First operand has 133 places, 118 transitions, 306 flow. Second operand 3 states and 267 transitions. [2025-03-04 06:27:41,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 320 flow [2025-03-04 06:27:41,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 99 transitions, 290 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:41,885 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 242 flow [2025-03-04 06:27:41,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, 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=3, PETRI_FLOW=242, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-03-04 06:27:41,887 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -17 predicate places. [2025-03-04 06:27:41,887 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 242 flow [2025-03-04 06:27:41,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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-04 06:27:41,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:41,888 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:41,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:27:41,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-04 06:27:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 52381960, now seen corresponding path program 1 times [2025-03-04 06:27:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485619436] [2025-03-04 06:27:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:41,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:27:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:27:41,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:41,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:41,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:27:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:27:41,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:41,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:41,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:41,931 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:27:41,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:27:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:27:41,932 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:41,932 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:41,932 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-04 06:27:41,967 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:41,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 131 transitions, 350 flow [2025-03-04 06:27:41,983 INFO L124 PetriNetUnfolderBase]: 0/187 cut-off events. [2025-03-04 06:27:41,983 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-04 06:27:41,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 187 events. 0/187 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 550 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2025-03-04 06:27:41,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 131 transitions, 350 flow [2025-03-04 06:27:41,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 131 transitions, 350 flow [2025-03-04 06:27:41,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:41,987 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:41,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:27:41,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:41,988 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:41,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:41,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:41,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:41,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 06:27:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1274678929, now seen corresponding path program 1 times [2025-03-04 06:27:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623701485] [2025-03-04 06:27:41,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:41,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:41,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:41,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:41,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:42,005 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-04 06:27:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623701485] [2025-03-04 06:27:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623701485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293346052] [2025-03-04 06:27:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:42,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:42,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:42,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2025-03-04 06:27:42,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 131 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-04 06:27:42,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:42,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2025-03-04 06:27:42,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:27:49,043 INFO L124 PetriNetUnfolderBase]: 42648/78424 cut-off events. [2025-03-04 06:27:49,044 INFO L125 PetriNetUnfolderBase]: For 126236/126236 co-relation queries the response was YES. [2025-03-04 06:27:49,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158811 conditions, 78424 events. 42648/78424 cut-off events. For 126236/126236 co-relation queries the response was YES. Maximal size of possible extension queue 3426. Compared 829423 event pairs, 42648 based on Foata normal form. 9841/84271 useless extension candidates. Maximal degree in co-relation 48572. Up to 52492 conditions per place. [2025-03-04 06:27:50,369 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 27 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-04 06:27:50,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 110 transitions, 366 flow [2025-03-04 06:27:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:27:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:27:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-03-04 06:27:50,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531806615776081 [2025-03-04 06:27:50,371 INFO L175 Difference]: Start difference. First operand has 148 places, 131 transitions, 350 flow. Second operand 3 states and 296 transitions. [2025-03-04 06:27:50,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 110 transitions, 366 flow [2025-03-04 06:27:50,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 110 transitions, 324 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-03-04 06:27:50,443 INFO L231 Difference]: Finished difference. Result has 129 places, 110 transitions, 270 flow [2025-03-04 06:27:50,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=129, PETRI_TRANSITIONS=110} [2025-03-04 06:27:50,444 INFO L279 CegarLoopForPetriNet]: 148 programPoint places, -19 predicate places. [2025-03-04 06:27:50,444 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 110 transitions, 270 flow [2025-03-04 06:27:50,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-04 06:27:50,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:50,444 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:27:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:27:50,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 06:27:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1466527387, now seen corresponding path program 1 times [2025-03-04 06:27:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837809161] [2025-03-04 06:27:50,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:50,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:27:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:27:50,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:50,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:27:50,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:27:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:27:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:27:50,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:27:50,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:27:50,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-04 06:27:50,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-04 06:27:50,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-04 06:27:50,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-04 06:27:50,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-04 06:27:50,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-04 06:27:50,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-04 06:27:50,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:27:50,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 06:27:50,483 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:27:50,484 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-04 06:27:50,516 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:27:50,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 144 transitions, 396 flow [2025-03-04 06:27:50,530 INFO L124 PetriNetUnfolderBase]: 0/207 cut-off events. [2025-03-04 06:27:50,531 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-03-04 06:27:50,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 207 events. 0/207 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 625 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2025-03-04 06:27:50,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 144 transitions, 396 flow [2025-03-04 06:27:50,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 144 transitions, 396 flow [2025-03-04 06:27:50,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:27:50,533 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;@608914eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:27:50,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 06:27:50,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:27:50,534 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-04 06:27:50,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:27:50,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:27:50,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:27:50,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 18 more)] === [2025-03-04 06:27:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:27:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 542101793, now seen corresponding path program 1 times [2025-03-04 06:27:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:27:50,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568761452] [2025-03-04 06:27:50,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:27:50,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:27:50,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 06:27:50,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 06:27:50,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:27:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:27:50,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-04 06:27:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:27:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568761452] [2025-03-04 06:27:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568761452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:27:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:27:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:27:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-03-04 06:27:50,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:27:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:27:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:27:50,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:27:50,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:27:50,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 144 [2025-03-04 06:27:50,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 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-04 06:27:50,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:27:50,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 144 [2025-03-04 06:27:50,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand