./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-08 05:30:43,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:30:43,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:30:43,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:30:43,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:30:43,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:30:43,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:30:43,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:30:43,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:30:43,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:30:43,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:30:43,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:30:43,729 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:30:43,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:30:43,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:30:43,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:30:43,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:43,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:30:43,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:30:43,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:30:43,733 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-08 05:30:43,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:30:44,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:30:44,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:30:44,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:30:44,007 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:30:44,008 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-08 05:30:45,316 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac90dfc6/262a4aae76d34ebd91a17609345a410a/FLAG02aa39f7c [2025-02-08 05:30:45,663 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:30:45,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_41-pt_rwlock.i [2025-02-08 05:30:45,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac90dfc6/262a4aae76d34ebd91a17609345a410a/FLAG02aa39f7c [2025-02-08 05:30:45,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac90dfc6/262a4aae76d34ebd91a17609345a410a [2025-02-08 05:30:45,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:30:45,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:30:45,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:45,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:30:45,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:30:45,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:45" (1/1) ... [2025-02-08 05:30:45,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6b9e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:45, skipping insertion in model container [2025-02-08 05:30:45,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:45" (1/1) ... [2025-02-08 05:30:45,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:30:46,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:46,085 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:30:46,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:46,229 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:30:46,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46 WrapperNode [2025-02-08 05:30:46,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:46,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:46,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:30:46,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:30:46,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,282 INFO L138 Inliner]: procedures = 263, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-02-08 05:30:46,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:46,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:30:46,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:30:46,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:30:46,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:30:46,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:30:46,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:30:46,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:30:46,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (1/1) ... [2025-02-08 05:30:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:46,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:30:46,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:30:46,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:30:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2025-02-08 05:30:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2025-02-08 05:30:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2025-02-08 05:30:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:30:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:30:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:30:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:30:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:30:46,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:30:46,366 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:30:46,480 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:30:46,482 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:30:46,675 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:30:46,676 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:30:46,706 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:30:46,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:30:46,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:46 BoogieIcfgContainer [2025-02-08 05:30:46,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:30:46,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:30:46,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:30:46,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:30:46,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:30:45" (1/3) ... [2025-02-08 05:30:46,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b0778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:46, skipping insertion in model container [2025-02-08 05:30:46,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:46" (2/3) ... [2025-02-08 05:30:46,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b0778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:46, skipping insertion in model container [2025-02-08 05:30:46,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:46" (3/3) ... [2025-02-08 05:30:46,716 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_41-pt_rwlock.i [2025-02-08 05:30:46,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:30:46,736 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-08 05:30:46,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:30:46,804 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:30:46,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 75 transitions, 157 flow [2025-02-08 05:30:46,876 INFO L124 PetriNetUnfolderBase]: 0/74 cut-off events. [2025-02-08 05:30:46,880 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:46,883 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-08 05:30:46,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 75 transitions, 157 flow [2025-02-08 05:30:46,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 69 transitions, 141 flow [2025-02-08 05:30:46,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:30:46,913 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;@2c12d7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:30:46,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:30:46,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:30:46,928 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-08 05:30:46,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:46,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:46,929 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-08 05:30:46,930 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-08 05:30:46,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash -460882323, now seen corresponding path program 1 times [2025-02-08 05:30:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070117246] [2025-02-08 05:30:46,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:30:47,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:30:47,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:47,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070117246] [2025-02-08 05:30:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070117246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:47,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557271208] [2025-02-08 05:30:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:47,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:47,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:47,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:47,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-08 05:30:47,287 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-08 05:30:47,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:47,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-08 05:30:47,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:47,415 INFO L124 PetriNetUnfolderBase]: 22/234 cut-off events. [2025-02-08 05:30:47,415 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:47,418 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 1007 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-08 05:30:47,421 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 14 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-02-08 05:30:47,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 189 flow [2025-02-08 05:30:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-08 05:30:47,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155555555555556 [2025-02-08 05:30:47,441 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 141 flow. Second operand 3 states and 206 transitions. [2025-02-08 05:30:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 189 flow [2025-02-08 05:30:47,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:47,452 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 168 flow [2025-02-08 05:30:47,455 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-08 05:30:47,458 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-02-08 05:30:47,459 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 168 flow [2025-02-08 05:30:47,460 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-08 05:30:47,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:47,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:47,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:30:47,462 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-08 05:30:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1364226975, now seen corresponding path program 1 times [2025-02-08 05:30:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122018566] [2025-02-08 05:30:47,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:30:47,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:30:47,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:47,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122018566] [2025-02-08 05:30:47,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122018566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:47,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:47,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:47,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930975783] [2025-02-08 05:30:47,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:47,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:47,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:47,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:47,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-08 05:30:47,595 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-08 05:30:47,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:47,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-08 05:30:47,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:47,687 INFO L124 PetriNetUnfolderBase]: 41/297 cut-off events. [2025-02-08 05:30:47,687 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:30:47,688 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-08 05:30:47,689 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 13 selfloop transitions, 4 changer transitions 1/77 dead transitions. [2025-02-08 05:30:47,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 77 transitions, 216 flow [2025-02-08 05:30:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2025-02-08 05:30:47,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155555555555556 [2025-02-08 05:30:47,692 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 168 flow. Second operand 3 states and 206 transitions. [2025-02-08 05:30:47,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 77 transitions, 216 flow [2025-02-08 05:30:47,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 77 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:47,694 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 188 flow [2025-02-08 05:30:47,694 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-08 05:30:47,695 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-02-08 05:30:47,695 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 188 flow [2025-02-08 05:30:47,695 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-08 05:30:47,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:47,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:47,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:30:47,696 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-08 05:30:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1670473855, now seen corresponding path program 1 times [2025-02-08 05:30:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518332476] [2025-02-08 05:30:47,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:30:47,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:30:47,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:47,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:47,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518332476] [2025-02-08 05:30:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518332476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527502545] [2025-02-08 05:30:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:47,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:47,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:47,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:47,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-08 05:30:47,803 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-08 05:30:47,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:47,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-08 05:30:47,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:47,863 INFO L124 PetriNetUnfolderBase]: 42/332 cut-off events. [2025-02-08 05:30:47,864 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:30:47,865 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 1692 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-08 05:30:47,866 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 14 selfloop transitions, 4 changer transitions 1/78 dead transitions. [2025-02-08 05:30:47,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 238 flow [2025-02-08 05:30:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2025-02-08 05:30:47,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-02-08 05:30:47,869 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 188 flow. Second operand 3 states and 204 transitions. [2025-02-08 05:30:47,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 238 flow [2025-02-08 05:30:47,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:47,872 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 212 flow [2025-02-08 05:30:47,873 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-08 05:30:47,873 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-02-08 05:30:47,873 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 212 flow [2025-02-08 05:30:47,873 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-08 05:30:47,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:47,873 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-08 05:30:47,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:30:47,874 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-08 05:30:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1183184497, now seen corresponding path program 1 times [2025-02-08 05:30:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371530646] [2025-02-08 05:30:47,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:47,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:30:47,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:30:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:47,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371530646] [2025-02-08 05:30:47,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371530646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:47,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:47,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656789632] [2025-02-08 05:30:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:47,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:47,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:47,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:47,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:47,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 75 [2025-02-08 05:30:47,950 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-08 05:30:47,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:47,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 75 [2025-02-08 05:30:47,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:48,029 INFO L124 PetriNetUnfolderBase]: 66/390 cut-off events. [2025-02-08 05:30:48,030 INFO L125 PetriNetUnfolderBase]: For 58/73 co-relation queries the response was YES. [2025-02-08 05:30:48,033 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 2189 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-08 05:30:48,034 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 14 selfloop transitions, 3 changer transitions 4/81 dead transitions. [2025-02-08 05:30:48,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 264 flow [2025-02-08 05:30:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-02-08 05:30:48,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8844444444444445 [2025-02-08 05:30:48,037 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 212 flow. Second operand 3 states and 199 transitions. [2025-02-08 05:30:48,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 264 flow [2025-02-08 05:30:48,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 81 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:48,039 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 222 flow [2025-02-08 05:30:48,042 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-08 05:30:48,043 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2025-02-08 05:30:48,044 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 222 flow [2025-02-08 05:30:48,044 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-08 05:30:48,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:48,045 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-08 05:30:48,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:30:48,045 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-08 05:30:48,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2094597645, now seen corresponding path program 1 times [2025-02-08 05:30:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813748578] [2025-02-08 05:30:48,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:48,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:30:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:30:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:48,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:48,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813748578] [2025-02-08 05:30:48,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813748578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:48,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:48,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:30:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212639581] [2025-02-08 05:30:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:48,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:48,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:48,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:48,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 75 [2025-02-08 05:30:48,303 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-08 05:30:48,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:48,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 75 [2025-02-08 05:30:48,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:48,346 INFO L124 PetriNetUnfolderBase]: 14/209 cut-off events. [2025-02-08 05:30:48,347 INFO L125 PetriNetUnfolderBase]: For 69/72 co-relation queries the response was YES. [2025-02-08 05:30:48,348 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 920 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-08 05:30:48,348 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 3 selfloop transitions, 1 changer transitions 1/71 dead transitions. [2025-02-08 05:30:48,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 222 flow [2025-02-08 05:30:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2025-02-08 05:30:48,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2025-02-08 05:30:48,350 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 222 flow. Second operand 3 states and 212 transitions. [2025-02-08 05:30:48,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 222 flow [2025-02-08 05:30:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:48,356 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 209 flow [2025-02-08 05:30:48,357 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-08 05:30:48,358 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-02-08 05:30:48,359 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 209 flow [2025-02-08 05:30:48,359 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-08 05:30:48,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:48,360 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-08 05:30:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:30:48,361 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-08 05:30:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2068816137, now seen corresponding path program 2 times [2025-02-08 05:30:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826285809] [2025-02-08 05:30:48,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:30:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:48,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:30:48,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:30:48,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:30:48,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826285809] [2025-02-08 05:30:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826285809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:48,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:48,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:30:48,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851638624] [2025-02-08 05:30:48,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:48,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:48,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:48,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 75 [2025-02-08 05:30:48,516 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-08 05:30:48,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:48,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 75 [2025-02-08 05:30:48,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:48,525 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-02-08 05:30:48,526 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:30:48,526 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-08 05:30:48,527 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-02-08 05:30:48,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 111 flow [2025-02-08 05:30:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-02-08 05:30:48,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9244444444444444 [2025-02-08 05:30:48,528 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 209 flow. Second operand 3 states and 208 transitions. [2025-02-08 05:30:48,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 111 flow [2025-02-08 05:30:48,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 94 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-08 05:30:48,530 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-02-08 05:30:48,530 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-08 05:30:48,531 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -24 predicate places. [2025-02-08 05:30:48,532 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-02-08 05:30:48,533 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-08 05:30:48,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:30:48,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:30:48,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:30:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:30:48,537 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-02-08 05:30:48,542 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:30:48,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:30:48,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:30:48 BasicIcfg [2025-02-08 05:30:48,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:30:48,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:30:48,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:30:48,551 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:30:48,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:46" (3/4) ... [2025-02-08 05:30:48,553 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:30:48,555 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:30:48,560 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:30:48,560 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:30:48,560 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:30:48,632 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:30:48,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:30:48,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:30:48,634 INFO L158 Benchmark]: Toolchain (without parser) took 2928.34ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 60.5MB in the end (delta: 49.5MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-02-08 05:30:48,634 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:48,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.64ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 82.1MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:30:48,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.58ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:48,635 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 79.5MB in the end (delta: 898.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:48,637 INFO L158 Benchmark]: IcfgBuilder took 402.78ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:30:48,637 INFO L158 Benchmark]: TraceAbstraction took 1840.20ms. Allocated memory is still 142.6MB. Free memory was 64.0MB in the beginning and 65.2MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:48,637 INFO L158 Benchmark]: Witness Printer took 83.08ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 60.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:48,639 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.92ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.64ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 82.1MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.58ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 79.5MB in the end (delta: 898.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 402.78ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.9MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1840.20ms. Allocated memory is still 142.6MB. Free memory was 64.0MB in the beginning and 65.2MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.08ms. Allocated memory is still 142.6MB. Free memory was 65.2MB in the beginning and 60.5MB in the end (delta: 4.8MB). 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.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.2s 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.5s 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-08 05:30:48,656 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