./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_41-pt_rwlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/04-mutex_41-pt_rwlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fef1217f8a35a342f6e4927c3581e159c4208b83ce3f67c4227091859235df56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:20:21,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:20:21,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:20:21,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:20:21,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:20:21,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:20:21,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:20:21,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:20:21,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:20:21,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:20:21,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:20:21,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:20:21,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:20:21,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:21,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:20:21,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:20:21,566 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fef1217f8a35a342f6e4927c3581e159c4208b83ce3f67c4227091859235df56 [2025-02-06 09:20:21,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:20:21,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:20:21,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:20:21,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:20:21,776 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:20:21,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_41-pt_rwlock.i [2025-02-06 09:20:22,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19be5fc79/fb6ebfaf8a8244f1960b8c8c67adeb69/FLAG840a0d962 [2025-02-06 09:20:23,205 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:20:23,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_41-pt_rwlock.i [2025-02-06 09:20:23,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19be5fc79/fb6ebfaf8a8244f1960b8c8c67adeb69/FLAG840a0d962 [2025-02-06 09:20:23,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19be5fc79/fb6ebfaf8a8244f1960b8c8c67adeb69 [2025-02-06 09:20:23,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:20:23,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:20:23,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:23,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:20:23,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:20:23,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d48a2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23, skipping insertion in model container [2025-02-06 09:20:23,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:20:23,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:23,770 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:20:23,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:23,853 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:20:23,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23 WrapperNode [2025-02-06 09:20:23,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:23,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:23,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:20:23,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:20:23,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,885 INFO L138 Inliner]: procedures = 263, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-02-06 09:20:23,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:23,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:20:23,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:20:23,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:20:23,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:20:23,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:20:23,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:20:23,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:20:23,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (1/1) ... [2025-02-06 09:20:23,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:23,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:23,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:20:23,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:20:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2025-02-06 09:20:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2025-02-06 09:20:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2025-02-06 09:20:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:20:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:20:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:20:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:20:23,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:20:23,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:20:23,944 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:20:24,042 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:20:24,043 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:20:24,160 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:20:24,160 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:20:24,178 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:20:24,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:20:24,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:24 BoogieIcfgContainer [2025-02-06 09:20:24,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:20:24,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:20:24,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:20:24,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:20:24,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:20:23" (1/3) ... [2025-02-06 09:20:24,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532519e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:24, skipping insertion in model container [2025-02-06 09:20:24,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:23" (2/3) ... [2025-02-06 09:20:24,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532519e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:24, skipping insertion in model container [2025-02-06 09:20:24,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:24" (3/3) ... [2025-02-06 09:20:24,186 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_41-pt_rwlock.i [2025-02-06 09:20:24,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:20:24,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_41-pt_rwlock.i that has 2 procedures, 76 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 09:20:24,197 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:20:24,230 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:20:24,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 75 transitions, 157 flow [2025-02-06 09:20:24,283 INFO L124 PetriNetUnfolderBase]: 0/74 cut-off events. [2025-02-06 09:20:24,284 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:24,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 0/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-06 09:20:24,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 75 transitions, 157 flow [2025-02-06 09:20:24,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 69 transitions, 141 flow [2025-02-06 09:20:24,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:20:24,303 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;@4db73a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:20:24,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 09:20:24,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:20:24,311 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:20:24,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:24,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:24,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:24,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash -486951066, now seen corresponding path program 1 times [2025-02-06 09:20:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:24,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965833166] [2025-02-06 09:20:24,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:24,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:24,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:20:24,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:20:24,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:24,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:24,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965833166] [2025-02-06 09:20:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965833166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:20:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76738057] [2025-02-06 09:20:24,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:24,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:24,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:24,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-06 09:20:24,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:24,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:24,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-06 09:20:24,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:24,660 INFO L124 PetriNetUnfolderBase]: 22/234 cut-off events. [2025-02-06 09:20:24,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:24,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 234 events. 22/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1002 event pairs, 7 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 269. Up to 38 conditions per place. [2025-02-06 09:20:24,664 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 14 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-02-06 09:20:24,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 189 flow [2025-02-06 09:20:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-06 09:20:24,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155555555555556 [2025-02-06 09:20:24,676 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 141 flow. Second operand 3 states and 206 transitions. [2025-02-06 09:20:24,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 189 flow [2025-02-06 09:20:24,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:24,685 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 168 flow [2025-02-06 09:20:24,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-02-06 09:20:24,690 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-02-06 09:20:24,691 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 168 flow [2025-02-06 09:20:24,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:24,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:24,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:24,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:20:24,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1290620430, now seen corresponding path program 1 times [2025-02-06 09:20:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442677415] [2025-02-06 09:20:24,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:20:24,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:20:24,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:24,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:24,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442677415] [2025-02-06 09:20:24,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442677415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:24,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:24,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:20:24,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905557790] [2025-02-06 09:20:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:24,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:24,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:24,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:24,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-06 09:20:24,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:24,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:24,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-06 09:20:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:24,869 INFO L124 PetriNetUnfolderBase]: 41/297 cut-off events. [2025-02-06 09:20:24,869 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:20:24,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 297 events. 41/297 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1413 event pairs, 11 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 407. Up to 71 conditions per place. [2025-02-06 09:20:24,871 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 13 selfloop transitions, 4 changer transitions 1/77 dead transitions. [2025-02-06 09:20:24,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 216 flow [2025-02-06 09:20:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-06 09:20:24,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155555555555556 [2025-02-06 09:20:24,876 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 168 flow. Second operand 3 states and 206 transitions. [2025-02-06 09:20:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 216 flow [2025-02-06 09:20:24,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:20:24,878 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 188 flow [2025-02-06 09:20:24,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-02-06 09:20:24,879 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-02-06 09:20:24,879 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 188 flow [2025-02-06 09:20:24,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:24,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:24,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:24,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:20:24,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 227844585, now seen corresponding path program 1 times [2025-02-06 09:20:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227673726] [2025-02-06 09:20:24,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:24,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:20:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:20:24,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:24,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227673726] [2025-02-06 09:20:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227673726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:20:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995980717] [2025-02-06 09:20:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:24,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:24,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:24,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-06 09:20:24,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:24,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:24,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-06 09:20:24,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:25,033 INFO L124 PetriNetUnfolderBase]: 42/332 cut-off events. [2025-02-06 09:20:25,033 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 09:20:25,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 332 events. 42/332 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1698 event pairs, 16 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 501. Up to 71 conditions per place. [2025-02-06 09:20:25,036 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 14 selfloop transitions, 4 changer transitions 1/78 dead transitions. [2025-02-06 09:20:25,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 238 flow [2025-02-06 09:20:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2025-02-06 09:20:25,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-02-06 09:20:25,039 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 188 flow. Second operand 3 states and 204 transitions. [2025-02-06 09:20:25,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 238 flow [2025-02-06 09:20:25,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:20:25,041 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 212 flow [2025-02-06 09:20:25,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2025-02-06 09:20:25,042 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-02-06 09:20:25,042 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 212 flow [2025-02-06 09:20:25,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:25,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:20:25,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -134190235, now seen corresponding path program 1 times [2025-02-06 09:20:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134865346] [2025-02-06 09:20:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:25,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:20:25,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:20:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:25,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:25,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134865346] [2025-02-06 09:20:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134865346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:25,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:20:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173578601] [2025-02-06 09:20:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:25,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:25,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 75 [2025-02-06 09:20:25,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:25,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 75 [2025-02-06 09:20:25,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:25,148 INFO L124 PetriNetUnfolderBase]: 66/390 cut-off events. [2025-02-06 09:20:25,149 INFO L125 PetriNetUnfolderBase]: For 58/73 co-relation queries the response was YES. [2025-02-06 09:20:25,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 390 events. 66/390 cut-off events. For 58/73 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2208 event pairs, 23 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 659. Up to 130 conditions per place. [2025-02-06 09:20:25,151 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 14 selfloop transitions, 3 changer transitions 4/81 dead transitions. [2025-02-06 09:20:25,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 264 flow [2025-02-06 09:20:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-02-06 09:20:25,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8844444444444445 [2025-02-06 09:20:25,152 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 212 flow. Second operand 3 states and 199 transitions. [2025-02-06 09:20:25,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 264 flow [2025-02-06 09:20:25,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:20:25,154 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 222 flow [2025-02-06 09:20:25,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2025-02-06 09:20:25,155 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2025-02-06 09:20:25,155 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 222 flow [2025-02-06 09:20:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:25,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:25,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:20:25,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:25,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1185606267, now seen corresponding path program 1 times [2025-02-06 09:20:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:25,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693930277] [2025-02-06 09:20:25,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:25,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:20:25,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:20:25,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693930277] [2025-02-06 09:20:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693930277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:20:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284954263] [2025-02-06 09:20:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:25,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:25,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:25,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 75 [2025-02-06 09:20:25,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:25,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 75 [2025-02-06 09:20:25,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:25,357 INFO L124 PetriNetUnfolderBase]: 14/209 cut-off events. [2025-02-06 09:20:25,357 INFO L125 PetriNetUnfolderBase]: For 69/72 co-relation queries the response was YES. [2025-02-06 09:20:25,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 209 events. 14/209 cut-off events. For 69/72 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 923 event pairs, 0 based on Foata normal form. 23/226 useless extension candidates. Maximal degree in co-relation 353. Up to 39 conditions per place. [2025-02-06 09:20:25,358 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 3 selfloop transitions, 1 changer transitions 1/71 dead transitions. [2025-02-06 09:20:25,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 222 flow [2025-02-06 09:20:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2025-02-06 09:20:25,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2025-02-06 09:20:25,359 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 222 flow. Second operand 3 states and 212 transitions. [2025-02-06 09:20:25,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 222 flow [2025-02-06 09:20:25,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:20:25,361 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 209 flow [2025-02-06 09:20:25,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2025-02-06 09:20:25,362 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-02-06 09:20:25,362 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 209 flow [2025-02-06 09:20:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:25,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:20:25,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-06 09:20:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1337550849, now seen corresponding path program 2 times [2025-02-06 09:20:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237946628] [2025-02-06 09:20:25,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:25,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:20:25,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:20:25,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:25,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237946628] [2025-02-06 09:20:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237946628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:20:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757345987] [2025-02-06 09:20:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:25,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:25,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:25,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:25,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:25,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 75 [2025-02-06 09:20:25,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:25,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 75 [2025-02-06 09:20:25,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:25,473 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-02-06 09:20:25,474 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:20:25,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 42 events. 0/42 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-02-06 09:20:25,474 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-02-06 09:20:25,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 111 flow [2025-02-06 09:20:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-02-06 09:20:25,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244444444444444 [2025-02-06 09:20:25,475 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 209 flow. Second operand 3 states and 208 transitions. [2025-02-06 09:20:25,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 111 flow [2025-02-06 09:20:25,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 94 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-06 09:20:25,476 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-02-06 09:20:25,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2025-02-06 09:20:25,476 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -24 predicate places. [2025-02-06 09:20:25,476 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-02-06 09:20:25,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-06 09:20:25,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-06 09:20:25,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-06 09:20:25,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-06 09:20:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:20:25,480 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-02-06 09:20:25,483 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:20:25,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:20:25,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:20:25 BasicIcfg [2025-02-06 09:20:25,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:20:25,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:20:25,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:20:25,487 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:20:25,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:24" (3/4) ... [2025-02-06 09:20:25,489 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:20:25,491 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-06 09:20:25,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:20:25,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:20:25,494 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:20:25,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:20:25,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:20:25,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:20:25,542 INFO L158 Benchmark]: Toolchain (without parser) took 2092.03ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 102.9MB in the end (delta: 17.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-02-06 09:20:25,543 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:20:25,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 93.6MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:20:25,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.90ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 92.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:20:25,544 INFO L158 Benchmark]: Boogie Preprocessor took 15.13ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:20:25,545 INFO L158 Benchmark]: IcfgBuilder took 277.32ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 76.3MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:20:25,545 INFO L158 Benchmark]: TraceAbstraction took 1305.64ms. Allocated memory is still 167.8MB. Free memory was 75.3MB in the beginning and 108.3MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:20:25,545 INFO L158 Benchmark]: Witness Printer took 54.74ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 102.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:20:25,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.42ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 93.6MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.90ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 92.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.13ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 277.32ms. Allocated memory is still 167.8MB. Free memory was 91.0MB in the beginning and 76.3MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1305.64ms. Allocated memory is still 167.8MB. Free memory was 75.3MB in the beginning and 108.3MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.74ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 102.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 932]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 932]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 922]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 922]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 923]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 101 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 38 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:20:25,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE