./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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_2-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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:59:12,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:59:12,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:59:12,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:59:12,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:59:12,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:59:12,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:59:12,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:59:12,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:59:12,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:59:12,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:59:12,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:59:12,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:12,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:59:12,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:59:12,587 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-03-17 10:59:12,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:59:12,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:59:12,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:59:12,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:59:12,856 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:59:12,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-17 10:59:14,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b83e3f9/12f21d75602a46deaad2ccebf6d159cb/FLAGbd07b919b [2025-03-17 10:59:14,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:14,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-17 10:59:14,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b83e3f9/12f21d75602a46deaad2ccebf6d159cb/FLAGbd07b919b [2025-03-17 10:59:14,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b83e3f9/12f21d75602a46deaad2ccebf6d159cb [2025-03-17 10:59:14,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:14,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:14,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:14,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:14,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:14,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:14,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14, skipping insertion in model container [2025-03-17 10:59:14,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:14,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:14,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:14,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:14,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:14,929 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:14,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14 WrapperNode [2025-03-17 10:59:14,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:14,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:14,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:14,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:14,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:14,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:14,991 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 11, calls inlined = 14, statements flattened = 180 [2025-03-17 10:59:14,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:14,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:14,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:14,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:15,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:15,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:15,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:15,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:15,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (1/1) ... [2025-03-17 10:59:15,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:15,070 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-17 10:59:15,073 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-17 10:59:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 10:59:15,092 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:59:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:59:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:15,094 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:59:15,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:15,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:15,688 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:15,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:15,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:15,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:15,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:15 BoogieIcfgContainer [2025-03-17 10:59:15,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:15,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:15,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:15,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:15,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:14" (1/3) ... [2025-03-17 10:59:15,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2a999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:15, skipping insertion in model container [2025-03-17 10:59:15,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:14" (2/3) ... [2025-03-17 10:59:15,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c2a999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:15, skipping insertion in model container [2025-03-17 10:59:15,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:15" (3/3) ... [2025-03-17 10:59:15,795 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-03-17 10:59:15,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:15,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 223 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-03-17 10:59:15,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:15,887 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:59:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 250 transitions, 514 flow [2025-03-17 10:59:15,998 INFO L124 PetriNetUnfolderBase]: 14/333 cut-off events. [2025-03-17 10:59:15,999 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:16,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 333 events. 14/333 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 663 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 172. Up to 4 conditions per place. [2025-03-17 10:59:16,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 250 transitions, 514 flow [2025-03-17 10:59:16,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 247 transitions, 506 flow [2025-03-17 10:59:16,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:16,030 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;@3c3aa750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:16,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 10:59:16,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:16,038 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-17 10:59:16,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:16,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:16,039 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-17 10:59:16,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:16,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1225402597, now seen corresponding path program 1 times [2025-03-17 10:59:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141879239] [2025-03-17 10:59:16,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:16,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:59:16,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:59:16,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:16,892 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-17 10:59:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:16,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141879239] [2025-03-17 10:59:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141879239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732815282] [2025-03-17 10:59:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:16,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:16,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:16,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:17,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2025-03-17 10:59:17,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 247 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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-17 10:59:17,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:17,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2025-03-17 10:59:17,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:17,571 INFO L124 PetriNetUnfolderBase]: 424/1646 cut-off events. [2025-03-17 10:59:17,572 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2025-03-17 10:59:17,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 1646 events. 424/1646 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11018 event pairs, 423 based on Foata normal form. 72/1607 useless extension candidates. Maximal degree in co-relation 2173. Up to 750 conditions per place. [2025-03-17 10:59:17,589 INFO L140 encePairwiseOnDemand]: 230/250 looper letters, 39 selfloop transitions, 5 changer transitions 6/220 dead transitions. [2025-03-17 10:59:17,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 220 transitions, 540 flow [2025-03-17 10:59:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1181 transitions. [2025-03-17 10:59:17,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7873333333333333 [2025-03-17 10:59:17,610 INFO L175 Difference]: Start difference. First operand has 244 places, 247 transitions, 506 flow. Second operand 6 states and 1181 transitions. [2025-03-17 10:59:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 220 transitions, 540 flow [2025-03-17 10:59:17,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 220 transitions, 532 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:17,622 INFO L231 Difference]: Finished difference. Result has 226 places, 214 transitions, 442 flow [2025-03-17 10:59:17,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=226, PETRI_TRANSITIONS=214} [2025-03-17 10:59:17,628 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -18 predicate places. [2025-03-17 10:59:17,630 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 214 transitions, 442 flow [2025-03-17 10:59:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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-17 10:59:17,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:17,631 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-17 10:59:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:17,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -419620302, now seen corresponding path program 1 times [2025-03-17 10:59:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83882185] [2025-03-17 10:59:17,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:17,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:59:17,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:59:17,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:17,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:18,052 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-17 10:59:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83882185] [2025-03-17 10:59:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83882185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:18,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:18,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:18,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820003002] [2025-03-17 10:59:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:18,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:18,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:18,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2025-03-17 10:59:18,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 214 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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-17 10:59:18,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:18,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2025-03-17 10:59:18,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:18,501 INFO L124 PetriNetUnfolderBase]: 424/1639 cut-off events. [2025-03-17 10:59:18,501 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-17 10:59:18,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 1639 events. 424/1639 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10947 event pairs, 423 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 2363. Up to 750 conditions per place. [2025-03-17 10:59:18,512 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 39 selfloop transitions, 5 changer transitions 0/213 dead transitions. [2025-03-17 10:59:18,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 213 transitions, 528 flow [2025-03-17 10:59:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1167 transitions. [2025-03-17 10:59:18,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.778 [2025-03-17 10:59:18,517 INFO L175 Difference]: Start difference. First operand has 226 places, 214 transitions, 442 flow. Second operand 6 states and 1167 transitions. [2025-03-17 10:59:18,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 213 transitions, 528 flow [2025-03-17 10:59:18,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 213 transitions, 518 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:18,521 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 440 flow [2025-03-17 10:59:18,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-03-17 10:59:18,522 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -25 predicate places. [2025-03-17 10:59:18,523 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 440 flow [2025-03-17 10:59:18,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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-17 10:59:18,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:18,523 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-17 10:59:18,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:18,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:18,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2043211345, now seen corresponding path program 1 times [2025-03-17 10:59:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519288441] [2025-03-17 10:59:18,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 10:59:18,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 10:59:18,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:18,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:18,597 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-17 10:59:18,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:18,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519288441] [2025-03-17 10:59:18,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519288441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:18,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:18,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37399517] [2025-03-17 10:59:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:18,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:18,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:18,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:18,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 250 [2025-03-17 10:59:18,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-17 10:59:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:18,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 250 [2025-03-17 10:59:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:18,736 INFO L124 PetriNetUnfolderBase]: 67/997 cut-off events. [2025-03-17 10:59:18,737 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-17 10:59:18,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 997 events. 67/997 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5804 event pairs, 27 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1093. Up to 128 conditions per place. [2025-03-17 10:59:18,744 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 18 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-03-17 10:59:18,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 484 flow [2025-03-17 10:59:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-03-17 10:59:18,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.884 [2025-03-17 10:59:18,748 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 440 flow. Second operand 3 states and 663 transitions. [2025-03-17 10:59:18,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 484 flow [2025-03-17 10:59:18,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:18,754 INFO L231 Difference]: Finished difference. Result has 215 places, 212 transitions, 432 flow [2025-03-17 10:59:18,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=215, PETRI_TRANSITIONS=212} [2025-03-17 10:59:18,755 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -29 predicate places. [2025-03-17 10:59:18,755 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 212 transitions, 432 flow [2025-03-17 10:59:18,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-17 10:59:18,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:18,756 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-17 10:59:18,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:18,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:18,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 220393650, now seen corresponding path program 1 times [2025-03-17 10:59:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:18,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512759587] [2025-03-17 10:59:18,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:18,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 10:59:18,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 10:59:18,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:18,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:18,839 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-17 10:59:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512759587] [2025-03-17 10:59:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512759587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:18,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148393821] [2025-03-17 10:59:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:18,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:18,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:18,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 250 [2025-03-17 10:59:18,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 212 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-17 10:59:18,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:18,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 250 [2025-03-17 10:59:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:18,933 INFO L124 PetriNetUnfolderBase]: 63/478 cut-off events. [2025-03-17 10:59:18,934 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:18,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 478 events. 63/478 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1585 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 470. Up to 90 conditions per place. [2025-03-17 10:59:18,936 INFO L140 encePairwiseOnDemand]: 248/250 looper letters, 18 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2025-03-17 10:59:18,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 217 transitions, 480 flow [2025-03-17 10:59:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2025-03-17 10:59:18,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986666666666666 [2025-03-17 10:59:18,938 INFO L175 Difference]: Start difference. First operand has 215 places, 212 transitions, 432 flow. Second operand 3 states and 674 transitions. [2025-03-17 10:59:18,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 217 transitions, 480 flow [2025-03-17 10:59:18,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 217 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:18,942 INFO L231 Difference]: Finished difference. Result has 214 places, 211 transitions, 428 flow [2025-03-17 10:59:18,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=214, PETRI_TRANSITIONS=211} [2025-03-17 10:59:18,944 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -30 predicate places. [2025-03-17 10:59:18,944 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 211 transitions, 428 flow [2025-03-17 10:59:18,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 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-17 10:59:18,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:18,944 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-17 10:59:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:18,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash 867841125, now seen corresponding path program 1 times [2025-03-17 10:59:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381951543] [2025-03-17 10:59:18,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:18,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:19,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:19,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381951543] [2025-03-17 10:59:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381951543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:19,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328209917] [2025-03-17 10:59:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:19,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:19,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:19,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:19,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 250 [2025-03-17 10:59:19,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 211 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 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-17 10:59:19,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:19,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 250 [2025-03-17 10:59:19,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:19,959 INFO L124 PetriNetUnfolderBase]: 507/1774 cut-off events. [2025-03-17 10:59:19,959 INFO L125 PetriNetUnfolderBase]: For 5/13 co-relation queries the response was YES. [2025-03-17 10:59:19,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1774 events. 507/1774 cut-off events. For 5/13 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 10964 event pairs, 309 based on Foata normal form. 0/1686 useless extension candidates. Maximal degree in co-relation 2541. Up to 803 conditions per place. [2025-03-17 10:59:19,967 INFO L140 encePairwiseOnDemand]: 237/250 looper letters, 37 selfloop transitions, 30 changer transitions 7/240 dead transitions. [2025-03-17 10:59:19,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 240 transitions, 626 flow [2025-03-17 10:59:19,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2025-03-17 10:59:19,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8113333333333334 [2025-03-17 10:59:19,971 INFO L175 Difference]: Start difference. First operand has 214 places, 211 transitions, 428 flow. Second operand 6 states and 1217 transitions. [2025-03-17 10:59:19,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 240 transitions, 626 flow [2025-03-17 10:59:19,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 240 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:19,978 INFO L231 Difference]: Finished difference. Result has 223 places, 233 transitions, 615 flow [2025-03-17 10:59:19,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=223, PETRI_TRANSITIONS=233} [2025-03-17 10:59:19,981 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -21 predicate places. [2025-03-17 10:59:19,981 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 233 transitions, 615 flow [2025-03-17 10:59:19,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 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-17 10:59:19,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:19,982 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-17 10:59:19,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:19,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:19,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1984986079, now seen corresponding path program 1 times [2025-03-17 10:59:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:19,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207073670] [2025-03-17 10:59:19,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:20,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 10:59:20,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 10:59:20,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:20,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207073670] [2025-03-17 10:59:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207073670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884507006] [2025-03-17 10:59:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:20,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:20,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 250 [2025-03-17 10:59:20,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 233 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-17 10:59:20,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:20,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 250 [2025-03-17 10:59:20,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:20,232 INFO L124 PetriNetUnfolderBase]: 313/1192 cut-off events. [2025-03-17 10:59:20,232 INFO L125 PetriNetUnfolderBase]: For 383/421 co-relation queries the response was YES. [2025-03-17 10:59:20,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1192 events. 313/1192 cut-off events. For 383/421 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6419 event pairs, 114 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1426. Up to 363 conditions per place. [2025-03-17 10:59:20,240 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 45 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-03-17 10:59:20,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 238 transitions, 731 flow [2025-03-17 10:59:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-03-17 10:59:20,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888 [2025-03-17 10:59:20,243 INFO L175 Difference]: Start difference. First operand has 223 places, 233 transitions, 615 flow. Second operand 3 states and 666 transitions. [2025-03-17 10:59:20,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 238 transitions, 731 flow [2025-03-17 10:59:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 238 transitions, 731 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:20,249 INFO L231 Difference]: Finished difference. Result has 217 places, 232 transitions, 617 flow [2025-03-17 10:59:20,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=217, PETRI_TRANSITIONS=232} [2025-03-17 10:59:20,250 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -27 predicate places. [2025-03-17 10:59:20,250 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 232 transitions, 617 flow [2025-03-17 10:59:20,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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-17 10:59:20,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:20,251 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] [2025-03-17 10:59:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:20,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:20,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash 78646499, now seen corresponding path program 1 times [2025-03-17 10:59:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928227831] [2025-03-17 10:59:20,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:20,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 10:59:20,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 10:59:20,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:20,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928227831] [2025-03-17 10:59:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928227831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630681071] [2025-03-17 10:59:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:20,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:20,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:20,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 250 [2025-03-17 10:59:20,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 232 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 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-17 10:59:20,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:20,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 250 [2025-03-17 10:59:20,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:21,225 INFO L124 PetriNetUnfolderBase]: 665/1833 cut-off events. [2025-03-17 10:59:21,226 INFO L125 PetriNetUnfolderBase]: For 602/616 co-relation queries the response was YES. [2025-03-17 10:59:21,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1833 events. 665/1833 cut-off events. For 602/616 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10916 event pairs, 306 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 3782. Up to 931 conditions per place. [2025-03-17 10:59:21,239 INFO L140 encePairwiseOnDemand]: 237/250 looper letters, 60 selfloop transitions, 30 changer transitions 11/261 dead transitions. [2025-03-17 10:59:21,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 261 transitions, 905 flow [2025-03-17 10:59:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1214 transitions. [2025-03-17 10:59:21,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8093333333333333 [2025-03-17 10:59:21,243 INFO L175 Difference]: Start difference. First operand has 217 places, 232 transitions, 617 flow. Second operand 6 states and 1214 transitions. [2025-03-17 10:59:21,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 261 transitions, 905 flow [2025-03-17 10:59:21,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 261 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:21,251 INFO L231 Difference]: Finished difference. Result has 225 places, 250 transitions, 841 flow [2025-03-17 10:59:21,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=841, PETRI_PLACES=225, PETRI_TRANSITIONS=250} [2025-03-17 10:59:21,253 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -19 predicate places. [2025-03-17 10:59:21,253 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 250 transitions, 841 flow [2025-03-17 10:59:21,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 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-17 10:59:21,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:21,255 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] [2025-03-17 10:59:21,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:21,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 907484466, now seen corresponding path program 1 times [2025-03-17 10:59:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572724501] [2025-03-17 10:59:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:21,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:59:21,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:59:21,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:21,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572724501] [2025-03-17 10:59:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572724501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:21,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986748291] [2025-03-17 10:59:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:21,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:21,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 250 [2025-03-17 10:59:21,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 250 transitions, 841 flow. Second operand has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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-17 10:59:21,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:21,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 250 [2025-03-17 10:59:21,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:22,328 INFO L124 PetriNetUnfolderBase]: 742/2020 cut-off events. [2025-03-17 10:59:22,328 INFO L125 PetriNetUnfolderBase]: For 1323/1382 co-relation queries the response was YES. [2025-03-17 10:59:22,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 2020 events. 742/2020 cut-off events. For 1323/1382 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12474 event pairs, 212 based on Foata normal form. 0/1973 useless extension candidates. Maximal degree in co-relation 3658. Up to 981 conditions per place. [2025-03-17 10:59:22,347 INFO L140 encePairwiseOnDemand]: 234/250 looper letters, 91 selfloop transitions, 26 changer transitions 0/278 dead transitions. [2025-03-17 10:59:22,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 278 transitions, 1231 flow [2025-03-17 10:59:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1219 transitions. [2025-03-17 10:59:22,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8126666666666666 [2025-03-17 10:59:22,351 INFO L175 Difference]: Start difference. First operand has 225 places, 250 transitions, 841 flow. Second operand 6 states and 1219 transitions. [2025-03-17 10:59:22,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 278 transitions, 1231 flow [2025-03-17 10:59:22,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 278 transitions, 1183 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:22,359 INFO L231 Difference]: Finished difference. Result has 223 places, 270 transitions, 1025 flow [2025-03-17 10:59:22,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=223, PETRI_TRANSITIONS=270} [2025-03-17 10:59:22,360 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -21 predicate places. [2025-03-17 10:59:22,360 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 270 transitions, 1025 flow [2025-03-17 10:59:22,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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-17 10:59:22,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:22,361 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] [2025-03-17 10:59:22,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:59:22,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1317270652, now seen corresponding path program 1 times [2025-03-17 10:59:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802650344] [2025-03-17 10:59:22,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:59:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:59:22,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:22,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:22,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:22,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802650344] [2025-03-17 10:59:22,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802650344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:22,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099705952] [2025-03-17 10:59:22,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:22,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:22,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:22,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:23,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 250 [2025-03-17 10:59:23,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 270 transitions, 1025 flow. Second operand has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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-17 10:59:23,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:23,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 250 [2025-03-17 10:59:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:23,605 INFO L124 PetriNetUnfolderBase]: 920/2274 cut-off events. [2025-03-17 10:59:23,606 INFO L125 PetriNetUnfolderBase]: For 2962/3141 co-relation queries the response was YES. [2025-03-17 10:59:23,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7167 conditions, 2274 events. 920/2274 cut-off events. For 2962/3141 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14122 event pairs, 248 based on Foata normal form. 33/2256 useless extension candidates. Maximal degree in co-relation 5400. Up to 1189 conditions per place. [2025-03-17 10:59:23,626 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 104 selfloop transitions, 36 changer transitions 37/313 dead transitions. [2025-03-17 10:59:23,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 313 transitions, 1665 flow [2025-03-17 10:59:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2025-03-17 10:59:23,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8113333333333334 [2025-03-17 10:59:23,630 INFO L175 Difference]: Start difference. First operand has 223 places, 270 transitions, 1025 flow. Second operand 6 states and 1217 transitions. [2025-03-17 10:59:23,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 313 transitions, 1665 flow [2025-03-17 10:59:23,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 313 transitions, 1665 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:23,641 INFO L231 Difference]: Finished difference. Result has 231 places, 268 transitions, 1357 flow [2025-03-17 10:59:23,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1357, PETRI_PLACES=231, PETRI_TRANSITIONS=268} [2025-03-17 10:59:23,642 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -13 predicate places. [2025-03-17 10:59:23,642 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 268 transitions, 1357 flow [2025-03-17 10:59:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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-17 10:59:23,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:23,643 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-17 10:59:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:59:23,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:23,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash -816122382, now seen corresponding path program 1 times [2025-03-17 10:59:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279112795] [2025-03-17 10:59:23,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:23,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 10:59:23,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 10:59:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279112795] [2025-03-17 10:59:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279112795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:23,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732739483] [2025-03-17 10:59:23,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:23,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:23,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:23,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:23,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2025-03-17 10:59:23,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 268 transitions, 1357 flow. Second operand has 5 states, 5 states have (on average 212.2) internal successors, (1061), 5 states have internal predecessors, (1061), 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-17 10:59:23,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:23,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2025-03-17 10:59:23,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:23,899 INFO L124 PetriNetUnfolderBase]: 135/477 cut-off events. [2025-03-17 10:59:23,899 INFO L125 PetriNetUnfolderBase]: For 771/771 co-relation queries the response was YES. [2025-03-17 10:59:23,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 477 events. 135/477 cut-off events. For 771/771 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2261 event pairs, 12 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 1240. Up to 151 conditions per place. [2025-03-17 10:59:23,904 INFO L140 encePairwiseOnDemand]: 245/250 looper letters, 37 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-03-17 10:59:23,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 558 flow [2025-03-17 10:59:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-17 10:59:23,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868 [2025-03-17 10:59:23,907 INFO L175 Difference]: Start difference. First operand has 231 places, 268 transitions, 1357 flow. Second operand 6 states and 1302 transitions. [2025-03-17 10:59:23,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 558 flow [2025-03-17 10:59:23,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 136 transitions, 418 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-17 10:59:23,938 INFO L231 Difference]: Finished difference. Result has 138 places, 112 transitions, 248 flow [2025-03-17 10:59:23,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=138, PETRI_TRANSITIONS=112} [2025-03-17 10:59:23,940 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -106 predicate places. [2025-03-17 10:59:23,940 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 112 transitions, 248 flow [2025-03-17 10:59:23,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.2) internal successors, (1061), 5 states have internal predecessors, (1061), 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-17 10:59:23,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:23,942 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] [2025-03-17 10:59:23,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:59:23,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-17 10:59:23,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2140663855, now seen corresponding path program 1 times [2025-03-17 10:59:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125150138] [2025-03-17 10:59:23,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:23,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 10:59:23,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 10:59:23,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:23,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 10:59:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125150138] [2025-03-17 10:59:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125150138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:24,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217398120] [2025-03-17 10:59:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:24,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:24,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:24,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:24,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:24,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 250 [2025-03-17 10:59:24,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 112 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-17 10:59:24,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:24,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 250 [2025-03-17 10:59:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:24,046 INFO L124 PetriNetUnfolderBase]: 24/201 cut-off events. [2025-03-17 10:59:24,047 INFO L125 PetriNetUnfolderBase]: For 21/47 co-relation queries the response was YES. [2025-03-17 10:59:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 201 events. 24/201 cut-off events. For 21/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 467 event pairs, 18 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 315. Up to 47 conditions per place. [2025-03-17 10:59:24,048 INFO L140 encePairwiseOnDemand]: 248/250 looper letters, 0 selfloop transitions, 0 changer transitions 114/114 dead transitions. [2025-03-17 10:59:24,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 114 transitions, 288 flow [2025-03-17 10:59:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-03-17 10:59:24,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2025-03-17 10:59:24,049 INFO L175 Difference]: Start difference. First operand has 138 places, 112 transitions, 248 flow. Second operand 3 states and 670 transitions. [2025-03-17 10:59:24,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 114 transitions, 288 flow [2025-03-17 10:59:24,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 114 transitions, 281 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:24,051 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-03-17 10:59:24,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-03-17 10:59:24,051 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -109 predicate places. [2025-03-17 10:59:24,051 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-03-17 10:59:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-17 10:59:24,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-17 10:59:24,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-17 10:59:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:59:24,055 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:24,058 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:59:24,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:59:24,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:59:24 BasicIcfg [2025-03-17 10:59:24,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:59:24,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:59:24,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:59:24,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:59:24,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:15" (3/4) ... [2025-03-17 10:59:24,067 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:59:24,069 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-17 10:59:24,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-17 10:59:24,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 10:59:24,073 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:59:24,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:59:24,144 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:59:24,144 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:59:24,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:59:24,146 INFO L158 Benchmark]: Toolchain (without parser) took 9645.54ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 103.1MB in the beginning and 344.9MB in the end (delta: -241.8MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,146 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:24,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.74ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 71.9MB in the end (delta: 31.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.57ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 69.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:24,148 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,148 INFO L158 Benchmark]: IcfgBuilder took 755.20ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 97.0MB in the end (delta: -31.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,148 INFO L158 Benchmark]: TraceAbstraction took 8274.74ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 97.0MB in the beginning and 353.3MB in the end (delta: -256.3MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,149 INFO L158 Benchmark]: Witness Printer took 80.22ms. Allocated memory is still 444.6MB. Free memory was 353.3MB in the beginning and 344.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:24,150 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.74ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 71.9MB in the end (delta: 31.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.57ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 69.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 65.5MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 755.20ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 97.0MB in the end (delta: -31.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8274.74ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 97.0MB in the beginning and 353.3MB in the end (delta: -256.3MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 80.22ms. Allocated memory is still 444.6MB. Free memory was 353.3MB in the beginning and 344.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: 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: 3939]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3940]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3963]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3957]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3958]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: 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, 259 locations, 270 edges, 23 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: 8.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2491 IncrementalHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 16 mSDtfsCounter, 2491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1357occurred 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.7s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 7/7 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 10:59:24,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE