./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_3t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_3t.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7efed4227021db06f22a3abd4d1096de1449b086dcfb78e041156858b4360a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:33:34,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:33:34,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:33:34,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:33:34,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:33:34,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:33:34,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:33:34,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:33:34,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:33:34,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:33:34,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:33:34,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:33:34,643 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:33:34,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:33:34,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:33:34,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:33:34,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:33:34,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:34,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:33:34,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:33:34,646 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7efed4227021db06f22a3abd4d1096de1449b086dcfb78e041156858b4360a4 [2025-03-14 01:33:34,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:33:34,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:33:34,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:33:34,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:33:34,873 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:33:34,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_3t.i [2025-03-14 01:33:35,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fc8ad39/4e74be4fc46b45d7a88647054efe1cc4/FLAGf58276936 [2025-03-14 01:33:36,258 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:33:36,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_3t.i [2025-03-14 01:33:36,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fc8ad39/4e74be4fc46b45d7a88647054efe1cc4/FLAGf58276936 [2025-03-14 01:33:36,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fc8ad39/4e74be4fc46b45d7a88647054efe1cc4 [2025-03-14 01:33:36,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:33:36,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:33:36,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:36,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:33:36,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:33:36,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8bfadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36, skipping insertion in model container [2025-03-14 01:33:36,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:33:36,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:36,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:33:36,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:36,912 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:33:36,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36 WrapperNode [2025-03-14 01:33:36,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:36,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:36,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:33:36,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:33:36,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,969 INFO L138 Inliner]: procedures = 174, calls = 94, calls flagged for inlining = 21, calls inlined = 37, statements flattened = 872 [2025-03-14 01:33:36,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:36,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:33:36,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:33:36,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:33:36,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:36,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:33:37,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:33:37,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:33:37,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:33:37,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (1/1) ... [2025-03-14 01:33:37,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:33:37,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:33:37,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:33:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:33:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:33:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:33:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2025-03-14 01:33:37,102 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:33:37,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:33:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:33:37,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:33:37,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:33:37,105 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:33:37,252 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:33:37,253 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:33:38,191 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:33:38,192 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:33:38,192 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:33:38,236 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:33:38,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:38 BoogieIcfgContainer [2025-03-14 01:33:38,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:33:38,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:33:38,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:33:38,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:33:38,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:33:36" (1/3) ... [2025-03-14 01:33:38,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:38, skipping insertion in model container [2025-03-14 01:33:38,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:36" (2/3) ... [2025-03-14 01:33:38,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:38, skipping insertion in model container [2025-03-14 01:33:38,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:38" (3/3) ... [2025-03-14 01:33:38,244 INFO L128 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_3t.i [2025-03-14 01:33:38,256 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:33:38,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG one_time_barrier_twice_3t.i that has 2 procedures, 978 locations, 1 initial locations, 16 loop locations, and 79 error locations. [2025-03-14 01:33:38,259 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:33:38,422 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:33:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 981 places, 1057 transitions, 2121 flow [2025-03-14 01:33:38,883 INFO L124 PetriNetUnfolderBase]: 118/1550 cut-off events. [2025-03-14 01:33:38,885 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:38,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 1550 events. 118/1550 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5702 event pairs, 0 based on Foata normal form. 0/1312 useless extension candidates. Maximal degree in co-relation 915. Up to 4 conditions per place. [2025-03-14 01:33:38,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 981 places, 1057 transitions, 2121 flow [2025-03-14 01:33:38,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 981 places, 1057 transitions, 2121 flow [2025-03-14 01:33:38,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:33:38,955 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;@1dd2b7b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:33:38,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 114 error locations. [2025-03-14 01:33:38,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:33:38,963 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2025-03-14 01:33:38,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:33:38,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:38,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:38,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:33:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1346398616, now seen corresponding path program 1 times [2025-03-14 01:33:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464635257] [2025-03-14 01:33:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:38,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:39,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:33:39,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:33:39,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:39,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464635257] [2025-03-14 01:33:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464635257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:39,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681101777] [2025-03-14 01:33:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:39,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:39,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:39,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:40,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 1057 [2025-03-14 01:33:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 981 places, 1057 transitions, 2121 flow. Second operand has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 1057 [2025-03-14 01:33:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:49,678 INFO L124 PetriNetUnfolderBase]: 12711/59648 cut-off events. [2025-03-14 01:33:49,678 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-14 01:33:49,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83057 conditions, 59648 events. 12711/59648 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 694548 event pairs, 11413 based on Foata normal form. 5888/58365 useless extension candidates. Maximal degree in co-relation 82324. Up to 23399 conditions per place. [2025-03-14 01:33:49,942 INFO L140 encePairwiseOnDemand]: 991/1057 looper letters, 239 selfloop transitions, 5 changer transitions 6/968 dead transitions. [2025-03-14 01:33:49,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 968 transitions, 2431 flow [2025-03-14 01:33:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4817 transitions. [2025-03-14 01:33:49,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595395774203721 [2025-03-14 01:33:49,975 INFO L175 Difference]: Start difference. First operand has 981 places, 1057 transitions, 2121 flow. Second operand 6 states and 4817 transitions. [2025-03-14 01:33:49,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 968 transitions, 2431 flow [2025-03-14 01:33:50,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 2431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:50,156 INFO L231 Difference]: Finished difference. Result has 957 places, 962 transitions, 1941 flow [2025-03-14 01:33:50,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1941, PETRI_PLACES=957, PETRI_TRANSITIONS=962} [2025-03-14 01:33:50,163 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -24 predicate places. [2025-03-14 01:33:50,163 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 962 transitions, 1941 flow [2025-03-14 01:33:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:50,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:50,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:50,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:33:50,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:33:50,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash -927753325, now seen corresponding path program 1 times [2025-03-14 01:33:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:50,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128089315] [2025-03-14 01:33:50,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:50,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:33:50,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:33:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:50,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128089315] [2025-03-14 01:33:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128089315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:33:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89284481] [2025-03-14 01:33:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:50,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:33:50,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:50,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:33:50,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:33:50,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 969 out of 1057 [2025-03-14 01:33:50,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 962 transitions, 1941 flow. Second operand has 3 states, 3 states have (on average 970.3333333333334) internal successors, (2911), 3 states have internal predecessors, (2911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:50,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:50,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 969 of 1057 [2025-03-14 01:33:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:50,954 INFO L124 PetriNetUnfolderBase]: 247/4828 cut-off events. [2025-03-14 01:33:50,954 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:33:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 4828 events. 247/4828 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 36318 event pairs, 110 based on Foata normal form. 1/4167 useless extension candidates. Maximal degree in co-relation 5062. Up to 306 conditions per place. [2025-03-14 01:33:51,010 INFO L140 encePairwiseOnDemand]: 1054/1057 looper letters, 27 selfloop transitions, 2 changer transitions 0/963 dead transitions. [2025-03-14 01:33:51,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 963 transitions, 2001 flow [2025-03-14 01:33:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:33:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:33:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2937 transitions. [2025-03-14 01:33:51,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9262062440870388 [2025-03-14 01:33:51,015 INFO L175 Difference]: Start difference. First operand has 957 places, 962 transitions, 1941 flow. Second operand 3 states and 2937 transitions. [2025-03-14 01:33:51,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 963 transitions, 2001 flow [2025-03-14 01:33:51,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 963 transitions, 1991 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:33:51,029 INFO L231 Difference]: Finished difference. Result has 949 places, 963 transitions, 1943 flow [2025-03-14 01:33:51,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1943, PETRI_PLACES=949, PETRI_TRANSITIONS=963} [2025-03-14 01:33:51,031 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -32 predicate places. [2025-03-14 01:33:51,032 INFO L471 AbstractCegarLoop]: Abstraction has has 949 places, 963 transitions, 1943 flow [2025-03-14 01:33:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 970.3333333333334) internal successors, (2911), 3 states have internal predecessors, (2911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:51,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:51,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:51,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:33:51,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:33:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1017150937, now seen corresponding path program 1 times [2025-03-14 01:33:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412831307] [2025-03-14 01:33:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:51,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:33:51,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:33:51,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:51,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412831307] [2025-03-14 01:33:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412831307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:51,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250727272] [2025-03-14 01:33:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:51,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:52,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 1057 [2025-03-14 01:33:52,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 963 transitions, 1943 flow. Second operand has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:52,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:52,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 1057 [2025-03-14 01:33:52,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:00,993 INFO L124 PetriNetUnfolderBase]: 12711/59669 cut-off events. [2025-03-14 01:34:00,993 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-14 01:34:01,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83093 conditions, 59669 events. 12711/59669 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 695031 event pairs, 11413 based on Foata normal form. 0/52501 useless extension candidates. Maximal degree in co-relation 83009. Up to 23402 conditions per place. [2025-03-14 01:34:01,236 INFO L140 encePairwiseOnDemand]: 1051/1057 looper letters, 240 selfloop transitions, 5 changer transitions 0/962 dead transitions. [2025-03-14 01:34:01,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 962 transitions, 2431 flow [2025-03-14 01:34:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4757 transitions. [2025-03-14 01:34:01,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.750078839482813 [2025-03-14 01:34:01,244 INFO L175 Difference]: Start difference. First operand has 949 places, 963 transitions, 1943 flow. Second operand 6 states and 4757 transitions. [2025-03-14 01:34:01,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 962 transitions, 2431 flow [2025-03-14 01:34:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 962 transitions, 2429 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:34:01,259 INFO L231 Difference]: Finished difference. Result has 952 places, 962 transitions, 1949 flow [2025-03-14 01:34:01,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1939, PETRI_DIFFERENCE_MINUEND_PLACES=947, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1949, PETRI_PLACES=952, PETRI_TRANSITIONS=962} [2025-03-14 01:34:01,261 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -29 predicate places. [2025-03-14 01:34:01,261 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 962 transitions, 1949 flow [2025-03-14 01:34:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:01,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:01,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:34:01,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:34:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1986067608, now seen corresponding path program 1 times [2025-03-14 01:34:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548292095] [2025-03-14 01:34:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:01,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:34:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:34:01,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548292095] [2025-03-14 01:34:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548292095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969776593] [2025-03-14 01:34:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:01,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:01,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:02,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 1057 [2025-03-14 01:34:02,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 962 transitions, 1949 flow. Second operand has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:02,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:02,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 1057 [2025-03-14 01:34:02,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:11,746 INFO L124 PetriNetUnfolderBase]: 12711/59667 cut-off events. [2025-03-14 01:34:11,746 INFO L125 PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES. [2025-03-14 01:34:11,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83100 conditions, 59667 events. 12711/59667 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 695154 event pairs, 11413 based on Foata normal form. 0/52501 useless extension candidates. Maximal degree in co-relation 83002. Up to 23402 conditions per place. [2025-03-14 01:34:11,958 INFO L140 encePairwiseOnDemand]: 1051/1057 looper letters, 240 selfloop transitions, 5 changer transitions 0/961 dead transitions. [2025-03-14 01:34:11,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 961 transitions, 2437 flow [2025-03-14 01:34:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4757 transitions. [2025-03-14 01:34:11,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.750078839482813 [2025-03-14 01:34:11,964 INFO L175 Difference]: Start difference. First operand has 952 places, 962 transitions, 1949 flow. Second operand 6 states and 4757 transitions. [2025-03-14 01:34:11,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 961 transitions, 2437 flow [2025-03-14 01:34:11,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 961 transitions, 2427 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:34:11,975 INFO L231 Difference]: Finished difference. Result has 951 places, 961 transitions, 1947 flow [2025-03-14 01:34:11,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1947, PETRI_PLACES=951, PETRI_TRANSITIONS=961} [2025-03-14 01:34:11,976 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -30 predicate places. [2025-03-14 01:34:11,976 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 961 transitions, 1947 flow [2025-03-14 01:34:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 753.5) internal successors, (4521), 6 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:11,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:11,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:34:11,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:34:11,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1072177361, now seen corresponding path program 1 times [2025-03-14 01:34:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926283063] [2025-03-14 01:34:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:11,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-14 01:34:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-14 01:34:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:12,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926283063] [2025-03-14 01:34:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926283063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:34:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270051591] [2025-03-14 01:34:12,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:34:12,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:34:12,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:34:12,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:34:12,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-14 01:34:12,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-14 01:34:12,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:12,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:34:12,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:34:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:12,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:34:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270051591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:34:12,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:34:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-14 01:34:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434411643] [2025-03-14 01:34:12,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:34:12,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:12,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:12,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:12,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:12,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 968 out of 1057 [2025-03-14 01:34:12,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 961 transitions, 1947 flow. Second operand has 6 states, 6 states have (on average 970.1666666666666) internal successors, (5821), 6 states have internal predecessors, (5821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:12,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:12,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 968 of 1057 [2025-03-14 01:34:12,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:13,051 INFO L124 PetriNetUnfolderBase]: 247/4854 cut-off events. [2025-03-14 01:34:13,052 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:34:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 4854 events. 247/4854 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 36132 event pairs, 110 based on Foata normal form. 2/4198 useless extension candidates. Maximal degree in co-relation 5045. Up to 305 conditions per place. [2025-03-14 01:34:13,105 INFO L140 encePairwiseOnDemand]: 1053/1057 looper letters, 29 selfloop transitions, 5 changer transitions 0/965 dead transitions. [2025-03-14 01:34:13,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 965 transitions, 2025 flow [2025-03-14 01:34:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:34:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:34:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4876 transitions. [2025-03-14 01:34:13,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9226111636707663 [2025-03-14 01:34:13,112 INFO L175 Difference]: Start difference. First operand has 951 places, 961 transitions, 1947 flow. Second operand 5 states and 4876 transitions. [2025-03-14 01:34:13,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 965 transitions, 2025 flow [2025-03-14 01:34:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 950 places, 965 transitions, 2015 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:34:13,123 INFO L231 Difference]: Finished difference. Result has 953 places, 963 transitions, 1967 flow [2025-03-14 01:34:13,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=946, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1967, PETRI_PLACES=953, PETRI_TRANSITIONS=963} [2025-03-14 01:34:13,125 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -28 predicate places. [2025-03-14 01:34:13,125 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 963 transitions, 1967 flow [2025-03-14 01:34:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 970.1666666666666) internal successors, (5821), 6 states have internal predecessors, (5821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:13,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:13,128 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:13,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:34:13,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:34:13,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:34:13,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1360158617, now seen corresponding path program 2 times [2025-03-14 01:34:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723823233] [2025-03-14 01:34:13,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:34:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:13,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-03-14 01:34:13,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 51 of 135 statements. [2025-03-14 01:34:13,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:34:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-14 01:34:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723823233] [2025-03-14 01:34:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723823233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578802690] [2025-03-14 01:34:13,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:13,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:13,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:13,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:14,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 1057 [2025-03-14 01:34:14,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 963 transitions, 1967 flow. Second operand has 6 states, 6 states have (on average 752.3333333333334) internal successors, (4514), 6 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:14,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:14,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 1057 [2025-03-14 01:34:14,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:23,913 INFO L124 PetriNetUnfolderBase]: 12501/59247 cut-off events. [2025-03-14 01:34:23,913 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2025-03-14 01:34:24,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82299 conditions, 59247 events. 12501/59247 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 690583 event pairs, 11211 based on Foata normal form. 0/52142 useless extension candidates. Maximal degree in co-relation 82119. Up to 23014 conditions per place. [2025-03-14 01:34:24,178 INFO L140 encePairwiseOnDemand]: 1045/1057 looper letters, 236 selfloop transitions, 10 changer transitions 0/961 dead transitions. [2025-03-14 01:34:24,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 956 places, 961 transitions, 2455 flow [2025-03-14 01:34:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4742 transitions. [2025-03-14 01:34:24,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7477136549984232 [2025-03-14 01:34:24,184 INFO L175 Difference]: Start difference. First operand has 953 places, 963 transitions, 1967 flow. Second operand 6 states and 4742 transitions. [2025-03-14 01:34:24,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 956 places, 961 transitions, 2455 flow [2025-03-14 01:34:24,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 961 transitions, 2449 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:34:24,196 INFO L231 Difference]: Finished difference. Result has 955 places, 961 transitions, 1977 flow [2025-03-14 01:34:24,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1057, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=951, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1977, PETRI_PLACES=955, PETRI_TRANSITIONS=961} [2025-03-14 01:34:24,199 INFO L279 CegarLoopForPetriNet]: 981 programPoint places, -26 predicate places. [2025-03-14 01:34:24,199 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 961 transitions, 1977 flow [2025-03-14 01:34:24,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.3333333333334) internal successors, (4514), 6 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:24,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:24,201 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:24,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:34:24,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-14 01:34:24,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash -55900377, now seen corresponding path program 1 times [2025-03-14 01:34:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579324424] [2025-03-14 01:34:24,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:24,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:34:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:34:24,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:24,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-14 01:34:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579324424] [2025-03-14 01:34:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579324424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:34:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697720386] [2025-03-14 01:34:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:24,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:34:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:34:24,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:34:25,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 1057 [2025-03-14 01:34:25,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 961 transitions, 1977 flow. Second operand has 6 states, 6 states have (on average 752.3333333333334) internal successors, (4514), 6 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:25,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:25,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 1057 [2025-03-14 01:34:25,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand