./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_5-container_of.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/ldv-races/race-2_5-container_of.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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:30:13,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:30:13,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:30:13,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:30:13,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:30:13,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:30:13,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:30:13,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:30:13,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:30:13,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:30:13,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:30:13,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:30:13,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:30:13,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:30:13,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:30:13,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:30:13,486 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2025-03-14 01:30:13,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:30:13,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:30:13,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:30:13,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:30:13,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:30:13,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2025-03-14 01:30:15,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457421f15/f6629bdd309d475a927827df361bf401/FLAG165f6244a [2025-03-14 01:30:15,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:30:15,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2025-03-14 01:30:15,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457421f15/f6629bdd309d475a927827df361bf401/FLAG165f6244a [2025-03-14 01:30:15,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457421f15/f6629bdd309d475a927827df361bf401 [2025-03-14 01:30:15,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:30:15,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:30:15,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:30:15,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:30:15,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:30:15,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15, skipping insertion in model container [2025-03-14 01:30:15,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:30:15,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:30:15,810 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:30:15,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:30:15,905 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:30:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15 WrapperNode [2025-03-14 01:30:15,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:30:15,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:30:15,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:30:15,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:30:15,913 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:30:15" (1/1) ... [2025-03-14 01:30:15,930 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:30:15" (1/1) ... [2025-03-14 01:30:15,953 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 238 [2025-03-14 01:30:15,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:30:15,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:30:15,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:30:15,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:30:15,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:15,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:16,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:30:16,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:30:16,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:30:16,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:30:16,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (1/1) ... [2025-03-14 01:30:16,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:30:16,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:30:16,036 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:30:16,041 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:30:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-14 01:30:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-14 01:30:16,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:30:16,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:30:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:30:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:30:16,059 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:30:16,289 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:30:16,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:30:16,698 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:30:16,699 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:30:16,699 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:30:16,803 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:30:16,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:16 BoogieIcfgContainer [2025-03-14 01:30:16,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:30:16,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:30:16,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:30:16,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:30:16,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:30:15" (1/3) ... [2025-03-14 01:30:16,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9485d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:16, skipping insertion in model container [2025-03-14 01:30:16,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:30:15" (2/3) ... [2025-03-14 01:30:16,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd9485d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:30:16, skipping insertion in model container [2025-03-14 01:30:16,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:16" (3/3) ... [2025-03-14 01:30:16,813 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2025-03-14 01:30:16,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:30:16,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_5-container_of.i that has 2 procedures, 236 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-14 01:30:16,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:30:16,903 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:30:16,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 267 transitions, 548 flow [2025-03-14 01:30:17,042 INFO L124 PetriNetUnfolderBase]: 14/351 cut-off events. [2025-03-14 01:30:17,044 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:30:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 351 events. 14/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 716 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 177. Up to 4 conditions per place. [2025-03-14 01:30:17,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 267 transitions, 548 flow [2025-03-14 01:30:17,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 264 transitions, 540 flow [2025-03-14 01:30:17,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:30:17,081 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;@70ddf379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:30:17,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-14 01:30:17,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:30:17,092 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-14 01:30:17,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:30:17,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:17,093 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] [2025-03-14 01:30:17,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2130024136, now seen corresponding path program 1 times [2025-03-14 01:30:17,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:17,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114576067] [2025-03-14 01:30:17,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:17,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:30:17,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:30:17,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:17,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:17,853 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:30:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:17,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114576067] [2025-03-14 01:30:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114576067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:17,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:17,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164575620] [2025-03-14 01:30:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:17,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:17,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:18,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-14 01:30:18,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 264 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 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:30:18,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:18,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-14 01:30:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:18,804 INFO L124 PetriNetUnfolderBase]: 1076/3564 cut-off events. [2025-03-14 01:30:18,804 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-14 01:30:18,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5383 conditions, 3564 events. 1076/3564 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 28503 event pairs, 1075 based on Foata normal form. 140/3494 useless extension candidates. Maximal degree in co-relation 5118. Up to 1790 conditions per place. [2025-03-14 01:30:18,832 INFO L140 encePairwiseOnDemand]: 243/267 looper letters, 47 selfloop transitions, 5 changer transitions 6/233 dead transitions. [2025-03-14 01:30:18,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 233 transitions, 582 flow [2025-03-14 01:30:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-03-14 01:30:18,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634207240948814 [2025-03-14 01:30:18,846 INFO L175 Difference]: Start difference. First operand has 261 places, 264 transitions, 540 flow. Second operand 6 states and 1223 transitions. [2025-03-14 01:30:18,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 233 transitions, 582 flow [2025-03-14 01:30:18,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 233 transitions, 574 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:30:18,856 INFO L231 Difference]: Finished difference. Result has 239 places, 227 transitions, 468 flow [2025-03-14 01:30:18,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=239, PETRI_TRANSITIONS=227} [2025-03-14 01:30:18,860 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -22 predicate places. [2025-03-14 01:30:18,860 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 227 transitions, 468 flow [2025-03-14 01:30:18,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 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:30:18,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:18,861 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-03-14 01:30:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:30:18,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:18,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 743373152, now seen corresponding path program 1 times [2025-03-14 01:30:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540600732] [2025-03-14 01:30:18,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:18,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:30:18,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:30:18,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:18,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:19,236 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:30:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540600732] [2025-03-14 01:30:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540600732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997938908] [2025-03-14 01:30:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:19,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:19,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:19,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-14 01:30:19,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 227 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 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:30:19,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:19,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-14 01:30:19,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:19,963 INFO L124 PetriNetUnfolderBase]: 1076/3557 cut-off events. [2025-03-14 01:30:19,964 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:30:19,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5366 conditions, 3557 events. 1076/3557 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 28440 event pairs, 1075 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 5323. Up to 1790 conditions per place. [2025-03-14 01:30:19,979 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-14 01:30:19,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 226 transitions, 570 flow [2025-03-14 01:30:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2025-03-14 01:30:19,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521847690387016 [2025-03-14 01:30:19,984 INFO L175 Difference]: Start difference. First operand has 239 places, 227 transitions, 468 flow. Second operand 6 states and 1205 transitions. [2025-03-14 01:30:19,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 226 transitions, 570 flow [2025-03-14 01:30:19,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 226 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:30:19,992 INFO L231 Difference]: Finished difference. Result has 232 places, 226 transitions, 466 flow [2025-03-14 01:30:19,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2025-03-14 01:30:19,993 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -29 predicate places. [2025-03-14 01:30:19,994 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 466 flow [2025-03-14 01:30:19,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 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:30:19,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:19,995 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] [2025-03-14 01:30:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:30:19,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:19,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1719989047, now seen corresponding path program 1 times [2025-03-14 01:30:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742477412] [2025-03-14 01:30:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:20,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:30:20,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:30:20,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:20,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:20,067 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:30:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:20,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742477412] [2025-03-14 01:30:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742477412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918044124] [2025-03-14 01:30:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:20,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:20,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-14 01:30:20,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:30:20,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:20,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-14 01:30:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:20,208 INFO L124 PetriNetUnfolderBase]: 181/873 cut-off events. [2025-03-14 01:30:20,208 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:30:20,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 873 events. 181/873 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4846 event pairs, 175 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1175. Up to 330 conditions per place. [2025-03-14 01:30:20,215 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-14 01:30:20,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 230 transitions, 534 flow [2025-03-14 01:30:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-14 01:30:20,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589263420724095 [2025-03-14 01:30:20,218 INFO L175 Difference]: Start difference. First operand has 232 places, 226 transitions, 466 flow. Second operand 3 states and 688 transitions. [2025-03-14 01:30:20,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 230 transitions, 534 flow [2025-03-14 01:30:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 524 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:30:20,223 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 458 flow [2025-03-14 01:30:20,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2025-03-14 01:30:20,224 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -33 predicate places. [2025-03-14 01:30:20,224 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 458 flow [2025-03-14 01:30:20,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:30:20,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:20,225 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] [2025-03-14 01:30:20,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:30:20,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash -75528943, now seen corresponding path program 1 times [2025-03-14 01:30:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590597358] [2025-03-14 01:30:20,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:20,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:30:20,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:30:20,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:20,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:20,300 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:30:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590597358] [2025-03-14 01:30:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590597358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963183545] [2025-03-14 01:30:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:20,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:20,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:20,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-14 01:30:20,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:30:20,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:20,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-14 01:30:20,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:20,472 INFO L124 PetriNetUnfolderBase]: 175/712 cut-off events. [2025-03-14 01:30:20,472 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:30:20,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 712 events. 175/712 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3186 event pairs, 30 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 905. Up to 250 conditions per place. [2025-03-14 01:30:20,476 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 30 selfloop transitions, 1 changer transitions 0/234 dead transitions. [2025-03-14 01:30:20,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 234 transitions, 538 flow [2025-03-14 01:30:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-14 01:30:20,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2025-03-14 01:30:20,479 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 458 flow. Second operand 3 states and 701 transitions. [2025-03-14 01:30:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 234 transitions, 538 flow [2025-03-14 01:30:20,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 234 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:20,483 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 454 flow [2025-03-14 01:30:20,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-14 01:30:20,485 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-03-14 01:30:20,485 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 454 flow [2025-03-14 01:30:20,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:30:20,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:20,486 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] [2025-03-14 01:30:20,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:30:20,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:20,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1958051995, now seen corresponding path program 1 times [2025-03-14 01:30:20,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:20,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517339661] [2025-03-14 01:30:20,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:20,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:30:20,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:30:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:20,555 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:30:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517339661] [2025-03-14 01:30:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517339661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933400981] [2025-03-14 01:30:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:20,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:20,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:20,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:20,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2025-03-14 01:30:20,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:30:20,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:20,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2025-03-14 01:30:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:20,797 INFO L124 PetriNetUnfolderBase]: 195/1646 cut-off events. [2025-03-14 01:30:20,798 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-03-14 01:30:20,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 1646 events. 195/1646 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 10943 event pairs, 64 based on Foata normal form. 0/1521 useless extension candidates. Maximal degree in co-relation 1740. Up to 279 conditions per place. [2025-03-14 01:30:20,808 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 33 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-03-14 01:30:20,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 542 flow [2025-03-14 01:30:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2025-03-14 01:30:20,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2025-03-14 01:30:20,811 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 454 flow. Second operand 3 states and 693 transitions. [2025-03-14 01:30:20,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 542 flow [2025-03-14 01:30:20,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 233 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:30:20,818 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 455 flow [2025-03-14 01:30:20,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2025-03-14 01:30:20,819 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -34 predicate places. [2025-03-14 01:30:20,819 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 455 flow [2025-03-14 01:30:20,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:30:20,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:20,820 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] [2025-03-14 01:30:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:30:20,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:20,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1551407863, now seen corresponding path program 1 times [2025-03-14 01:30:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:20,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427723761] [2025-03-14 01:30:20,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:20,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:30:20,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:30:20,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:20,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:21,209 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:30:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427723761] [2025-03-14 01:30:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427723761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:21,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:21,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305669956] [2025-03-14 01:30:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:21,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:21,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:21,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-14 01:30:21,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:30:21,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:21,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-14 01:30:21,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:21,967 INFO L124 PetriNetUnfolderBase]: 1267/3824 cut-off events. [2025-03-14 01:30:21,967 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:30:21,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 3824 events. 1267/3824 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 29243 event pairs, 807 based on Foata normal form. 0/3651 useless extension candidates. Maximal degree in co-relation 5750. Up to 1776 conditions per place. [2025-03-14 01:30:21,987 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 61 selfloop transitions, 30 changer transitions 7/268 dead transitions. [2025-03-14 01:30:21,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 268 transitions, 733 flow [2025-03-14 01:30:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-14 01:30:21,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-14 01:30:21,991 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 455 flow. Second operand 6 states and 1271 transitions. [2025-03-14 01:30:21,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 268 transitions, 733 flow [2025-03-14 01:30:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 268 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:30:21,996 INFO L231 Difference]: Finished difference. Result has 235 places, 245 transitions, 639 flow [2025-03-14 01:30:21,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=235, PETRI_TRANSITIONS=245} [2025-03-14 01:30:21,998 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -26 predicate places. [2025-03-14 01:30:21,999 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 245 transitions, 639 flow [2025-03-14 01:30:21,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:30:21,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:21,999 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] [2025-03-14 01:30:22,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:30:22,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1772652474, now seen corresponding path program 1 times [2025-03-14 01:30:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270104518] [2025-03-14 01:30:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:30:22,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:30:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:22,366 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:30:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270104518] [2025-03-14 01:30:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270104518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169015947] [2025-03-14 01:30:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:22,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:22,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:22,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:22,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2025-03-14 01:30:22,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 245 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:30:22,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:22,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2025-03-14 01:30:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:23,391 INFO L124 PetriNetUnfolderBase]: 1489/3708 cut-off events. [2025-03-14 01:30:23,392 INFO L125 PetriNetUnfolderBase]: For 1053/1097 co-relation queries the response was YES. [2025-03-14 01:30:23,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7662 conditions, 3708 events. 1489/3708 cut-off events. For 1053/1097 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 27139 event pairs, 793 based on Foata normal form. 0/3536 useless extension candidates. Maximal degree in co-relation 5134. Up to 1978 conditions per place. [2025-03-14 01:30:23,408 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 84 selfloop transitions, 30 changer transitions 11/290 dead transitions. [2025-03-14 01:30:23,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 290 transitions, 1007 flow [2025-03-14 01:30:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1268 transitions. [2025-03-14 01:30:23,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915106117353309 [2025-03-14 01:30:23,411 INFO L175 Difference]: Start difference. First operand has 235 places, 245 transitions, 639 flow. Second operand 6 states and 1268 transitions. [2025-03-14 01:30:23,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 290 transitions, 1007 flow [2025-03-14 01:30:23,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 290 transitions, 1007 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:30:23,416 INFO L231 Difference]: Finished difference. Result has 238 places, 263 transitions, 867 flow [2025-03-14 01:30:23,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=238, PETRI_TRANSITIONS=263} [2025-03-14 01:30:23,417 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -23 predicate places. [2025-03-14 01:30:23,417 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 263 transitions, 867 flow [2025-03-14 01:30:23,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:30:23,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:23,418 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] [2025-03-14 01:30:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:30:23,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1943102281, now seen corresponding path program 1 times [2025-03-14 01:30:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84081966] [2025-03-14 01:30:23,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:23,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-14 01:30:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-14 01:30:23,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:23,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:23,761 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:30:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84081966] [2025-03-14 01:30:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84081966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146384119] [2025-03-14 01:30:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:23,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:23,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:24,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-14 01:30:24,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 263 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:30:24,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-14 01:30:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:24,782 INFO L124 PetriNetUnfolderBase]: 1656/4307 cut-off events. [2025-03-14 01:30:24,783 INFO L125 PetriNetUnfolderBase]: For 2811/2917 co-relation queries the response was YES. [2025-03-14 01:30:24,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10408 conditions, 4307 events. 1656/4307 cut-off events. For 2811/2917 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 33888 event pairs, 667 based on Foata normal form. 0/4181 useless extension candidates. Maximal degree in co-relation 6805. Up to 2129 conditions per place. [2025-03-14 01:30:24,808 INFO L140 encePairwiseOnDemand]: 251/267 looper letters, 115 selfloop transitions, 26 changer transitions 0/307 dead transitions. [2025-03-14 01:30:24,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 307 transitions, 1337 flow [2025-03-14 01:30:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1273 transitions. [2025-03-14 01:30:24,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7946317103620475 [2025-03-14 01:30:24,810 INFO L175 Difference]: Start difference. First operand has 238 places, 263 transitions, 867 flow. Second operand 6 states and 1273 transitions. [2025-03-14 01:30:24,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 307 transitions, 1337 flow [2025-03-14 01:30:24,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 307 transitions, 1289 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-14 01:30:24,818 INFO L231 Difference]: Finished difference. Result has 236 places, 283 transitions, 1051 flow [2025-03-14 01:30:24,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=236, PETRI_TRANSITIONS=283} [2025-03-14 01:30:24,819 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-03-14 01:30:24,819 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 283 transitions, 1051 flow [2025-03-14 01:30:24,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:30:24,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:24,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:24,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:30:24,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:24,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1385073339, now seen corresponding path program 1 times [2025-03-14 01:30:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:24,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232479611] [2025-03-14 01:30:24,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:24,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:30:24,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:30:24,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:24,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:25,183 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:30:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:25,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232479611] [2025-03-14 01:30:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232479611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:25,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:25,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:25,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247975913] [2025-03-14 01:30:25,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:30:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:25,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:30:25,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:30:25,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 267 [2025-03-14 01:30:25,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 283 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:30:25,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:25,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 267 [2025-03-14 01:30:25,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:25,973 INFO L124 PetriNetUnfolderBase]: 2004/4646 cut-off events. [2025-03-14 01:30:25,973 INFO L125 PetriNetUnfolderBase]: For 5578/5834 co-relation queries the response was YES. [2025-03-14 01:30:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13033 conditions, 4646 events. 2004/4646 cut-off events. For 5578/5834 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 35025 event pairs, 767 based on Foata normal form. 70/4577 useless extension candidates. Maximal degree in co-relation 10165. Up to 2513 conditions per place. [2025-03-14 01:30:26,007 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 128 selfloop transitions, 36 changer transitions 37/342 dead transitions. [2025-03-14 01:30:26,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 342 transitions, 1771 flow [2025-03-14 01:30:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions. [2025-03-14 01:30:26,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933832709113608 [2025-03-14 01:30:26,010 INFO L175 Difference]: Start difference. First operand has 236 places, 283 transitions, 1051 flow. Second operand 6 states and 1271 transitions. [2025-03-14 01:30:26,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 342 transitions, 1771 flow [2025-03-14 01:30:26,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 342 transitions, 1771 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:30:26,020 INFO L231 Difference]: Finished difference. Result has 244 places, 281 transitions, 1383 flow [2025-03-14 01:30:26,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1383, PETRI_PLACES=244, PETRI_TRANSITIONS=281} [2025-03-14 01:30:26,021 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -17 predicate places. [2025-03-14 01:30:26,022 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 281 transitions, 1383 flow [2025-03-14 01:30:26,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 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:30:26,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:26,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:30:26,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 412824787, now seen corresponding path program 1 times [2025-03-14 01:30:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032106034] [2025-03-14 01:30:26,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:26,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:30:26,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:30:26,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:26,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:26,130 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:30:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032106034] [2025-03-14 01:30:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032106034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:26,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:30:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869038694] [2025-03-14 01:30:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:30:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:26,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:30:26,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:30:26,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2025-03-14 01:30:26,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 281 transitions, 1383 flow. Second operand has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 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:30:26,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:26,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2025-03-14 01:30:26,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:26,363 INFO L124 PetriNetUnfolderBase]: 355/1034 cut-off events. [2025-03-14 01:30:26,363 INFO L125 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2025-03-14 01:30:26,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 1034 events. 355/1034 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6166 event pairs, 30 based on Foata normal form. 0/1028 useless extension candidates. Maximal degree in co-relation 2467. Up to 247 conditions per place. [2025-03-14 01:30:26,371 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 61 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2025-03-14 01:30:26,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 164 transitions, 662 flow [2025-03-14 01:30:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:30:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:30:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-14 01:30:26,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846441947565543 [2025-03-14 01:30:26,375 INFO L175 Difference]: Start difference. First operand has 244 places, 281 transitions, 1383 flow. Second operand 6 states and 1356 transitions. [2025-03-14 01:30:26,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 164 transitions, 662 flow [2025-03-14 01:30:26,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 522 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-14 01:30:26,379 INFO L231 Difference]: Finished difference. Result has 150 places, 124 transitions, 272 flow [2025-03-14 01:30:26,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=150, PETRI_TRANSITIONS=124} [2025-03-14 01:30:26,380 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -111 predicate places. [2025-03-14 01:30:26,380 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 124 transitions, 272 flow [2025-03-14 01:30:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 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:30:26,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:30:26,381 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, 1, 1, 1, 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:30:26,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:30:26,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:30:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:30:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2043214243, now seen corresponding path program 1 times [2025-03-14 01:30:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:30:26,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482060846] [2025-03-14 01:30:26,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:30:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:30:26,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-14 01:30:26,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-14 01:30:26,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:30:26,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:30:26,465 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:30:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:30:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482060846] [2025-03-14 01:30:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482060846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:30:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:30:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:30:26,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928484811] [2025-03-14 01:30:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:30:26,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:30:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:30:26,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:30:26,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:30:26,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2025-03-14 01:30:26,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 124 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:30:26,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:30:26,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2025-03-14 01:30:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:30:26,557 INFO L124 PetriNetUnfolderBase]: 70/354 cut-off events. [2025-03-14 01:30:26,557 INFO L125 PetriNetUnfolderBase]: For 41/109 co-relation queries the response was YES. [2025-03-14 01:30:26,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 354 events. 70/354 cut-off events. For 41/109 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1358 event pairs, 60 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 599. Up to 139 conditions per place. [2025-03-14 01:30:26,560 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-03-14 01:30:26,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 128 transitions, 336 flow [2025-03-14 01:30:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:30:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:30:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2025-03-14 01:30:26,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867665418227216 [2025-03-14 01:30:26,563 INFO L175 Difference]: Start difference. First operand has 150 places, 124 transitions, 272 flow. Second operand 3 states and 695 transitions. [2025-03-14 01:30:26,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 128 transitions, 336 flow [2025-03-14 01:30:26,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 128 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:30:26,565 INFO L231 Difference]: Finished difference. Result has 147 places, 0 transitions, 0 flow [2025-03-14 01:30:26,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=147, PETRI_TRANSITIONS=0} [2025-03-14 01:30:26,565 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -114 predicate places. [2025-03-14 01:30:26,566 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 0 transitions, 0 flow [2025-03-14 01:30:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 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:30:26,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-14 01:30:26,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-14 01:30:26,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-14 01:30:26,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-14 01:30:26,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:30:26,571 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:30:26,575 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:30:26,575 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:30:26,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:30:26 BasicIcfg [2025-03-14 01:30:26,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:30:26,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:30:26,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:30:26,581 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:30:26,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:30:16" (3/4) ... [2025-03-14 01:30:26,582 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:30:26,585 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-14 01:30:26,589 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-14 01:30:26,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:30:26,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:30:26,590 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:30:26,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:30:26,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:30:26,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:30:26,670 INFO L158 Benchmark]: Toolchain (without parser) took 11293.60ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 109.3MB in the beginning and 439.0MB in the end (delta: -329.7MB). Peak memory consumption was 229.6MB. Max. memory is 16.1GB. [2025-03-14 01:30:26,670 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:26,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.64ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 77.1MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 01:30:26,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.61ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 73.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:26,671 INFO L158 Benchmark]: Boogie Preprocessor took 45.50ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 69.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:30:26,671 INFO L158 Benchmark]: IcfgBuilder took 803.59ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 84.8MB in the end (delta: -15.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-03-14 01:30:26,671 INFO L158 Benchmark]: TraceAbstraction took 9774.00ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 84.0MB in the beginning and 443.2MB in the end (delta: -359.2MB). Peak memory consumption was 204.7MB. Max. memory is 16.1GB. [2025-03-14 01:30:26,672 INFO L158 Benchmark]: Witness Printer took 89.21ms. Allocated memory is still 704.6MB. Free memory was 443.2MB in the beginning and 439.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:30:26,673 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.33ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.64ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 77.1MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.61ms. Allocated memory is still 142.6MB. Free memory was 77.1MB in the beginning and 73.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.50ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 69.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 803.59ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 84.8MB in the end (delta: -15.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9774.00ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 84.0MB in the beginning and 443.2MB in the end (delta: -359.2MB). Peak memory consumption was 204.7MB. Max. memory is 16.1GB. * Witness Printer took 89.21ms. Allocated memory is still 704.6MB. Free memory was 443.2MB in the beginning and 439.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3929]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3938]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3973]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3941]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3944]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3947]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3952]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3974]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3975]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3976]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3970]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3907]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3910]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3913]: 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 4 procedures, 280 locations, 27 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: 9.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1100 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2925 IncrementalHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 72 mSDtfsCounter, 2925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=9, InterpolantAutomatonStates: 54, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:30:26,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE